Towards Efficient Cryptography for Privacy Preserving Data Mining in Distributed Systems

A common fact for both businesses and physical entities is that sensitive, accurate information would be more easily diffused if adequate measures for protection were in place. This could also lead to higher quality data mining results, in a privacy preserving manner. Recent research has proved that it is possible to provide both privacy and accuracy assurances in a distributed computing scenario, where all participants may be mutually untrusted, without the presence of an unconditionally trusted third party. We believe that valuable knowledge can be borrowed from the vast body of literature on e-auction and e-voting systems, in order to be adapted to privacy preserving data mining systems in a distributed environment. These systems tend to balance well the efficiency and security criteria, because they need to be implementable in medium to large scale environments.

[1]  Jie Wang,et al.  Addressing Accuracy Issues in Privacy Preserving Data Mining through Matrix Factorization , 2007, 2007 IEEE Intelligence and Security Informatics.

[2]  Yvo Desmedt,et al.  Threshold cryptography , 1994, Eur. Trans. Telecommun..

[3]  Ronald Cramer,et al.  A secure and optimally efficient multi-authority election scheme , 1997, Eur. Trans. Telecommun..

[4]  Dimitris Gritzalis,et al.  Secure Electronic Voting , 2003, Advances in Information Security.

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

[6]  Ramakrishnan Srikant,et al.  Privacy-preserving data mining , 2000, SIGMOD '00.

[7]  Ivan Damgård,et al.  A generalization of Paillier’s public-key system with applications to electronic voting , 2010, International Journal of Information Security.

[8]  Shafi Goldwasser,et al.  Multi party computations: past and present , 1997, PODC '97.

[9]  A. Yao,et al.  Fair exchange with a semi-trusted third party (extended abstract) , 1997, CCS '97.

[10]  David C. Parkes,et al.  Practical secrecy-preserving, verifiably correct and trustworthy auctions , 2006, ICEC '06.

[11]  Benny Pinkas,et al.  Cryptographic techniques for privacy-preserving data mining , 2002, SKDD.

[12]  Margaret H. Dunham,et al.  Data Mining: Introductory and Advanced Topics , 2002 .

[13]  Berry Schoenmakers,et al.  A Simple Publicly Verifiable Secret Sharing Scheme and Its Application to Electronic , 1999, CRYPTO.

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

[15]  Philip S. Yu,et al.  Data Mining: An Overview from a Database Perspective , 1996, IEEE Trans. Knowl. Data Eng..

[16]  Josep Domingo-Ferrer,et al.  Inference Control in Statistical Databases, From Theory to Practice , 2002 .

[17]  Jacques Stern,et al.  Practical multi-candidate election system , 2001, PODC '01.

[18]  Yehuda Lindell,et al.  Privacy Preserving Data Mining , 2000, Journal of Cryptology.

[19]  Sheng Zhong,et al.  Privacy-Preserving Classification of Customer Data without Loss of Accuracy , 2005, SDM.

[20]  Gu Si-yang,et al.  Privacy preserving association rule mining in vertically partitioned data , 2006 .

[21]  Moni Naor,et al.  Privacy preserving auctions and mechanism design , 1999, EC '99.

[22]  Ross J. Anderson.  Security engineering - a guide to building dependable distributed systems (2. ed.) , 2001 .