A Survey on Privacy Preserving Data Mining Techniques

Objectives: Recently Privacy preserving data mining (PPDM) is known to be the most important aspect among researchers. As Privacy preserving data mining permits, sharing and exchanging of privacy susceptible data for analysis, it has grown more and more popular. Since one of the important aspects of data mining is safeguarding privacy, this paper aims to analyze different technique adopted for preserving privacy while maintaining the real characteristic of data under consideration. Methods/Statistical Analysis: In this paper, the authors evaluate the usefulness of PPDM techniques based on its performance, data usage, and uncertainty level and so on. The findings of authors and limitations in each technique are consolidated. Findings: Each technique has its unique way of usefulness apart from its limitations. Anonymization approach makes the data owners anonymous but vulnerable to attacks like linking attacks. Perturbation approach protects each and every attribute independently but unable to regenerate the original values from the perturbed data. Randomization technique provides good security for individual’s private data but the utility of the data. The degradation of the utility of the data is due to the noise added. The cryptographic technique provides good security for the data while providing high utility. But it falls short in efficiency when compared with other methods. Anyhow, there is no single privacy protecting algorithm capable of outperforming every other algorithm in all possible yardsticks. On the contrary, one algorithm may do well when compared to another, on a particular criterion. Novelty/Improvement: The paper presents various techniques which are used to perform PPDM technique and also tabulates their advantages and disadvantages.

[1]  Mohammad Naderi Dehkordi,et al.  A Hybrid Algorithm based on Heuristic Method to Preserve Privacy in Association Rule Mining , 2016 .

[2]  P. Sakthivel,et al.  Preservation of Private Information using Secure Multi-Party Computation , 2016 .

[3]  Yan Zhao,et al.  A Survey on Privacy Preserving Approaches in Data Publishing , 2009, 2009 First International Workshop on Database Technology and Applications.

[4]  Chris Clifton,et al.  Tools for privacy preserving distributed data mining , 2002, SKDD.

[5]  Avi Wigderson,et al.  Completeness theorems for non-cryptographic fault-tolerant distributed computation , 1988, STOC '88.

[6]  Joshua Zhexue Huang,et al.  Rating: Privacy Preservation for Multiple Attributes with Different Sensitivity Requirements , 2011, 2011 IEEE 11th International Conference on Data Mining Workshops.

[7]  Oded Goldreich,et al.  A randomized protocol for signing contracts , 1985, CACM.

[8]  Pingshui Wang Survey on Privacy Preserving Data Mining , 2010 .

[9]  Rakesh Agrawal,et al.  Privacy-preserving data mining , 2000, SIGMOD 2000.

[10]  Ninghui Li,et al.  t-Closeness: Privacy Beyond k-Anonymity and l-Diversity , 2007, 2007 IEEE 23rd International Conference on Data Engineering.

[11]  Andrew Chi-Chih Yao,et al.  How to generate and exchange secrets , 1986, 27th Annual Symposium on Foundations of Computer Science (sfcs 1986).

[12]  Philip S. Yu,et al.  Privacy-preserving data publishing: A survey of recent developments , 2010, CSUR.

[13]  Qi Wang,et al.  On the privacy preserving properties of random data perturbation techniques , 2003, Third IEEE International Conference on Data Mining.

[14]  Latanya Sweeney,et al.  k-Anonymity: A Model for Protecting Privacy , 2002, Int. J. Uncertain. Fuzziness Knowl. Based Syst..