Cryptology ePrint Archive: Report 2019/1158

Practical Privacy-Preserving K-means Clustering

Payman Mohassel and Mike Rosulek and Ni Trieu

Abstract: Clustering is a common technique for data analysis, which aims to partition data into similar groups. When the data comes from different sources, it is highly desirable to maintain the privacy of each database. In this work, we study a popular clustering algorithm (K-means) and adapt it to the privacy-preserving context.

Specifically, to construct our privacy-preserving clustering algorithm, we first propose an efficient batched Euclidean squared distance computation protocol in the adaptive amortizing setting, when one needs to compute the distance from the same point to other points. This protocol can also serve as a key building block in many real-world applications such as Bio-metric Identification. Furthermore, we construct a customized garbled circuit for computing the minimum value among shared values.

We implement and evaluate our protocols to demonstrate their practicality and show that they are able to train datasets that are much larger and faster than in the previous work. The numerical results also show that the proposed protocol achieve almost the same accuracy compared to a K-means plain-text clustering algorithm.

Category / Keywords:

Original Publication (with minor differences): PETS 2020

Date: received 5 Oct 2019, last revised 16 Jun 2020

Contact author: trieun at oregonstate edu

Available format(s): PDF | BibTeX Citation

Version: 20200616:191716 (All versions of this report)

Short URL: ia.cr/2019/1158


[ Cryptology ePrint archive ]