Privacy Preservation Approach using K-Anonymity Chinese Remainder Theorem for Intrusion Detection

  IJCOT-book-cover
 
International Journal of Computer & Organization Trends  (IJCOT)
© 2014 by IJCOT Journal
Volume - 4 Issue - 5
Year of Publication : 2014
Authors :Sanjeevaiah Kuraganti , Jeevana Jyothi. P
  10.14445/22492593/IJCOT-V12P308

MLA

Sanjeevaiah Kuraganti , Jeevana Jyothi. P. "Privacy Preservation Approach using K-Anonymity Chinese Remainder Theorem for Intrusion Detection", International Journal of Computer & organization Trends (IJCOT), V4(5):31-38 Sep - Oct 2014, ISSN:2249-2593, www.ijcotjournal.org. Published by Seventh Sense Research Group.

Abstract—Privacy preservation is vital for machine learning and data mining, but measures created to protect financial information sometimes bring about a trade off: reduced utility of the workout samples. This work introduces a privacy preserving approach that could be put on decision-tree learning, without decrease in accuracy. It describes a procedure for the preservation of privacy of collected data samples if information of one's sample database continues to be partially lost. Existing approach will not work well for sample datasets with low frequency, or if low variance within the distribution of every samples. This procedure converts the first sample data sets towards a category of unreal data sets, which actually the unique samples couldn't be reconstructed with no entire team of unreal data sets. Existing approach doesn’t provide privacy toward the selected attributes resulting from miss classification error, also existing attribute selection measures doesn’t give optimal selection gain values. Proposed system will gives optimal attribute selection measures using improved c45 algorithm in addition to privacy on attributes. In this particular proposed implementation a fresh filtering technique for preprocessing the network attacks and an improved algorithm when it comes to the classification of KDDCUP 99 dataset. Proposed decision tree algorithm is undoubtedly an optimization method utilized for fine-tuning of a given features whereas random forest, a highly accurate classifier, is created here for various kinds of attacks classification. Proposed work will concentrate more on true positive rate compare to existing approaches. The approach works with other privacy preserving approaches, for instance cryptography, for really protection. Proposed work will concentrate more on true positive rate compare to existing approaches.

References-

[1] Wenliang Du, Zhijun Zhan. Using randomized response techniques for privacy-preserving data mining[C].The 9th ACM SIGKDD Int’l Conf. Knowledge Discovery in Databases and Data Mining, Washington, D.C., 2003.
[2] LUO Yong-long, HUANG Liu-sheng, JING Wei-wei, YAOYi-fei, CHEN Guo-liang. An algorithm for privacy-preserving Boolean association rule mining. Chinese Journal of Electronics, 2005, 33(5):900-903.
[3] Zhang P, Tong YH, Tang SW, Yang DQ, Ma XL. An effective method for privacy preserving association rule mining. Journal of Software, 2006, 17(8):1764-1774.
[4] Fang Weiwei, Hu Jian, Yang Bingru. Studies on Privacy Preserving of Distributed Decision Tree Mining [A]. Computer Science, 2009 36(4):239-241
[5] Zhong Alin, Xu Fangheng. Studies on New Technology of Database Encryption [A], Journal of Henan Normal University (Natural Science), 2007 35(4) :51-53
[6] W. Du and Z. Zhan. Using randomized response techniques for privacy-preserving data mining. In KDD, pages 505– 510, 2003.
[7] A. V. Evfimievski, R. Srikant, R. Agrawal, and J. Gehrke. Privacy preserving mining of association rules. In Proceedings of the Eighth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pages 217–228, 2002.
[8] M. Kantarcioglu and C. Clifton. Privately computing a distributed k-nn classifier. In J.-F. Boulicaut, F. Esposito, F. Giannotti, and D. Pedreschi, editors, PKDD, volume 3202 of Lecture Notes in Computer Science, pages 279–290. Springer, 2004.
[9] H. Kargupta, S. Datta, Q. Wang, and K. Sivakumar. On the privacy preserving properties of random data perturbation techniques. In ICDM, pages 99–106. IEEE Computer Society, 2003.
[10] Y. Lindell and B. Pinkas. Privacy preserving data mining. In M. Bellare, editor, CRYPTO, volume 1880 of Lecture Notes in Computer Science, pages 36–54. Springer, 2000

Keywords
NID, PRIVACY RESERVING.