A generic and distributed privacy preserving classification method with a worst-case privacy guarantee

作者：Banerjee Madhushri^*; Chen Zhiyuan; Gangopadhyay Aryya

来源：Distributed and Parallel Databases, 2014, 32(1): 5-35.

DOI：10.1007/s10619-013-7126-6

• Data mining
• Privacy preserving data mining
• Classification

It is often necessary for organizations to perform data mining tasks collaboratively without giving up their own data. This necessity has led to the development of privacy preserving distributed data mining. Several protocols exist which deal with data mining methods in a distributed scenario but most of these methods handle a single data mining task. Therefore, if the participating parties are interested in more than one classification methods they will have to go through a series of distributed protocols every time, thus increasing the overhead substantially. A second significant drawback with existing methods is that they are often quite expensive due to the use of encryption operations. In this paper a method has been proposed that addresses both these issues and provides a generic approach to efficient privacy preserving classification analysis in a distributed setting with a worst-case privacy guarantee. The experimental results demonstrate the effectiveness of this method.

• 出版日期2014-3