and Y Saygan \Efficient Privacy- preserving distributed clustering based on secret sharing

Abstract. In this paper, we propose a privacy preserving distributed clustering protocol for horizontally partitioned data based on a very ef-ficient 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 com-munication overhead of these two protocols. Our protocol not only out-performs the others in execution time and communication overhead on data holders, but also uses a more efficient model for many data mining applications.