SecMeanshift:基于fss的隐私保护mean-shift聚类

IF 6.8 1区 计算机科学 0 COMPUTER SCIENCE, INFORMATION SYSTEMS
Min Ma , Yu Fu , Fei Zheng , Zhihong Zhang , Taotao Liu , Kai Huang
{"title":"SecMeanshift:基于fss的隐私保护mean-shift聚类","authors":"Min Ma ,&nbsp;Yu Fu ,&nbsp;Fei Zheng ,&nbsp;Zhihong Zhang ,&nbsp;Taotao Liu ,&nbsp;Kai Huang","doi":"10.1016/j.ins.2025.122435","DOIUrl":null,"url":null,"abstract":"<div><div>Clustering is an unsupervised learning method that groups data based on similar characteristics. They have broad applications in various fields, such as image processing, text clustering, and recommendation systems. However, in practical scenarios, clustering often involves sensitive data from multiple data owners, which raises significant privacy concerns. Therefore, addressing the challenge of performing efficient clustering while preserving data privacy is critical. Existing privacy-preserving clustering methods often encounter challenges such as high computational overhead or reliance on auxiliary information. Consequently, we propose SecMeanshift, a privacy-preserving mean-shift framework based on function secret sharing. SecMeanshift leverages an offline–online paradigm to enhance efficiency by offloading some operations to the offline phase. We design basic protocols, including secure negative exponential, secure select, and secure sampling for the proposed framework, and design private protocols for each phase of the mean-shift. Theoretical analysis confirms the security and correctness of the proposed protocols. Furthermore, extensive experiments on diverse datasets demonstrate that SecMeanshift achieves significantly higher efficiency than HE-Meanshift, making it a promising solution for privacy-preserving clustering.</div></div>","PeriodicalId":51063,"journal":{"name":"Information Sciences","volume":"719 ","pages":"Article 122435"},"PeriodicalIF":6.8000,"publicationDate":"2025-06-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"SecMeanshift: FSS-based privacy-preserving mean-shift clustering\",\"authors\":\"Min Ma ,&nbsp;Yu Fu ,&nbsp;Fei Zheng ,&nbsp;Zhihong Zhang ,&nbsp;Taotao Liu ,&nbsp;Kai Huang\",\"doi\":\"10.1016/j.ins.2025.122435\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><div>Clustering is an unsupervised learning method that groups data based on similar characteristics. They have broad applications in various fields, such as image processing, text clustering, and recommendation systems. However, in practical scenarios, clustering often involves sensitive data from multiple data owners, which raises significant privacy concerns. Therefore, addressing the challenge of performing efficient clustering while preserving data privacy is critical. Existing privacy-preserving clustering methods often encounter challenges such as high computational overhead or reliance on auxiliary information. Consequently, we propose SecMeanshift, a privacy-preserving mean-shift framework based on function secret sharing. SecMeanshift leverages an offline–online paradigm to enhance efficiency by offloading some operations to the offline phase. We design basic protocols, including secure negative exponential, secure select, and secure sampling for the proposed framework, and design private protocols for each phase of the mean-shift. Theoretical analysis confirms the security and correctness of the proposed protocols. Furthermore, extensive experiments on diverse datasets demonstrate that SecMeanshift achieves significantly higher efficiency than HE-Meanshift, making it a promising solution for privacy-preserving clustering.</div></div>\",\"PeriodicalId\":51063,\"journal\":{\"name\":\"Information Sciences\",\"volume\":\"719 \",\"pages\":\"Article 122435\"},\"PeriodicalIF\":6.8000,\"publicationDate\":\"2025-06-17\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Information Sciences\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S0020025525005675\",\"RegionNum\":1,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"0\",\"JCRName\":\"COMPUTER SCIENCE, INFORMATION SYSTEMS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Information Sciences","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0020025525005675","RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"0","JCRName":"COMPUTER SCIENCE, INFORMATION SYSTEMS","Score":null,"Total":0}
引用次数: 0

摘要

聚类是一种基于相似特征对数据进行分组的无监督学习方法。它们在图像处理、文本聚类和推荐系统等各个领域都有广泛的应用。然而,在实际场景中,集群通常涉及来自多个数据所有者的敏感数据,这引起了严重的隐私问题。因此,在保护数据隐私的同时解决执行高效集群的挑战是至关重要的。现有的保护隐私的聚类方法经常遇到诸如高计算开销或依赖辅助信息等挑战。因此,我们提出了一种基于函数秘密共享的隐私保护均值转移框架SecMeanshift。SecMeanshift利用离线-在线模式,通过将一些操作卸载到离线阶段来提高效率。我们为所提出的框架设计了基本协议,包括安全负指数、安全选择和安全抽样,并为均值移位的每个阶段设计了私有协议。理论分析证实了所提出协议的安全性和正确性。此外,在不同数据集上的大量实验表明,SecMeanshift的效率明显高于HE-Meanshift,使其成为一种有前途的隐私保护聚类解决方案。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
SecMeanshift: FSS-based privacy-preserving mean-shift clustering
Clustering is an unsupervised learning method that groups data based on similar characteristics. They have broad applications in various fields, such as image processing, text clustering, and recommendation systems. However, in practical scenarios, clustering often involves sensitive data from multiple data owners, which raises significant privacy concerns. Therefore, addressing the challenge of performing efficient clustering while preserving data privacy is critical. Existing privacy-preserving clustering methods often encounter challenges such as high computational overhead or reliance on auxiliary information. Consequently, we propose SecMeanshift, a privacy-preserving mean-shift framework based on function secret sharing. SecMeanshift leverages an offline–online paradigm to enhance efficiency by offloading some operations to the offline phase. We design basic protocols, including secure negative exponential, secure select, and secure sampling for the proposed framework, and design private protocols for each phase of the mean-shift. Theoretical analysis confirms the security and correctness of the proposed protocols. Furthermore, extensive experiments on diverse datasets demonstrate that SecMeanshift achieves significantly higher efficiency than HE-Meanshift, making it a promising solution for privacy-preserving clustering.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
Information Sciences
Information Sciences 工程技术-计算机:信息系统
CiteScore
14.00
自引率
17.30%
发文量
1322
审稿时长
10.4 months
期刊介绍: Informatics and Computer Science Intelligent Systems Applications is an esteemed international journal that focuses on publishing original and creative research findings in the field of information sciences. We also feature a limited number of timely tutorial and surveying contributions. Our journal aims to cater to a diverse audience, including researchers, developers, managers, strategic planners, graduate students, and anyone interested in staying up-to-date with cutting-edge research in information science, knowledge engineering, and intelligent systems. While readers are expected to share a common interest in information science, they come from varying backgrounds such as engineering, mathematics, statistics, physics, computer science, cell biology, molecular biology, management science, cognitive science, neurobiology, behavioral sciences, and biochemistry.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信