Tools for Privacy Preserving Distributed Data Mining

Tools for Privacy Preserving Distributed Data Mining

Volume 4, Issue 2 - page 1 | Chris Clifton, Murat Kantarcioglu, Jaideep Vaidya, Xiaodong Lin, Michael Y. Zhu
The paper "Tools for Privacy Preserving Distributed Data Mining" by Chris Clifton, Murat Kantarcioglu, Jaideep Vaidya, and Xiaodong Lin, Michael Y. Zhu, from Purdue University, discusses the challenges and solutions for privacy-preserving data mining in distributed environments. The authors propose a toolkit of components that can be combined to address various privacy-preserving data mining problems. They highlight the importance of secure multiparty computation (SMC) and present several efficient methods for privacy-preserving computations, including secure sum, secure set union, secure size of set intersection, and scalar product. These methods are designed to be efficient and provably secure, with controlled information leakage. The paper also demonstrates how these techniques can be applied to specific data mining problems, such as association rule mining and EM clustering, while maintaining privacy. The authors emphasize the need for further research to address challenges like iterative techniques and defining privacy constraints, and they outline future directions for developing more robust privacy-preserving data mining tools.The paper "Tools for Privacy Preserving Distributed Data Mining" by Chris Clifton, Murat Kantarcioglu, Jaideep Vaidya, and Xiaodong Lin, Michael Y. Zhu, from Purdue University, discusses the challenges and solutions for privacy-preserving data mining in distributed environments. The authors propose a toolkit of components that can be combined to address various privacy-preserving data mining problems. They highlight the importance of secure multiparty computation (SMC) and present several efficient methods for privacy-preserving computations, including secure sum, secure set union, secure size of set intersection, and scalar product. These methods are designed to be efficient and provably secure, with controlled information leakage. The paper also demonstrates how these techniques can be applied to specific data mining problems, such as association rule mining and EM clustering, while maintaining privacy. The authors emphasize the need for further research to address challenges like iterative techniques and defining privacy constraints, and they outline future directions for developing more robust privacy-preserving data mining tools.
Reach us at info@study.space