Privacy-preserving data mining on data grids in the presence of malicious participants

IEEE International Symposium on High Performance Distributed Computing, Proceedings

Volumn , Issue , 2004, Pages 225-234

  Gilburd, Bobi ^a   Schuster, Assaf ^a   Wolff, Ran ^a  

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

DATA GRIDS; DATA MINING MODELS; DYNAMIC DATABASES; PRIVACY PRESERVING DATA MINING ALGORITHMS;

ALGORITHMS; COMPUTER SIMULATION; CRYPTOGRAPHY; DATA PRIVACY; DATABASE SYSTEMS; SECURITY OF DATA;

DATA MINING;

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

References (20)

1. R. Agrawal, T. Imielinski, and A. Swami, "Mining association rules between sets of items in large databases," in Proc. of ACM SIGMOD'93, Washington, D.C., 1993, pp. 207-216.
2. R. Agrawal and J. Shafer, "Parallel mining of association rules," IEEE Transactions on Knowledge and Data Engineering, vol. 8(6), pp. 962-969, 1996.
3. R. Agrawal and R. Srikant, "Privacy-preserving data mining," in Proc. of ACM SIGMOD'00, Dallas, Texas, USA, May 14-19 2000, pp. 439-450.
4. A. Barabási and R. Albert, "Emergence of scaling in random networks," Science, vol. 286, pp. 509-512, October 1999.
5. "BRITE: Boston university Representative Internet Topology gEnerator," http://www.cs.bu.edu/brite/.
6. D. Cheung, J. Han, V. Ng, A. Fu, and W. Fu, "A fast distributed algorithm for mining association rules," in Proc. of PDIS'96, Florida, December 1996.
7. A. Evfimievski, R. Srikant, R. Agrawal, and J. Gehrke, "Privacy preserving mining of association rules," in Proc. of ACM SIGKDD'02, Canada, July 23-26 2002, pp. 217-228.
8. O. Goldreich, "Secure multi-party computation," 2002, http://www.wisdom.weizmann.ac.il/~oded/PS/prot.ps.
9. O. Goldreich, S. Micali, and A. Wigderson, "How to play any mental game - a completeness theorem for protocols with honest majority," in Proc. of STOC '87, 1987, pp. 218-229.
10. S. Goldwasser and S. Micali, "Probabilistic encryption," Journal of Computer and System Sciences, vol. 28, 1984.
11. M. Kantarcioglu and C. Clifton, "Privacy-preserving distributed mining of association rules on horizontally partitioned data," in Proc. of DMKD'02, June 2001
12. H. Kikuchi, "Oblivious counter and majority protocol," in Proc. of ISC 2002, Brazil, October 2002.
13. Y. Lindell and B. Pinkas, "Privacy preserving data mining," Proc. of Crypto'00, LNCS, vol. 1880, August 2000.
14. P. Paillier, "Public key cryptosystems based on composite degree residuosity classes," in Proceedings of Eurocrypt '99. Springer-Verlag, 1999, pp. 223-238.
15. A. Schuster, R. Wolff, and B. Gilburd, "Privacy-preserving association rule mining in large-scale distributed systems," in Proc. of CCGrid'04. Chicago, Illinois, USA: IEEE, April 2004.
16. R. Srikant, "Synthetic data generation code for association and sequential patterns," Available from the I.B.M. Quest Web site at http://www.almaden.ibm.com/cs/quest/.
17. R. Srikant and R. Agrawal, "Fast algorithms for mining association rules," in Proc. of VLDB'94, Santiago, Chile, September 1994, pp. 487-499.
18. L. Sweeney, "k-anonymity: A model for protecting privacy," Journal on Uncertainty, Fuzziness and Knowledge-based Systems, vol. 10, no. 5, pp. 557-570, 2002.
19. J. Vaidya and C. Clifton, "Privacy preserving association rule mining in vertically partitioned data," in Proc. of ACM SIGKDD'02, Edmonton, Alberta, Canada, July 2002.
20. R. Wolff and A. Schuster, "Association rule mining in peer-to-peer systems," in Proc. ICDM'03, November 2003.