Secure two-party k-means clustering

Proceedings of the ACM Conference on Computer and Communications Security

Volumn , Issue , 2007, Pages 486-497

  Bunn, Paul ^a   Ostrovsky, Rafail ^b  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b University of California   (United States)

Author keywords

K means clus tering; SecureMultiparty computation

Indexed keywords

DATABASE CLUSTERING; HOMOMORPHIC-ENCRYPTIONS; K-MEANS; K-MEANS CLUSTERING; MULTIPLE ITERATIONS; RANDOM SAMPLING; RANDOM VALUES; SECURE COMPUTATION;

CRYPTOGRAPHY; DATABASE SYSTEMS; IMAGE QUALITY; NETWORK PROTOCOLS; WATER SUPPLY SYSTEMS;

NETWORK SECURITY;

EID: 74049103179     PISSN: 15437221     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1315245.1315306     Document Type: Conference Paper

References (27)

1. D. Agrawal and C. Aggarwal. "On the Design and Quantification of Privacy Preserving Data Mining Algorithms." Proc. of the 20th ACM SIGMOD-SIGACT-SIGART Symp. on Principles of Database Systems, pp. 247-255. 2001.
2. R. Agrawal and R. Srikant. "Privacy-Preserving Data Mining." Proc. of the 2000 ACM SIGMOD Int. Conf. on Management of Data, pp. 439-450. 2000.
3. A. Blum, C. Dwork, F. McSherry and K. Nissim. "Practical Privacy: The SuLQ Framework." 24th Symposium on Prin-ciples of Database Systems, pp. 128-138. 2005.
4. P. Bradley and U. Fayyad. "Refining Initial Points for K-Means Clustering." Proc. of the 15th International Conference on Machine Learning, pp. 91-99. 1998.
5. R. Canetti. "Security and Composition of Multiparty Cryptographic Protocols." J. of Cryptology, Vol. 13 No. 1 pp. 143-202. 2000.
6. C. Dwork, F. McSherry, K. Nissim, and A. Smith. "Calibrating Noise to Sensitivity Private Data Analysis." Proc. of the 3rd Theory of Cryptography Conference, pp. 265-284. 2006.
7. I. Dinur and K. Nissim. "Revealing Information While Preserving Privacy." Proc. of the 22nd ACM SIGMOD-SIGACT-SIGART Symp. on Principles of Database Systems, pp. 202-210. 2003.
8. C. Dwork and K. Nissim. "Privacy-Preserving Datamining on Vertically Partitioned Data-bases." CRYPTO '04, LNCS 3152, pp. 528-544. 2004.
9. B. Goethals, S. Laur, H. Lipmaa and T. Mielikäinen. "On Private Scalar Product Computation for Privacy-Preserving Data Mining." ICISC, LNCS 3506, pp. 104-120. 2004.
10. O. Goldreich. "The Foundations of Cryptography, Basic Applications." Cambridge University Press. 2004.
11. O. Goldreich, S. Micali and A. Wigderson. "How to Play Any Mental Game." Proc. of the 19th STOC, pp. 218-229. 1987.
12. Y. Isahi, E. Kushilevitz, R. Ostrovsky, and A. Sahai. "Zero-Knowledge from Secure Multiparty Computation. " ACM Symposium on Theory of Computing. 2007
13. G. Jagannathan and R. Wright. "Privacy-Preserving Distributed k-Means Clustering over Arbitrarily Partitioned Data." KDD '05, pp. 593-599. 2005.
14. S. Jha, L. Kruger and P. McDaniel. "Privacy Preserving Clustering." 10th European Symp. on Research in Computer Security, pp. 397-417. 2005.
15. E. Kiltz, G. Leander and J. Malone-Lee. "Secure Computation of the Mean and Related Statistics." TCC '05, LNCS 3378, pp. 283-302. 2005.
16. Y. Lindell and B. Pinkas. "Privacy Preserving Data Mining." CRYPTO '00, LNCS 1880, pp. 36-54. 2000.
17. S. Oliveira and O. R. Zaïane. "Privacy Preserving Clustering by Data Transformation. " Proc. 18th Brazilian Symposium on Databases, pp. 304-318. 2003.
18. M. Ben-Or, S. Goldwasser, and A. Wigderson. "Completeness Theorems for Non-Cryptographic Fault-Tolerant Distributed Computation. " Proc. 20th Annual ACM Symp. on Theory of Computing, pp. 1-10. 1988.
19. R. Ostrovsky, Y. Rabani, L. Schulman, and C. Swamy. "The Effectiveness of Lloyd-Type Methods for the k-Means Problem." FOCS. 2006.
20. M. Naor and B. Pinkas. "Oblivious Polynomial Evaluation. " SIAM J. of Computing, Vol. 35 No. 5, pp. 1254-1281. 2006.
21. P. Paillier. "Public Key Cryptosystems Based on Composite Degree Residuosity Classes." Advances in Cryptology EURO-CRYPT '99 Proceedings, LNCS 1592, pp. 223-238. 1999.
22. J. Reif and S. Tate. "Optimal Size Integer Division Circuits." SIAM J. on Computing, pp. 912-924. 1990.
23. C. Su, F. Bao, J. Zhou, T. Takagi and K. Sakurai. "Privacy- Preserving Two-Party K-Means Clustering via Secure Approximation. " 21st Inter. Conf. on Advanced Information Networking and Applications Workshops, pp. 385-391. 2007.
24. J. Vaidya and C. Clifton. "Privacy-Preserving k-Means Clustering over Vertically Partitioned Data." Proc. 9th ACM SIGDD Inter. Conf. on Knowledge Discovery and Data Mining, 206-215. 2003.
25. R. Wright and Z. Yang. "Privacy-Preserving Bayesian Network Structure Computation on Distributed Heterogeneous Data." Proc. of the 10th ACM SIGKDD Inter. Conf. on Knowledge Discovery and Data Mining, pp. 713-718. 2004.
26. A. C. C. Yao. "How to Generate and Exchange Secrets." Proc. of the 27th IEEE Symp. on Foundations of Computer Science, pp. 162-167. 1986.
27. H. Zhu and F. Bao. "Oblivious Scalar-Product Protocols." 11th Australasian Conference on Information Security and Privacy, LNCS 4058, pp. 313-323. 2006.