%0 Conference Paper %1 selim2009efficient %A Kaya, Selim %A Pedersen, Thomas %A Savaş, Erkay %A Saygın, Yücel %B PAKDD 2007 International Workshops: Emerging Technologies in Knowledge Discovery and Data Mining %D 2009 %K imported %P 280--291 %T Efficient Privacy Preserving Distributed Clustering Based on Secret Sharing %U http://dx.doi.org/10.1007/978-3-540-77018-3_29 %X 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 thatit utilizes two non-colluding third parties. We provide a brief security analysis of our protocol from information theoreticpoint of view, which is a stronger security model. We show communication and computation complexity analysis of our protocolalong with another protocol previously proposed for the same problem. We also include experimental results for computationand communication overhead of these two protocols. Our protocol not only outperforms the others in execution time and communicationoverhead on data holders, but also uses a more efficient model for many data mining applications.

@inproceedings{selim2009efficient, abstract = {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 thatit utilizes two non-colluding third parties. We provide a brief security analysis of our protocol from information theoreticpoint of view, which is a stronger security model. We show communication and computation complexity analysis of our protocolalong with another protocol previously proposed for the same problem. We also include experimental results for computationand communication overhead of these two protocols. Our protocol not only outperforms the others in execution time and communicationoverhead on data holders, but also uses a more efficient model for many data mining applications.}, added-at = {2009-10-27T16:18:48.000+0100}, author = {Kaya, Selim and Pedersen, Thomas and Savaş, Erkay and Saygın, Yücel}, biburl = {https://www.bibsonomy.org/bibtex/2392f2e2e70bf6c551afb30c98e1e6b56/modap}, booktitle = {PAKDD 2007 International Workshops: Emerging Technologies in Knowledge Discovery and Data Mining}, description = {SpringerLink - Book Chapter}, interhash = {7162f3160042f53c77ee35bd3878682c}, intrahash = {392f2e2e70bf6c551afb30c98e1e6b56}, keywords = {imported}, pages = {280--291}, timestamp = {2009-10-27T16:18:48.000+0100}, title = {Efficient Privacy Preserving Distributed Clustering Based on Secret Sharing}, url = {http://dx.doi.org/10.1007/978-3-540-77018-3_29}, year = 2009 }