具有参与者退出弹性的智能医疗保健健壮的隐私保护KNN

IF 3.7 2区 计算机科学 Q2 COMPUTER SCIENCE, INFORMATION SYSTEMS
Xin Chen , Debiao He , Qi Feng , Xiaolin Yang , Qingcai Luo
{"title":"具有参与者退出弹性的智能医疗保健健壮的隐私保护KNN","authors":"Xin Chen ,&nbsp;Debiao He ,&nbsp;Qi Feng ,&nbsp;Xiaolin Yang ,&nbsp;Qingcai Luo","doi":"10.1016/j.jisa.2025.104225","DOIUrl":null,"url":null,"abstract":"<div><div>The <span><math><mi>k</mi></math></span>-nearest neighbor (KNN) algorithm, as a simple and effective machine learning method, has been widely used in smart healthcare for disease diagnosis and drug recommendation. However, with the continuous generation and use of personal health data, KNN algorithms face data privacy challenges in smart healthcare systems. To address these challenges, numerous privacy-preserving KNN schemes have been put forward, mostly using secure multi-party computation (SMPC) or differential privacy techniques. Nevertheless, these approaches often concentrate on two-party models and lead to substantial computational overhead or compromise the accuracy of model training/prediction. In this article, we present a three-party privacy-preserving KNN scheme with a privileged party. We employ vector space secret sharing (VSSS) and additive secret sharing to devise a suite of lightweight sub-protocols for implementing the crucial operations in KNN: distance evaluation and ascending sorting. Additionally, the scheme ensures robustness by leveraging the access control structure of VSSS. Concretely, this solution allows two auxiliary parties to collude, and the model prediction task remains achievable even if one of the auxiliary parties becomes unavailable. We also analyze the communication and computational overhead of proposed algorithms. Furthermore, we conduct extensive experiments to evaluate the performance of our scheme on common benchmark datasets Breast Cancer Wisconsin (Diagnostic) and MNIST. The results demonstrate our scheme’s performance outperforms most of the compared schemes.</div></div>","PeriodicalId":48638,"journal":{"name":"Journal of Information Security and Applications","volume":"94 ","pages":"Article 104225"},"PeriodicalIF":3.7000,"publicationDate":"2025-09-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Robust privacy-preserving KNN for smart healthcare with participant dropout resilience\",\"authors\":\"Xin Chen ,&nbsp;Debiao He ,&nbsp;Qi Feng ,&nbsp;Xiaolin Yang ,&nbsp;Qingcai Luo\",\"doi\":\"10.1016/j.jisa.2025.104225\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><div>The <span><math><mi>k</mi></math></span>-nearest neighbor (KNN) algorithm, as a simple and effective machine learning method, has been widely used in smart healthcare for disease diagnosis and drug recommendation. However, with the continuous generation and use of personal health data, KNN algorithms face data privacy challenges in smart healthcare systems. To address these challenges, numerous privacy-preserving KNN schemes have been put forward, mostly using secure multi-party computation (SMPC) or differential privacy techniques. Nevertheless, these approaches often concentrate on two-party models and lead to substantial computational overhead or compromise the accuracy of model training/prediction. In this article, we present a three-party privacy-preserving KNN scheme with a privileged party. We employ vector space secret sharing (VSSS) and additive secret sharing to devise a suite of lightweight sub-protocols for implementing the crucial operations in KNN: distance evaluation and ascending sorting. Additionally, the scheme ensures robustness by leveraging the access control structure of VSSS. Concretely, this solution allows two auxiliary parties to collude, and the model prediction task remains achievable even if one of the auxiliary parties becomes unavailable. We also analyze the communication and computational overhead of proposed algorithms. Furthermore, we conduct extensive experiments to evaluate the performance of our scheme on common benchmark datasets Breast Cancer Wisconsin (Diagnostic) and MNIST. The results demonstrate our scheme’s performance outperforms most of the compared schemes.</div></div>\",\"PeriodicalId\":48638,\"journal\":{\"name\":\"Journal of Information Security and Applications\",\"volume\":\"94 \",\"pages\":\"Article 104225\"},\"PeriodicalIF\":3.7000,\"publicationDate\":\"2025-09-24\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Journal of Information Security and Applications\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S2214212625002625\",\"RegionNum\":2,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q2\",\"JCRName\":\"COMPUTER SCIENCE, INFORMATION SYSTEMS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Information Security and Applications","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S2214212625002625","RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"COMPUTER SCIENCE, INFORMATION SYSTEMS","Score":null,"Total":0}
引用次数: 0

摘要

KNN算法作为一种简单有效的机器学习方法,在智能医疗中广泛应用于疾病诊断和药物推荐。然而,随着个人健康数据的不断生成和使用,KNN算法在智能医疗系统中面临数据隐私挑战。为了解决这些问题,人们提出了许多保护隐私的KNN方案,主要使用安全多方计算(SMPC)或差分隐私技术。然而,这些方法通常集中在两方模型上,导致大量的计算开销或损害模型训练/预测的准确性。在本文中,我们提出了一个具有特权方的三方隐私保护的KNN方案。我们采用向量空间秘密共享(VSSS)和加性秘密共享设计了一套轻量级的子协议来实现KNN中的关键操作:距离求值和升序排序。此外,该方案通过利用VSSS的访问控制结构来保证鲁棒性。具体地说,该解决方案允许两个辅助方串通,并且即使其中一个辅助方不可用,模型预测任务仍然可以实现。我们还分析了所提出算法的通信和计算开销。此外,我们进行了大量的实验来评估我们的方案在常见基准数据集Breast Cancer Wisconsin (Diagnostic)和MNIST上的性能。结果表明,该方案的性能优于大多数比较方案。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Robust privacy-preserving KNN for smart healthcare with participant dropout resilience
The k-nearest neighbor (KNN) algorithm, as a simple and effective machine learning method, has been widely used in smart healthcare for disease diagnosis and drug recommendation. However, with the continuous generation and use of personal health data, KNN algorithms face data privacy challenges in smart healthcare systems. To address these challenges, numerous privacy-preserving KNN schemes have been put forward, mostly using secure multi-party computation (SMPC) or differential privacy techniques. Nevertheless, these approaches often concentrate on two-party models and lead to substantial computational overhead or compromise the accuracy of model training/prediction. In this article, we present a three-party privacy-preserving KNN scheme with a privileged party. We employ vector space secret sharing (VSSS) and additive secret sharing to devise a suite of lightweight sub-protocols for implementing the crucial operations in KNN: distance evaluation and ascending sorting. Additionally, the scheme ensures robustness by leveraging the access control structure of VSSS. Concretely, this solution allows two auxiliary parties to collude, and the model prediction task remains achievable even if one of the auxiliary parties becomes unavailable. We also analyze the communication and computational overhead of proposed algorithms. Furthermore, we conduct extensive experiments to evaluate the performance of our scheme on common benchmark datasets Breast Cancer Wisconsin (Diagnostic) and MNIST. The results demonstrate our scheme’s performance outperforms most of the compared schemes.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
Journal of Information Security and Applications
Journal of Information Security and Applications Computer Science-Computer Networks and Communications
CiteScore
10.90
自引率
5.40%
发文量
206
审稿时长
56 days
期刊介绍: Journal of Information Security and Applications (JISA) focuses on the original research and practice-driven applications with relevance to information security and applications. JISA provides a common linkage between a vibrant scientific and research community and industry professionals by offering a clear view on modern problems and challenges in information security, as well as identifying promising scientific and "best-practice" solutions. JISA issues offer a balance between original research work and innovative industrial approaches by internationally renowned information security experts and researchers.
×
引用
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学术官方微信