Paper 2021/809 Original: eprint.iacr.org/2021/809 ↗

SoK: Efficient Privacy-preserving Clustering

Aditya Hegde
Helen Möllering
Thomas Schneider
Hossein Yalame
Abstract

Clustering is a popular unsupervised machine learning technique that groups similar input elements into clusters. It is used in many areas ranging from business analysis to health care. In many of these applications, sensitive information is clustered that should not be leaked. Moreover, nowadays it is often required to combine data from multiple sources to increase the quality of the analysis as well as to outsource complex computation to powerful cloud servers. This calls for efficient privacy-preserving clustering. In this work, we systematically analyze the state-of-the-art in privacy-preserving clustering. We implement and benchmark today's four most efficient fully private clustering protocols by Cheon et al. (SAC'19), Meng et al. (ArXiv'19), Mohassel et al. (PETS'20), and Bozdemir et al. (ASIACCS'21) with respect to communication, computation, and clustering quality. We compare them, assess their limitations for a practical use in real-world applications, and conclude with open challenges.

Metadata
Available format(s)
PDF
Category
Applications
Publication info
Preprint.
History
2021-06-16: last updated
2021-06-16: published
Short URL
https://ia.cr/2021/809
License
https://creativecommons.org/licenses/by/4.0/

BibTeX

@misc{cryptoeprint:2021/809,
      author = {Aditya Hegde and Helen Möllering and Thomas Schneider and Hossein Yalame},
      title = {SoK: Efficient Privacy-preserving Clustering},
      howpublished = {Cryptology {ePrint} Archive, Paper 2021/809},
      year = {2021},
      url = {https://eprint.iacr.org/2021/809}
}
Note: In order to protect the privacy of readers, this archive does not use cookies or embedded third party content.