Research Article
A Secure Multiparty Product Protocol for Preserving the Privacy in Collaborative Data Mining
|
International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
|
| Volume 1 - Issue 12 |
| Published: February 2010 |
| Authors: G.Chitra Ganapathi, G.Swathi, S.Karthick |
10.5120/264-423
|
| PDF not available |
G.Chitra Ganapathi, G.Swathi, S.Karthick . A Secure Multiparty Product Protocol for Preserving the Privacy in Collaborative Data Mining. International Journal of Computer Applications. 1, 12 (February 2010), 41-47. DOI=10.5120/264-423
@article{ 10.5120/264-423,
author = { G.Chitra Ganapathi,G.Swathi,S.Karthick },
title = { A Secure Multiparty Product Protocol for Preserving the Privacy in Collaborative Data Mining },
journal = { International Journal of Computer Applications },
year = { 2010 },
volume = { 1 },
number = { 12 },
pages = { 41-47 },
doi = { 10.5120/264-423 },
publisher = { Foundation of Computer Science (FCS), NY, USA }
}
%0 Journal Article
%D 2010
%A G.Chitra Ganapathi
%A G.Swathi
%A S.Karthick
%T A Secure Multiparty Product Protocol for Preserving the Privacy in Collaborative Data Mining%T
%J International Journal of Computer Applications
%V 1
%N 12
%P 41-47
%R 10.5120/264-423
%I Foundation of Computer Science (FCS), NY, USA
Abstract
In the modern business world, collaborative data mining becomes especially important because of the mutual benefit it brings to the collaborators. During the collaboration, each party of the collaboration needs to share its data with other parties. If the parties don't care about their data privacy, the collaboration can be easily achieved. Privacy concerns parties, each having a private data set, want to jointly conduct association rule mining without disclosing their private data to other parties. This paper deals with how to conduct collaborative data mining, one of the core data mining techniques, on private data. There is no central, trusted party having access to all the data. Instead, a protocol using Homomorphic encryption-techniques, to exchange the data while keeping it private, is used.
References
- R. Agrawal and R. Srikant. Privacy-preserving data mining. In Proceedings of the 2000 ACM SIGMOD on Management of Data, pages 439{450, Dallas, TX USA, May 15 - 18 2000.
- D. Beaver. Commodity-based cryptography extended abstract). In Proceedings of the twenty-ninth annual CM symposium on Theory of computing, El Paso,TX USA, May 4-6 1997.
- W. Du and Z. Zhan. Building decision tree classifer on private data. In Workshop on Privacy, Security, and Data Mining at the 2002 IEEE International Conference on ata Mining (ICDM'02), Maebashi City, Japan, December 9 2002.
- W. Du and Z. Zhan. Using randomized response techniques for privacy-preserving data mining. In Proceedings of The 9th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, Washington, DC, USA, August 24-27 2003.
- O. Goldreich. Secure multiparty computation (working http://www.wisdom.weizmann.ac.il/home/oded/public ml/foc.html, 1998.
- J. Han and M. Kamber. Data Mining Concepts and Techniques. Morgan Kaufmann Publishers, 2001.
- Y. Lindell and B. Pinkas. Privacy preserving data mining. In Advances in Cryptology - Crypto2000, LectureNotes in Computer Science, volume 1880, 2000.
- 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 SIGMOD93, pages 207{216, May 1993.
- J. Vaidya and C. Clifton. Privacy preserving association rule mining in vertically partitioned data. In Proceedings of the 8th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, July 23-26 2002.
- A.C. Yao. Protocols for secure computations. In Proceedings of the 23rd Annual IEEE Symposium on Foundations of Computer Science, 1982.
Index Terms
Keywords