Suppr超能文献

基于秘密共享的安全三方计算实现高效隐私保护的均值聚类

Efficient Privacy-Preserving -Means Clustering from Secret-Sharing-Based Secure Three-Party Computation.

作者信息

Wei Weiming, Tang Chunming, Chen Yucheng

机构信息

School of Mathematics and Information Science, Guangzhou University, Guangzhou 510006, China.

School of Mathematics, Jiaying University, Meizhou 514015, China.

出版信息

Entropy (Basel). 2022 Aug 18;24(8):1145. doi: 10.3390/e24081145.

Abstract

Privacy-preserving machine learning has become an important study at present due to privacy policies. However, the efficiency gap between the plain-text algorithm and its privacy-preserving version still exists. In this paper, we focus on designing a novel secret-sharing-based -means clustering algorithm. Particularly, we present an efficient privacy-preserving -means clustering algorithm based on replicated secret sharing with honest-majority in the semi-honest model. More concretely, the clustering task is outsourced to three semi-honest computing servers. Theoretically, the proposed privacy-preserving scheme can be proven with full data privacy. Furthermore, the experimental results demonstrate that our proposed privacy version reaches the same accuracy as the plain-text one. Compared to the existing privacy-preserving scheme, our proposed protocol can achieve about 16.5×-25.2× faster computation and 63.8×-68.0× lower communication. Consequently, the proposed privacy-preserving scheme is suitable for secret-sharing-based secure outsourced computation.

摘要

由于隐私政策,隐私保护机器学习目前已成为一项重要研究。然而,明文算法与其隐私保护版本之间的效率差距仍然存在。在本文中,我们专注于设计一种新颖的基于秘密共享的K均值聚类算法。具体而言,我们提出了一种在半诚实模型中基于诚实多数的复制秘密共享的高效隐私保护K均值聚类算法。更具体地说,聚类任务外包给三个半诚实计算服务器。从理论上讲,所提出的隐私保护方案可以通过完全数据隐私得到证明。此外,实验结果表明,我们提出的隐私版本与明文版本达到相同的精度。与现有的隐私保护方案相比,我们提出的协议可以实现快约16.5×-25.2×的计算速度和低63.8×-68.0×的通信量。因此,所提出的隐私保护方案适用于基于秘密共享的安全外包计算。

https://cdn.ncbi.nlm.nih.gov/pmc/blobs/72e5/9407146/c709f7c4d1e7/entropy-24-01145-g001.jpg

文献AI研究员

20分钟写一篇综述,助力文献阅读效率提升50倍。

立即体验

用中文搜PubMed

大模型驱动的PubMed中文搜索引擎

马上搜索

文档翻译

学术文献翻译模型,支持多种主流文档格式。

立即体验