Abstract
k -Nearest Neighbor (k -NN) mining aims to retrieve the k most similar objects to the query objects. It can be incorporated into many data mining algorithms, such as outlier detection, clustering, and k -NN classification. Privacy-preserving distributedk -NN is developed to address the issue while preserving the participants’ privacy. Several two-party privacy-preserving k -NN mining protocols on horizontally partitioned data had been proposed, but they fail to deal with the privacy issue when the number of the participating parties is greater than two. This paper proposes a set of protocols that can address the privacy issue when there are more than two participants. The protocols are devised with the probabilistic public-key cryptosystem and the communicative cryptosystem as the core privacy-preserving infrastructure. The protocols’ security is proved based on the Secure Multi-party Computation theory.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Vaidya, J., Clifton, C., Zhu, M.: Privacy Preserving Data Mining (Advances in Information Security). Springer, New York (2005)
Shaneck, M., Kim, Y., Kumar, V.: Privacy Preserving Nearest Neighbor Search. In: 6th IEEE International Conference on Data Mining Workshops, pp. 541–545 (2006)
Qi, Y., Atallah, M.J.: Efficient Privacy-Preserving k-Nearest Neighbor Search. In: 28th International Conference on Distributed Computing Systems, pp. 311–319 (2008)
Goldreich, O.: Foundations of Cryptography. Basic Applications, vol. 2. Press Syndicate of the University of Cambridge, Cambridge (2004)
Paillier, P.: Public-key Cryptosystems based on Composite Degree Residuosity Classes. In: Stern, J. (ed.) EUROCRYPT 1999. LNCS, vol. 1592, pp. 223–238. Springer, Heidelberg (1999)
Boneh, D.: The Decision Diffie-Hellman Problem. In: Buhler, J.P. (ed.) ANTS 1998. LNCS, vol. 1423, pp. 48–63. Springer, Heidelberg (1998)
Agrawal, R., Evfimievski, A., Srikant, R.: Information Sharing Across Private Databases. In: The 2003 ACM SIGMOD Int’l Conf. Management of Data, pp. 86–97 (2003)
Goethals, B., Laur, S., Lipmaa, H., Mielikainen, T.: On Private Scalar Product Computation for Privacy-preserving Data Mining. In: 7th Annual International Conference in Information Security and Cryptology, pp. 104–120 (2004)
Kantarcioglu, M., Clifton, C.: Privacy-preserving Distributed Mining of Association Rules on Horizontally Partitioned Data. IEEE Trans. Knowledge and Data Engineering 9(16), 1026–1037 (2004)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Zhang, F., Zhao, G., Xing, T. (2009). Privacy-Preserving Distributed k-Nearest Neighbor Mining on Horizontally Partitioned Multi-Party Data. In: Huang, R., Yang, Q., Pei, J., Gama, J., Meng, X., Li, X. (eds) Advanced Data Mining and Applications. ADMA 2009. Lecture Notes in Computer Science(), vol 5678. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-03348-3_80
Download citation
DOI: https://doi.org/10.1007/978-3-642-03348-3_80
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-03347-6
Online ISBN: 978-3-642-03348-3
eBook Packages: Computer ScienceComputer Science (R0)