Cryptology ePrint Archive: Report 2021/612

Privacy-preserving Density-based Clustering

Beyza Bozdemir and Sébastien Canard and Orhan Ermis and Helen Möllering and Melek Önen and Thomas Schneider

Abstract: Clustering is an unsupervised machine learning technique that outputs clusters containing similar data items. In this work, we investigate privacy-preserving density-based clustering which is, for example, used in financial analytics and medical diagnosis. When (multiple) data owners collaborate or outsource the computation, privacy concerns arise. To address this problem, we design, implement, and evaluate the first practical and fully private density-based clustering scheme based on secure two-party computation. Our protocol privately executes the DBSCAN algorithm without disclosing any information (including the number and size of clusters). It can be used for private clustering between two parties as well as for private outsourcing of an arbitrary number of data owners to two non-colluding servers. Our implementation of the DBSCAN algorithm privately clusters data sets with 400 elements in 7 minutes on commodity hardware. Thereby, it flexibly determines the number of required clusters and is insensitive to outliers, while being only factor 19x slower than today's fastest private K-means protocol (Mohassel et al., PETS'20) which can only be used for specific data sets. We then show how to transfer our newly designed protocol to related clustering algorithms by introducing a private approximation of the TRACLUS algorithm for trajectory clustering which has interesting real-world applications like financial time series forecasts and the investigation of the spread of a disease like COVID-19.

Category / Keywords: applications / Private Machine Learning, Clustering, Secure Computation

Original Publication (in the same form): ACM ASIACCS 2021
DOI:
10.1145/3433210.3453104

Date: received 11 May 2021

Contact author: moellering at encrypto cs tu-darmstadt de

Available format(s): PDF | BibTeX Citation

Version: 20210517:061504 (All versions of this report)

Short URL: ia.cr/2021/612


[ Cryptology ePrint archive ]