Research Repository

Equally contributory privacy-preserving k-means clustering over vertically partitioned data

Yi, Xun and Zhang, Yanchun (2012) Equally contributory privacy-preserving k-means clustering over vertically partitioned data. Information systems, 38 (1). pp. 97-107. ISSN 0306-4379 (print), 1873-6076 (online)

Full text for this resource is not available from the Research Repository.


In recent years, there have been numerous attempts to extend the k-means clustering protocol for single database to a distributed multiple database setting and meanwhile keep privacy of each data site. Current solutions for (whether two or more) multiparty k-means clustering, built on one or more secure two-party computation algorithms, are not equally contributory, in other words, each party does not equally contribute to k-means clustering. This may lead a perfidious attack where a party who learns the outcome prior to other parties tells a lie of the outcome to other parties. In this paper, we present an equally contributory multiparty k-means clustering protocol for vertically partitioned data, in which each party equally contributes to k-means clustering. Our protocol is built on ElGamal's encryption scheme, Jakobsson and Juels's plaintext equivalence test protocol, and mix networks, and protects privacy in terms that each iteration of k-means clustering can be performed without revealing the intermediate values.

Item Type: Article
Uncontrolled Keywords: ResPubID26654, privacy-preserving distributed data mining, k-means clustering, data security, cluster analysis, clusters, algorithms
Subjects: FOR Classification > 0804 Data Format
Faculty/School/Research Centre/Department > College of Science and Engineering
Depositing User: Yimin Zeng
Date Deposited: 15 Nov 2013 00:54
Last Modified: 04 Mar 2015 03:00
ePrint Statistics: View download statistics for this item
Citations in Scopus: 18 - View on Scopus

Repository staff only

View Item View Item

Search Google Scholar