Efficient privacy-preserving association rule mining: P4P style

Proceedings of the 2007 IEEE Symposium on Computational Intelligence and Data Mining, CIDM 2007

Volumn , Issue , 2007, Pages 654-660

  Duan, Yitao ^a   Canny, John ^a   Zhan, Justin ^b  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b CARNEGIE MELLON UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ASSOCIATION RULES; CLIENT SERVER COMPUTER SYSTEMS; DATA PRIVACY; DIGITAL ARITHMETIC; INTEGER PROGRAMMING; NETWORK PROTOCOLS;

GENERAL COMPUTATION; INTEGER OPERATIONS; VERIFIABLE SECRET SHARING (VSS);

DATA MINING;

EID: 34548749964     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CIDM.2007.368938     Document Type: Conference Paper

References (31)

1. N. Zhang, S. Wang, and W. Zhao, "A new scheme on privacy-preserving data classification," in KDD '05. New York, NY, USA: ACM Press, 2005, pp. 374-383.
2. M. Kantarcioglu and C. Clifton, "Privacy-preserving distributed mining of association rules on. horizontally partitioned data," IEEE Transactions on Knowledge and Data Engineering, vol. 16, no. 9, pp. 1026-1037, 2004.
3. Y. Lindell and B. Pinkas, "Privacy preserving data mining," Journal of cryptology, vol. 15, no. 3, pp. 177-206, 2002.
4. J. Vaidya and C. Clifton, "Privacy preserving association rule mining in vertically partitioned data," in KDD '02. New York, NY, USA: ACM Press, 2002, pp. 639-644.
5. J. Vaidya and C. Clifton, "Privacy-preserving k-means clustering over vertically partitioned data," in KDD '03: Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining. New York, NY, USA: ACM Press, 2003, pp. 206-215.
6. W. Du, Y Han, and S. Chen, "Privacy-preserving multivariate statistical analysis: Linear regression, and classification," in SIAM International Conference on Data Mining, 2004, pp. 222-233.
7. J. Canny and Y Duan, "Practical private computation of vector additionbased functions or: Can privacy be for free?" Submitted to 2007 IEEE Symposium on Security and Privacy, 2006.
8. J. F. Canny and Y Duan, "Practical private computation of vector addition-based functions or: Can privacy be for free?" EECS Department, University of California, Berkeley, Tech. Rep. UCB/EECS-2006-12, February 8 2006. [Online]. Available: http://www.eecs.berkeley.edu/Pubs/TechRpts/2006/EECS- 2006-12.html
9. Z. Yang, S. Zhong, and R. N. Wright, "Privacy-preserving classification of customer data without loss of accuracy," in SDM 2005, 2005.
10. J. Canny, "Collaborative filtering with privacy," in IEEE Symposium on Security and Privacy, Oakland, CA, May 2002, pp. 45-57. [Online]. Available: http://citeseer.nj.nec.com/canny02collaborative.html
11. J. F. Canny, "Gap: a factor model for discrete data," in SIGIR '04. ACM Press, 2004, pp. 122-129.
12. 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 at the SIAM Data Mining Conference, 2005, April 2005, pp. 71-81.
13. M. Ben-Or, S. Goldwasser, and A. Wigderson, "Completeness theorems for non-cryptographic fault-tolerant distributed computation," in STOC'88. ACM, 1988, pp. 1-10.
14. O. Goldreich, Foundations of Cryptography: Volume 2 - Basic Applications. Cambridge University Press, 2004.
15. S. Goldwasser and L. Levin, "Fair computation of general functions in presence of immoral majority," in CRYPTO '90, ser. LNCS, vol. 537. Springer-Verlag, 1991, pp. 77-93.
16. R. Gennaro, M. O. Rabin, and T. Rabin, "Simplified vss and fast-track multiparty computations with applications to threshold cryptography," in PODC '98. ACM Press, 1998, pp. 101-111.
17. Y. Duan and J. Canny, "Zero-knowledge test of vector equivalence and granulation of user data with privacy," in IEEE International Conference on Granular Computing, 2006.
18. R. Agrawal, T. Imielinski, and A. Swami, "Mining association rules between sets of items in large databases," in Proceedings of ACM SIGMOD Conference on Management of Data, P. Buneman and S. Jajodia, Eds., Washington D.C., May 1993, pp. 207-216.
19. J. Zhan, "Privacy preserving collaborative data mining," Ph.D. dissertation, University of Ottawa, 2006.
20. R. Agrawal and R. Srikant, "Fast algorithms for mining association rules," in VLDB '94: Proceedings of the 20th International Conference on Very Large Data Bases. San Francisco, CA, USA: Morgan Kaufmann Publishers Inc., 1994, pp. 487-499.
21. F. Boudot, "Efficient proofs that a committed number lies in an interval," in Advances in Cryptology - EUROCRYPT 2000, ser. Lecture Notes in Computer Science, vol. 1807. Springer-Verlag, 2000, pp. 431-444.
22. J. Zhan, S. Matwin, and L. Chang, "Privacy-preserving collaborative association rule mining," in Proceedings of the 19th Annual IFIP WG 11.3 Working Conference on Data and Applications Security.
23. A. C-C. Yao, "Protocols for secure computations," in FOCS '82. IEEE, 1982, pp. 160-164.
24. O. Goldreich, S. Micali, and A. Wigderson, "How to play any mental game -a completeness theorem for protocols with honest majority," in STOC '87, 1987, pp. 218-229.
25. R. Cramer, I. Damgård, and J. B. Nielsen, "Multiparty computation from, threshold homomorphic encryption," in EUROCRYPT '01. Springer-Verlag, 2001, pp. 280-299.
26. I. Damgård and J. B. Nielsen, "Universally composable efficient multiparty computation from threshold homomorphic encryption," in CRYPTO 2003, ser. Lecture Notes in Computer Science. Springer-Verlag, 2003, pp. 247-264.
27. B. A. Coan and J. L. Welch, "Modular construction of a byzantine agreement protocol with optimal message bit complexity," Information and Computation, vol. 97, no. 1, pp. 61-85, 1992.
28. A. Evfimievski, J. Gehrke, and R. Srikant, "Limiting privacy breaches in privacy preserving data mining," in PODS '03. New York, NY, USA: ACM Press, 2003, pp. 211-222.
29. W. Du and Z. Zhan, "Using randomized response techniques for privacy-preserving data mining," in KDD '03. New York, NY, USA: ACM Press, 2003, pp. 505-510.
30. R. Wright and Z. Yang, "Privacy-preserving bayesian network structure computation on distributed heterogeneous data," in KDD '04. New York, NY, USA: ACM Press, 2004, pp. 713-718.
31. H. Kargupta, S. Datta, Q. Wang, and K. Sivakumar, "On the privacy preserving properties of random data perturbation techniques," in ICDM '03. Washington, DC, USA: IEEE Computer Society, 2003, p. 99.