Welcome to the resource topic for 2019/465
Title:
Towards a Practical Cluster Analysis over Encrypted Data
Authors: Jung Hee Cheon, Duhyeong Kim, Jai Hyun Park
Abstract:Cluster analysis is one of the most significant unsupervised machine learning tasks, and it is utilized in various fields associated with privacy issues including bioinformatics, finance and image processing. In this paper, we propose a practical solution for privacy-preserving cluster analysis based on homomorphic encryption~(HE). Our work is the first HE solution for the mean-shift clustering algorithm. To reduce the super-linear complexity of the original mean-shift algorithm, we adopt a novel random sampling method called dust sampling which perfectly fits in HE and achieves the linear complexity. We also substitute non-polynomial kernels by a new polynomial kernel so that it can be efficiently computed in HE. The HE implementation of our modified mean-shift clustering algorithm based on the approximate HE scheme HEAAN shows prominent performance in terms of speed and accuracy. It takes about 30 minutes with 99\% accuracy over several public datasets with hundreds of data, and even for the dataset with 262,144 data it takes only 82 minutes applying SIMD operations in HEAAN. Our results outperform the previously best known result (SAC 2018) over 400 times.
ePrint: https://eprint.iacr.org/2019/465
See all topics related to this paper.
Feel free to post resources that are related to this paper below.
Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.
For more information, see the rules for Resource Topics .