Practical private computation and zero-knowledge tools for privacy-preserving distributed data mining

Society for Industrial and Applied Mathematics - 8th SIAM International Conference on Data Mining 2008, Proceedings in Applied Mathematics 130

Volumn 1, Issue , 2008, Pages 265-276

  Duan, Yitao ^a   Canny, John ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CRYPTOGRAPHY; DATA PRIVACY; K-MEANS CLUSTERING; LEARNING ALGORITHMS; MACHINE LEARNING; MAXIMUM PRINCIPLE;

ARITHMETIC OPERATIONS; CRYPTOGRAPHIC OPERATIONS; DISTRIBUTED DATA MINING; EXPECTATION MAXIMIZATION; PRIVACY PRESERVING DATA MINING; PRIVACY-PRESERVING DISTRIBUTED DATA MINING; STATISTICAL QUERY MODELS; VERIFIABLE SECRET SHARING;

DATA MINING;

EID: 52649158733     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1137/1.9781611972788.24     Document Type: Conference Paper

References (36)

1. R. Agrawal and R. Srikant. Privacy-preserving data mining. In SIGMOD '00, pages 439-450. ACM Press, 2000.
2. A. Blum, C. Dwork, F. McSherry, and K. Nissim. Practical privacy: the SuLQ framework. In PODS '05, pages 128-138, New York, NY, USA, 2005. ACM Press.
3. J. Canny. Collaborative filtering with privacy. In IEEE Symposium on Security and Privacy, pages 45-57, Oakland, CA, May 2002.
4. J. Canny. Collaborative filtering with privacy via factor analysis. In SIGIR '02, pages 238-245. ACM Press, 2002.
5. B. Chor, S. Goldwasser, S. Micali, and B. Awerbuch. Verifiable secret sharing and achieving simultaneity in the presence of faults. In IEEE Foundations of Computer Science, pages 383-395, 1985.
6. C.-T. Chu, S. K. Kim, Y.-A. Lin, Y. Yu, G. Bradski, A. Y. Ng, and K. Olukotun. Map-reduce for machine learning on multicore. In NIPS 2006, 2006.
7. R. Cramer and I. Damgård. Zero-knowledge proof for finite field arithmetic, or: Can zero-knowledge be for free? In CRYPTO '98. Springer-Verlag, 1998.
8. R. Cramer, I. Damgård, and J. B. Nielsen. Multiparty computation from threshold homomorphic encryption. In EUROCRYPT '01, pages 280-299. Springer-Verlag, 2001.
9. A. S. Das, M. Datar, A. Garg, and S. Rajaram. Google news personalization: scalable online collaborative filtering. In WWW '07, pages 271-280, New York, NY, USA, 2007. ACM Press.
10. I. Dinur and K. Nissim. Revealing information while preserving privacy. In PODS '03, pages 202-210, New York, NY, USA, 2003. ACM Press.
11. W. Du, Y. Han, and S. Chen. Privacy-preserving multivariate statistical analysis: Linear regression and classification. In SIAM International Conference on Data Mining, pages 222-233, 2004.
12. W. Du and Z. Zhan. Using randomized response techniques for privacy-preserving data mining. In KDD '03, pages 505-510. ACM Press, 2003.
13. Y. Duan and J. Canny. Zero-knowledge test of vector equivalence and granulation of user data with privacy. In IEEE GrC 2006, 2006.
14. Y. Duan, J. Wang, M. Kam, and J. Canny. A secure online algorithm for link analysis on weighted graph. In Proceedings of the Workshop on Link Analysis, Counterterrorism and Security, SIAM Data Mining Conference, 2005, pages 71-81.
15. C. Dwork, F. McSherry, K. Nissim, and A. Smith. Calibrating noise to sensitivity in private data analysis. In TCC 2006, volume 3876 of LNCS, pages 265-284. Springer, 2006.
16. A. Evfimievski, J. Gehrke, and R. Srikant. Limiting privacy breaches in privacy preserving data mining. In PODS '03, pages 211-222. ACM Press, 2003.
17. M. Fitzi, M. Hirt, and U. Maurer. General adversaries in unconditional multi-party computation. In ASIACRYPT 99, volume 1716 of LNCS, pages 232-246. Springer-Verlag, 1999.
18. R. Gennaro, M. O. Rabin, and T. Rabin. Simplified vss and fast-track multiparty computations with applications to threshold cryptography. In PODC '98, pages 101-111. ACM Press, 1998.
19. O. Goldreich. Foundations of Cryptography: Volume 2 Basic Applications. Cambridge University Press, 2004.
20. O. Goldreich and Y. Oren. Definitions and properties of zero-knowledge proof systems. Journal of Cryptology, 7(1):1-32, 1994.
21. S. Goldwasser, S. Micali, and C. Rackoff. The knowledge complexity of interactive proof systems. SIAM Journal on Computing, 18(1):186-208, 1989.
22. M. Hirt and U. Maurer. Complete characterization of adversaries tolerable in secure multi-party computation (extended abstract). In PODC '97, pages 25-34, 1997.
23. M. Hirt and U. Maurer. Player simulation and general adversary structures in perfect multiparty computation. Journal of Cryptology, 13(1):31-60, 2000.
24. T. Hofmann. Latent semantic models for collaborative filtering. ACM Transactions on Information Systems, 22(1):89-115, 2004.
25. M. Kantarcioglu and C. Clifton. Privacy-preserving distributed mining of association rules on horizontally partitioned data. IEEE Transactions on Knowledge and Data Engineering, 16(9):1026-1037, 2004.
26. H. Kargupta, S. Datta, Q. Wang, and K. Sivakumar. On the privacy preserving properties of random data perturbation techniques. In ICDM '03, page 99, Washington, DC, USA, 2003. IEEE Computer Society.
27. M. Kearns. Efficient noise-tolerant learning from statistical queries. In STOC '93, pages 392-401, New York, NY, USA, 1993. ACM Press.
28. Y. Lindell and B. Pinkas. Privacy preserving data mining. Journal of cryptology, 15(3):177-206, 2002.
29. R. Motwani and P. Raghavan. Randomized Algorithms. Cambridge University Press, 1995.
30. T. Pedersen. Non-interactive and informationtheoretic secure verifiable secret sharing. In CRYPTO '91, volume 576 of Lecture Notes in Computer Science, pages 129-140. Springer-Verlag, 1991.
31. B. M. Sarwar, G. Karypis, J. A. Konstan, and J. Riedl. Application of dimensionality reduction in recommender system - a case study. In ACM WebKDD 2000 Web Mining for E-Commerce Workshop, 2000.
32. G. W. Stewart and J.-G. Sun. Matrix Perturbation Theory. Academic Press, 1990.
33. J. Vaidya and C. Clifton. Privacy preserving association rule mining in vertically partitioned data. In KDD '02, pages 639-644, New York, NY, USA, 2002. ACM Press.
34. J. Vaidya and C. Clifton. Privacy-preserving k-means clustering over vertically partitioned data. In KDD '03, pages 206-215, New York, NY, USA, 2003. ACM Press.
35. R. Wright and Z. Yang. Privacy-preserving bayesian network structure computation on distributed heterogeneous data. In KDD '04, pages 713-718, New York, NY, USA, 2004. ACM Press.
36. Z. Yang, S. Zhong, and R. N. Wright. Privacy-preserving classification of customer data without loss of accuracy. In SDM 2005, 2005.