Secure distributed k-anonymous pattern mining

Proceedings - IEEE International Conference on Data Mining, ICDM

Volumn , Issue , 2006, Pages 319-329

  Jiang, Wei ^a   Atzori, Maurizio ^b  

^a PURDUE UNIVERSITY   (United States)

^b UNIVERSITY OF PISA   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

AD HOC SECURE MULTI PARTY COMPUTATION PROTOCOLS; ANONYMITY; DISTRIBUTED ENVIROMENTS; PATTERN MINING;

AD HOC NETWORKS; ALGORITHMS; COMPUTER AIDED SOFTWARE ENGINEERING; CRYPTOGRAPHY; DATA MINING; DATA PRIVACY; MATHEMATICAL MODELS;

PATTERN RECOGNITION;

EID: 79955039516     PISSN: 15504786     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICDM.2006.140     Document Type: Conference Paper

References (26)

1. R. Agrawal and R. Srikant. Fast algorithms for mining association rules. In Proceedings of the 20th International Conference on Very Large Data Bases, pages 487-499, Santiago, Chile, Sept. 12-15 1994. VLDB.
2. R. Agrawal and R. Srikant. Privacy-preserving data mining. In Proceedings of the 2000 ACM SIGMOD Conference on Management of Data, pages 439-450, Dallas, TX, May 14-19 2000. ACM.
3. M. Atzori, F. Bonchi, F. Giannotti, and D. Pedreschi. Blocking anonymity threats raised by frequent itemset mining. In Proceedings of the 5th IEEE International Conference on Data Mining (ICDM 2005), 27-30 November 2005, Houston, Texas, USA, pages 561-564. IEEE Computer Society, 2005.
4. M. Atzori, F. Bonchi, F. Giannotti, and D. Pedreschi. k-anonymous patterns. In Knowledge Discovery in Databases: PKDD 2005, 9th European Conference on Principles and Practice of Knowledge Discovery in Databases, Porto, Portugal, October 3-7, 2005, Proceedings, Lecture Notes in Computer Science, pages 10-21. Springer, 2005.
5. R. J. Bayardo and R. Agrawal. Data privacy through optimal k-anonymization. In Proceedings of the IEEE International Conference on Data Engineering, Tokyo, Japan, Apr. 5-8 2005.
6. C. Blake and C. Merz. UCI repository of machine learning databases, 1998.
7. T. Calders and B. Goethals. Mining all non-derivable frequent itemsets. In Proceedings of the 6th PKDD, 2002.
8. A. Friedman, A. Schuster, and R. Wolff, k-anonymous decision tree induction. In Knowledge Discovery in Databases: PKDD 2006, 10th European Conference on Principles and Practice of Knowledge Discovery in Databases, Berlin, Germany, September 18-22, 2006, Proceedings, Lecture Notes in Computer Science, pages 10-21. Springer, 2006.
9. B. Goethals, S. Laur, H. Lipmaa, and T. Mielikainen. On secure scalar product computation for privacy-preserving data mining. In C. Park and S. Chee, editors, The 7th Annual International Conference in Information Security and Cryptology (ICISC 2004), Seoul, Korea, Dec. 2-3 2004.
10. O. Goldreich. The Foundations of Cryptography, volume 2, chapter General Cryptographic Protocols. Cambridge University Press, 2004.
11. O. Goldreich, S. Micali, and A. Wigderson. How to play any mental game - a completeness theorem for protocols with honest majority. In 19th ACM Symposium on the Theory of Computing, pages 218-229, 1987.
12. D. Hand, H. Mannila, and P. Smyh. Principles of Data Mining. The MIT Press, 2001.
13. W. Jiang and C. Clifton. A secure distributed framework for achieving k-anonymity. Special Issue of the VLDB Journal on Privacy-Preserving Data Management, Sept. 2006.
14. M. Kantarcioglu, J. Jin, and C. Clifton. When do data mining results violate privacy? In Proceedings of the 2004 ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pages 599-604, Seattle, WA, Aug. 22-25 2004.
15. K. LeFevre, D. DeWitt, and R. Ramakrishnan. Incognito: Efficient full-domain k-anonymity. In Proceedings of the 2005 ACM SIGMOD International Conference on Management of Data, Baltimore, MD, June 13-16 2005.
16. Y Lindell and B. Pinkas. Privacy preserving data mining. In Advances in Cryptology - CRYPTO 2000, pages 36-54. Springer-Verlag, Aug. 20-24 2000.
17. A. Meyerson and R. Williams. On the complexity of optimal k-anonymity. In Proceedings of the 23rd ACM SIGACTSIGMOD-SIGART Symposium on Principles of Database Systems (PODS 2004), Paris, France, June 14-16 2004. ACM Press.
18. T. Okamoto and S. Uchiyama. A new public-key cryptosystem as secure as factoring. In Advances in Cryptology - Eurocrypt '98, LNCS 1403, pages 308-318. Springer-Verlag, 1998.
19. P. Samarati. Protecting respondents' identities in microdata release. IEEE Transactions on Knowledge and Data Engineering (TKDE), 13(6):1010-1027, 2001.
20. P. Samarati and L. Sweeney. Generalizing data to provide anonymity when disclosing information (abstract). In Proceedings of the seventeenth ACM SIGACT-SIGMODSIGART symposium on Principles of Database Systems (PODS), page 188, New York, NY, USA, 1998. ACM Press.
21. L. Sweeney. Achieving k-anonymity privacy protection using generalization and suppression. International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems, 10(5):571-588, 2002.
22. L. Sweeney. k-Anonymity: a model for protecting privacy. International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems, 10(5):557-570, 2002.
23. J. Vaidya and C. Clifton. Privacy-preserving k-means clustering over vertically partitioned data. In The Ninth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pages 206-215, Washington, DC, Aug. 24-27 2003.
24. J. Vaidya and C. Clifton. Secure set intersection cardinality with application to association rule mining. Journal of Computer Security, 13(4):593-622, Nov. 2005.
25. A. C. Yao. How to generate and exchange secrets. In Proceedings of the 27th IEEE Symposium on Foundations of Computer Science, pages 162-167. IEEE, 1986.
26. 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 Database and Applications Security, Storrs, Connecticut, Aug. 7-10 2005.