Privacy-preserving Protocol over Vertically Partitioned Data in Multiparty K-means Clustering
В Г Жуков, А В Вашкевич
Abstract
В Г Жуков, А В Вашкевич
Abstract
The article examines and analyzes existing solutions of privacy -preserving computations over vertical partitioning in multiparty clustering by k -means. The modifications of cryptographic primitives to eliminate detected deficiencies are offered. The results of comparative analysis of advanced cryptographic primitives are given. The protocol is developed that preserves data privacy with few parties considering their possible collusion. The conclusions on the effectiveness of the improved cryptographic primitives are made and the recommendations how to use the developed protocol are given.
OpenAlex reports 1 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.
The article examines and analyzes existing solutions of privacy -preserving computations over vertical partitioning in multiparty clustering by k -means. The modifications of cryptographic primitives to eliminate detected deficiencies are offered. The results of comparative analysis of advanced cryptographic primitives are given. The protocol is developed that preserves data privacy with few parties considering their possible collusion. The conclusions on the effectiveness of the improved cryptographic primitives are made and the recommendations how to use the developed protocol are given.
Key concepts: Collusion, Computer science, Cryptographic primitive, Protocol (science), Cryptographic protocol, Cryptography, Cluster analysis, Information privacy