Privacy-Leveled Perturbation Model for Privacy Preserving Collaborative Data Mining

Perturbation-based techniques are studied extensively in context of privacy preserving data mining. In this technique, random noise is added to the original distribution for privacy sensitive data. Next, they are sent to the data miner who will reconstruct the original data distribution from the perturbed sets. Perturbation approaches project a trade-off between applicability of data versus privacy achieved. Also, different entities participating in collaborative data mining have different attitudes toward privacy based on their country’s customs and traditions. Contemporary-based perturbation techniques do not allow the participating entities to choose the privacy levels needed by them. This is main motivation our work. This paper presents a privacy level-based perturbation model opening new avenues for future work in this direction.

[1]  Wenliang Du,et al.  Secure multi-party computation problems and their applications: a review and open problems , 2001, NSPW '01.

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

[3]  Justin Zhijun Zhan,et al.  Privacy-preserving collaborative data mining , 2007, IEEE Computational Intelligence Magazine.

[4]  Kun Liu,et al.  Random projection-based multiplicative data perturbation for privacy preserving distributed data mining , 2006, IEEE Transactions on Knowledge and Data Engineering.

[5]  L. Willenborg,et al.  Elements of Statistical Disclosure Control , 2000 .

[6]  Keke Chen,et al.  Privacy-Preserving Multiparty Collaborative Mining with Geometric Data Perturbation , 2009, IEEE Transactions on Parallel and Distributed Systems.

[7]  Alexandre V. Evfimievski,et al.  Limiting privacy breaches in privacy preserving data mining , 2003, PODS.

[8]  Chris Clifton,et al.  Privacy-preserving distributed mining of association rules on horizontally partitioned data , 2004, IEEE Transactions on Knowledge and Data Engineering.

[9]  Jaideep Vaidya,et al.  Privacy preserving association rule mining in vertically partitioned data , 2002, KDD.

[10]  Andrew Chi-Chih Yao,et al.  Protocols for secure computations , 1982, FOCS 1982.

[11]  Charu C. Aggarwal,et al.  On the design and quantification of privacy preserving data mining algorithms , 2001, PODS.

[12]  Ronald L. Rivest,et al.  ON DATA BANKS AND PRIVACY HOMOMORPHISMS , 1978 .

[13]  Li Liu,et al.  The applicability of the perturbation based privacy preserving data mining for real-world data , 2008, Data Knowl. Eng..

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

[15]  Yehuda Lindell,et al.  Parallel Coin-Tossing and Constant-Round Secure Two-Party Computation , 2001, Journal of Cryptology.

[16]  Wenliang Du,et al.  Privacy-preserving cooperative scientific computations , 2001, Proceedings. 14th IEEE Computer Security Foundations Workshop, 2001..

[17]  Rebecca N. Wright,et al.  Privacy-preserving distributed k-means clustering over arbitrarily partitioned data , 2005, KDD '05.

[18]  Wenliang Du,et al.  Deriving private information from randomized data , 2005, SIGMOD '05.

[19]  Yehuda Lindell,et al.  Privacy Preserving Data Mining , 2002, Journal of Cryptology.

[20]  Kun Liu,et al.  An Attacker's View of Distance Preserving Maps for Privacy Preserving Data Mining , 2006, PKDD.