Protocols for Privacy-Preserving DBSCAN Clustering

Cooperative computation is one of the most important fields in computer science. In recent years, the development of networking increases the desirability of cooperative computation. But privacy concerns often prevent different parties from sharing their data. Secure multiparty computation techniques can dispel parties’ doubts about revealing privacy information in this situation. On the other hand, Data mining has been a popular research area for more than a decade. However, in many applications, the data are originally collected at different sites owned by different users. This paper considers the problem of privacy preserving DBSCAN clustering over vertically partitioned data based on some results of SMC. An efficient secure intersection protocol is first proposed. The security and complexity of the protocols are also analyzed. The results show that the protocols preserve the privacy of the data and the time complexity as well as the communication complexity is acceptable.

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

[2]  Chris Clifton,et al.  Privacy preserving data mining over vertically partitioned data , 2004 .

[3]  Hans-Peter Kriegel,et al.  The R*-tree: an efficient and robust access method for points and rectangles , 1990, SIGMOD '90.

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

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

[6]  Hans-Peter Kriegel,et al.  A Density-Based Algorithm for Discovering Clusters in Large Spatial Databases with Noise , 1996, KDD.

[7]  Chen Guo-liang.  An Algorithm for Privacy-preserving Boolean Association Rule Mining , 2005 .

[8]  Daniel A. Keim,et al.  On Knowledge Discovery and Data Mining , 1997 .

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

[10]  Ananth Grama,et al.  An efficient protocol for Yao's millionaires' problem , 2003, 36th Annual Hawaii International Conference on System Sciences, 2003. Proceedings of the.

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

[12]  Chris Clifton,et al.  Privacy-preserving k-means clustering over vertically partitioned data , 2003, KDD '03.

[13]  Yücel Saygin,et al.  Privacy preserving association rule mining , 2002, Proceedings Twelfth International Workshop on Research Issues in Data Engineering: Engineering E-Commerce/E-Business Systems RIDE-2EC 2002.

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