Privacy-Preserving Two-Party k-Means Clustering in Malicious Model
Rahena Akhter, Rownak Jahan Chowdhury, Keita Emura, Tamzida Islam, Mohammad Shahriar Rahman, Nusrat Rubaiyat
Abstract
Rahena Akhter, Rownak Jahan Chowdhury, Keita Emura, Tamzida Islam, Mohammad Shahriar Rahman, Nusrat Rubaiyat
Abstract
In data mining, clustering is a well-known and useful technique. One of the most powerful and frequently used techniques is k-means clustering. Most of the privacy-preserving solutions based on cryptography proposed by different researchers in recent years are in semi-honest model, where participating parties always follow the protocol. This model is realistic in many cases. But providing stonger solutions considering malicious model would be more useful for many practical applications because it tries to protect a protocol from arbitrary malicious behavior using cryptographic tools. In this paper, we have proposed a new protocol for privacy-preserving two-party k-means clustering in malicious model. We have used threshold homomorphic encryption and non-interactive zero knowledge protocols to construct our protocol according to real/ideal world paradigm.
OpenAlex reports 8 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
In data mining, clustering is a well-known and useful technique. One of the most powerful and frequently used techniques is k-means clustering. Most of the privacy-preserving solutions based on cryptography proposed by different researchers in recent years are in semi-honest model, where participating parties always follow the protocol. This model is realistic in many cases. But providing stonger solutions considering malicious model would be more useful for many practical applications because it tries to protect a protocol from arbitrary malicious behavior using cryptographic tools. In this paper, we have proposed a new protocol for privacy-preserving two-party k-means clustering in malicious model. We have used threshold homomorphic encryption and non-interactive zero knowledge protocols to construct our protocol according to real/ideal world paradigm.
Key concepts: Homomorphic encryption, Computer science, Cluster analysis, Protocol (science), Cryptography, Encryption, Zero-knowledge proof, Construct (python library)