Min Ma , Yu Fu , Fei Zheng , Zhihong Zhang , Taotao Liu , Kai Huang
{"title":"SecMeanshift:基于fss的隐私保护mean-shift聚类","authors":"Min Ma , Yu Fu , Fei Zheng , Zhihong Zhang , Taotao Liu , 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 , Yu Fu , Fei Zheng , Zhihong Zhang , Taotao Liu , 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}
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.
期刊介绍:
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.