Abstract Modern data science requires large amounts of data and computational power to perform effectively. However, there is a lot of sensitive data that should not be shared with others. To still do data science, methods like Homomorphic Encryption exist that enable calculations on encrypted data. One well-known data science algorithm is K-Means, which clusters data points into a previously fixed number of clusters. We provided a homomorphic implementation by demonstrating how comparisons and assignments of clusters can be calculated. Furthermore, the algorithm is evaluated in an offline approach with bootstrapping and an online approach with client re-encryption. Both achieve an accuracy of 100%, but take significantly longer, ranging from 50,000 to 16 million times compared to the non-encrypted case.
Prantl et al. (Wed,) studied this question.