Privacy preserving &-means clustering in multi-party environment

SECRYPT 2007 - International Conference on Security and Cryptography, Proceedings

Volumn , Issue , 2007, Pages 381-385

  Samet, Saeed ^a   Miri, Ali ^a   Orozco Barbosa, Luis ^b  

^a UNIVERSITY OF OTTAWA   (Canada)

^b INSTITUTO DE INVESTIGACIÓN EN INFORMÁTICA DE ALBACETE   (Spain)

Author keywords

Classification and association rules; Clustering; Data mining; Distributed data structures; Mining methods and algorithms; Security and privacy protection

Indexed keywords

CLASSIFICATION AND ASSOCIATION RULES; CLUSTERING; DISTRIBUTED DATA STRUCTURES; MINING METHODS AND ALGORITHMS; SECURITY AND PRIVACY PROTECTION;

ASSOCIATION RULES; ASSOCIATIVE PROCESSING; CLUSTER ANALYSIS; CLUSTERING ALGORITHMS; CRYPTOGRAPHY; DATA STRUCTURES; KNOWLEDGE MANAGEMENT; LEARNING ALGORITHMS; MINING; NETWORK PROTOCOLS; NETWORK SECURITY;

DATA MINING;

EID: 67649816020     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (17)

1. Clifton, C, Kantarcioglu, M., Vaidya, J., Lin, X., and Zhu, M. Y. (2002). Tools for privacy preserving data mining. SIGKDD Explorations, 4(2):28-34.
2. Du, W. and Atallah, M. (2001). Privacy-preserving cooperative statistical analysis. In Proc. of the 17th Annual Computer Security Applications Conference, pages 102-110.
3. Duda, R. O., Hart, P. E., and Stork, D. G. (2000). Pattern Classification (2nd ed). John Wiley.
4. Ioannidis, I. and Grama, A. (2003). An efficient protocol for yao's millionaires' problem. In Proc. of the 36th Annual Hawaii International Conference on System Science, pages 205-211.
5. Jagannathan, G., Pillaipakkamnatt, K., and Wright, R. N. (2006). A new privacy-preserving distributed k-clustering algorithm. In Proc. of the 2006 SIAM International Conference on Data Mining.
6. Jagannathan, G. and Wright, R. N. (2005). Privacy-preserving distributed k-means clustering over arbitrarily partitioned data. In Proceeding of the 11th ACM SIGKDD international conference on Knowledge discovery in data mining, pages 593-599.
7. Jha, S., Kroger, L., and McDaniel, P. (2005). Privacy preserving clustering. In Proc. of the 10th European Symposium on Research in Computer Security, pages 397-417.
8. Malek, B. and Miri, A. (2006). Secure dot-product protocol using trace functions. 2006 IEEE International Symposium on Information Theory.
9. Merugu, S. and Ghosh, J. (2003). Privacy-preserving distributed clustering using generative models. In Proc. of the 3rd IEEE International Conference on Data Mining, pages 211-218.
10. Naor, M. and Pinkas, B. (2001). Efficient oblivious transfer protocols. In Proc. of the 12th annual ACM-SIAM symposium on Discrete algorithms, pages 448-57.
11. Oliveira, S. R. M. and Zaiane, O. R. (2003). Privacy preserving clustering by data transformation. In Proc. of the 18th Brazilian Symposium on Databases), pages 304-318.
12. Peng, K., Boyd, C, Dawson, E., and Lee, B. (2004). An efficient and verifiable solution to the millionaire problem. In Proc. of the 7th International Conference on Information Security and Cryptology, pages 51-66.
13. Samet, S. and Miri, A. (2006). Privacy preserving ID3 using Gini Index over horizontally partitioned data. Submitted.
14. Vaidya, J. and Clifton, C. (2003). Privacy-preserving k-means clustering over vertically partitioned data. In Proc. of the 9th ACM SIGKDD international conference on Knowledge discovery and data mining, pages 206-215.
15. Xiao, M.-J., Huang, L.-S., Luo, Y.-L., and Shen, H. (2005). Privacy preserving ID3 algorithm over horizontally partitioned data. In Parallel and Distributed Computing, Applications and Technologies, pages 239-243.
16. Yao, A. C. (1982). Protocols for secure computations. In Proc. of the 23th Symposium on Foundations of Computer Science, pages 160-164.
17. Yao, A. C. (1986). How to generate and exchange secrets. In Proc. of the 27th Symposium on Foundations of Computer Science, pages 162-167.