Efficient Privacy Preserving Distributed Clustering Based on Secret Sharing

Warning The system is temporarily closed to updates for reporting purpose.

Savaş, Erkay (2007) Efficient Privacy Preserving Distributed Clustering Based on Secret Sharing. In: PAKDD 2007, (Accepted/In Press)

PDF - Requires a PDF viewer such as GSview, Xpdf or Adobe Acrobat Reader


In this paper, we propose a privacy preserving distributed clustering protocol for horizontally partitioned data based on a very efficient homomorphic additive secret sharing scheme. The model we use for the protocol is novel in the sense that it utilizes two non-colluding third parties. We provide a brief security analysis of our protocol from information theoretic point of view, which is a stronger security model. We show communication and computation complexity analysis of our protocol along with another protocol previously proposed for the same problem. We also include experimental results for computation and communication overhead of these two protocols. Our protocol not only outperforms the others in execution time and communication overhead on data holders, but also uses a more efficient model for many data mining applications.

Item Type:Papers in Conference Proceedings
Subjects:T Technology > TK Electrical engineering. Electronics Nuclear engineering
ID Code:6604
Deposited By:Erkay Savaş
Deposited On:31 Oct 2007 09:42
Last Modified:31 Oct 2007 09:42

Repository Staff Only: item control page