Abstract
Privacy-preserving clustering algorithms group similar databases populated at distributed locations to improve data qualities and enable accurate data analysis and thus provide fundamental security components for distributed data mining with privacy concerns. This paper makes three contributions regarding shared κ-means clustering algorithms. First, a new notion called shared-additive-inverse (SAI) protocols — a building block for efficient implementation of shared κ-means clustering protocols within the arbitrarily partitioned database model, is introduced and formalized. Second, a generic implementation of SAI protocols from shared-scalar-product (SSP) protocols is proposed which is provably secure in the semi-honest model assuming that any underlying SSP protocol is privacy-preserving. Finally, we propose an immediate application of SAI protocols for privacy-preserving computation of shared cluster means — a crucial step in the shared κ-means clustering algorithms. To the best of our knowledge, this is the first implementation of shared κ-means clustering algorithms with provable security from SAI protocols which in turn are derived from SSP protocols.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Judit Bar-Ilan, Donald Beaver: Non-Cryptographic Fault-Tolerant Computing in Constant Number of Rounds of Interaction. PODC 1989: 201–209.
P.S. Bardley and U.M. Fayyad. Refining initial points for k-means clustering. In Proceedings of 15th International Conference on Machine Learning (ICML), pages 91–99, 1998.
Daniel Bleichenbacherl and Phong Q. Nguyen. Noisy Polynomial Interpolation and Noisy Chinese Remaindering. EUROCRYPT 2000, LNCS 1807, pp. 53–69, 2000.
Wenliang Du and Zhijun Zhan, Building decision tree classifier on private data, In Proceedings of the IEEE ICDM Workshop on Privacy, Security and Data Mining (2002).
Oded Goldreich. Foundations of Cryptography, Volume 2, Cambridge University Press, 2004.
O. Goldreich, S. Micali, and A. Wigderson. How to play any mental game — a completeness theorem for protocols with honest majority. In 19th Symposium on Theory of Computer Science, pages 218–229, 1987.
O. Goldreich, S. Micali, and A. Wigderson. Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems. Journal of the ACM, 38(1):691–729, 1991.
Bart Goethals, Sven Laur, Helger Lipmaa, Taneli Mielikäinen: On Private Scalar Product Computation for Privacy-Preserving Data Mining. ICISC 2004: 104–120
Ioannis Ioannidis, Ananth Grama, and Mikhail Atallah, A secure protocol for computing dot products in clustered and distributed environments, In Proceedings of the International Conference on Parallel Processing (2002). Geetha KDD 2005: 593–599.
Somesh Jha, Louis Kruger, Patrick McDaniel: Privacy Preserving Clustering. ESORICS 2005: 397–417
Geetha Jagannathan, Rebecca N. Wright: Privacy-preserving distributed k-means clustering over arbitrarily partitioned data. KDD 2005: 593–599.
M. Kantarcioglu and C. Clifton. Privacy-preserving distributed mining of association rules on horizontally partitioned data. In The ACM SIGMOD Workshop on Research Issues on Data Mining and Knowledge Discovery (DMKD’02), June 2, 2002.
Moni Naor, Benny Pinkas: Oblivious Transfer and Polynomial Evaluation. STOC 1999: 245–254
Benny Pinkas, Cryptographic Techniques for Privacy-Preserving Data Mining. Newsletter of the ACM Special Interest Group on Knowledge Discovery and Data Mining, January 2003.
Pascal Paillier: Public-Key Cryptosystems Based on Composite Degree Residuosity Classes. Proc. of EUROCRYPT 1999: 223–238, Springer Verlag.
Jaideep Vaidya and Chris Clifton, Privacy preserving association rule mining in vertically partitioned data, In the 8th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (2002), 639–644.
Andrew Chi-Chih Yao: How to Generate and Exchange Secrets (Extended Abstract) FOCS 1986: 162–167.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 International Federation for Information Processing
About this paper
Cite this paper
Zhu, H., Li, T., Bao, F. (2006). Privacy-Preserving Shared-Additive-Inverse Protocols and Their Applications. In: Fischer-Hübner, S., Rannenberg, K., Yngström, L., Lindskog, S. (eds) Security and Privacy in Dynamic Environments. SEC 2006. IFIP International Federation for Information Processing, vol 201. Springer, Boston, MA. https://doi.org/10.1007/0-387-33406-8_29
Download citation
DOI: https://doi.org/10.1007/0-387-33406-8_29
Publisher Name: Springer, Boston, MA
Print ISBN: 978-0-387-33405-9
Online ISBN: 978-0-387-33406-6
eBook Packages: Computer ScienceComputer Science (R0)