Privacy Preserving Using Data Mining Systems and Techniques
Abstract
Privacy preserving has become crucial in knowledge-based applications. And proper integration of individual privacy is essential for data mining operations. This privacy-based data mining is important for sectors such as healthcare, pharmaceuticals, investigation and security service providers, where the data mining is transformed into cooperative task among individuals. Data mining is successful in many applications, data mining refers special concerns for private data. In data mining, clustering algorithms are most of skilled and frequently used frameworks. The integrated architecture takes a systemic view of the problem of implementing established protocols for data collection, inference control, information sharing and keeping information safety. The goal is to investigating privacy preservation issues was to take a systemic view of the architectural requirements and also design principles and explore possible solutions that would lead to the guidelines for buildup practical privacy-preserving data mining systems. In this paper, we propose the methods which uses formula-based technique for sharing of secret data in privacy-preserving mechanism. The process includes formula-based methodology which enables the information to be partitioned into numerous shares and handled independently at various servers. This paper surveys the most relevant Privacy preserving data mining 'PPDM' techniques from the literature are used to evaluate such techniques and presents the typical applications of PPDM methods in relevant fields. The ongoing current challenges and open issues in PPDM are discussed in the paper.
References (28)
- C. Clifton et al., "Tools for Privacy Preserving Distributed Data Mining," SIGKDD Explorations, vol. 4, no. 2, 2003, pp. 28-34
- L. Wang, S. Jajodia, and D. Wijesekera, "Securing OLAP Data Cubes against Privacy Breaches," Proc. 25th IEEE Symp. Security and Privacy, IEEE Press, 2004, pp. 161-175
- N. Zhang, S. Wang, and W. Zhao, "A New Scheme on Privacy- Preserving Data Classification," Proc. 11th ACM SIGKDD Int'l Conf. Knowledge Discovery and Data Mining, ACM Press, 2005, pp. 374-383.
- Z. Huang, W. Du, and B. Chen, "Deriving Private Information from Randomized Data," Proc. 24th ACM SIGMOD Int'l Conf. Management of Data, ACM Press, 2005, pp. 37-48.
- R. Agrawal and R. Srikant, "Privacy-Preserving Data Mining," Proc. 19th ACM SIGMOD Int'l Conf. Management of Data, ACM Press, 2000, pp. 439-450.
- R. Agrawal, R. Srikant, and D. Thomas, "Privacy-Preserving OLAP," Proc. 25th ACM SIGMOD Int'l Conf. Management of Data, ACM Press, 2005, pp. 251-262.
- R. Agrawal, A. Evfimievski, and R. Srikant, "Information Sharing across Private Databases," Proc. 22nd ACM SIGMOD Int'l Conf. Management of Data, ACM Press, 2003, pp. 86-97.
- N. Zhang and W. Zhao, "Distributed Privacy Preserving Information Sharing," Proc. 31st Int'l Conf. Very Large Data Bases, ACM Press, 2005, pp. 889-900.
- J. Han, M. Kamber, and J. Pei, Data Mining: Concepts and Techniques. Amsterdam, The Netherlands: Elsevier, 2012
- V. Estivill-Castro, ''Why so many clustering algorithms: A position paper,'' ACM SIGKDD Explorations Newslett., vol. 4, no. 1, pp. 65-75, 2002
- L. Cranor, T. Rabin, V. Shmatikov, S. Vadhan, and D. Weitzner, ''Towards a privacy research roadmap for the computing community,'' Comput. Commun. Consortium Committee, Comput. Res. Assoc., Washington, DC, USA, White Paper, 2015.
- M. J. Freedman, K. Nissim, and B. Pinkas, ''Efficient private matching and set intersection,'' in Proc. Int. Conf. Theory Appl. Cryptogr. Techn., 2004, pp. 1-19.
- C. C. Aggarwal, Data Mining: The Textbook. New York, NY, USA: Springer, 2015.
- V. S. Verykios, ''Association rule hiding methods,'' Wiley Interdiscipl. Rev., Data Mining Knowl. Discovery, vol. 3, no. 1, pp. 28-36, 2013
- M. Atallah, E. Bertino, A. Elmagarmid, M. Ibrahim, and V. Verykios, ''Disclosure limitation of sensitive rules,'' in Proc. Workshop Knowl. Data Eng. Exchange (KDEX), 1999, pp. 45-52
- R. Shokri, M. Stronati, C. Song, and V. Shmatikov. (2016). ''Membership inference attacks against machine learning models.'' [Online]. Available: https://arxiv.org/abs/1610.05820
- G. Ateniese, L. V. Mancini, A. Spognardi, A. Villani, D. Vitali, and G. Felici, ''Hacking smart machines with smarter ones: How to extract meaningful data from machine learning classifiers,'' Int. J. Secur. Netw., vol. 10, no. 3, pp. 137-150, 2015
- A. Shoshani, ''Statistical databases: Characteristics, problems, and some solutions,'' in Proc. VLDB, vol. 82. 1982, pp. 208-222.
- N. R. Adam and J. C. Worthmann, ''Security-control methods for statistical databases: A comparative study,'' ACM Comput. Surv., vol. 21, no. 4, pp. 515-556, 1989.
- O. Goldreich, ''Secure multi-party computation,'' Tech. Rep., 1998, pp. 86-97.
- Y. Lindell and B. Pinkas, ''Secure multiparty computation for privacypreserving data mining,'' J. Privacy Confidentiality, vol. 1, no. 1, pp. 59-98, 2009.
- M. J. Freedman, K. Nissim, and B. Pinkas, ''Efficient private matching and set intersection,'' in Proc. Int. Conf. Theory Appl. Cryptogr. Techn., 2004, pp. 1-19.
- L. Kissner and D. Song, ''Privacy-preserving set operations,'' in Proc. Annu. Int. Cryptol. Conf., 2005, pp. 241-257.
- E. Bertino, D. Lin, and W. Jiang, ''A survey of quantification of privacy preserving data mining algorithms,'' in Privacy-Preserving Data Mining. New York, NY, USA: Springer, 2008, pp. 183-205.
- S. Dua and X. Du, Data Mining and Machine Learning in Cybersecurity. Boca Raton, FL, USA: CRC Press, 2011.
- D. Agrawal and C. C. Aggarwal, ''On the design and quantification of privacy preserving data mining algorithms,'' in Proc. 20th ACM SIGMODSIGACT-SIGART Symp. Principles Database Syst., 2001, pp. 247-255.
- B. C. M. Fung, K. Wang, R. Chen, and P. S. Yu, ''Privacy-preserving data publishing: A survey of recent developments,'' ACM Comput. Surveys., vol. 42. no. 4, pp. 14:1-14:53, 2010.
- S. R. Oliveira and O. R. Zaiane, ''Privacy preserving frequent itemset mining,'' in Proc. IEEE Int. Conf. Privacy, Secur. Data Mining, vol. 14. Dec. 2002, pp. 43-54.