Papers › Privacy-Preserving Clustering: A New ApproachBased on Invariant Order Encryption
Privacy-Preserving Clustering: A New ApproachBased on Invariant Order Encryption
Mihail-Iulian Pleșa, Cezar Pleșca
Cloud computing is increasingly used. One main use of cloud computing is the running of a machine learning algorithm. Due to the large amount of data required for these algorithms, they can no longer be run on personal computers. Uploading personal data to the cloud automatically raises the issues of confidentiality of this data. In this paper, we show through a series of experiments that an order-preserving encryption algorithm can be applied to guarantee the confidentiality of the input of two well-known clustering algorithms: K-Means and DBSCAN. We show that K-Means can be modified to be applied over the encrypted data. We also proposed a slight improvement to an order-preserving encryption scheme to ensure that it is randomized, therefore increasing its security level. Finally, after studying the performance of clustering algorithms over encrypted data we show a practical application of this idea, namely the color reduction over an encrypted image.
Code
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Tasks
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Methods
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections