VADP:基于访问者属性的IoMT数据共享自适应差分隐私

IF 4.8 2区 计算机科学 Q1 COMPUTER SCIENCE, INFORMATION SYSTEMS
Shaobo Zhang , Lujie Zhang , Tao Peng , Qin Liu , Xiong Li
{"title":"VADP:基于访问者属性的IoMT数据共享自适应差分隐私","authors":"Shaobo Zhang ,&nbsp;Lujie Zhang ,&nbsp;Tao Peng ,&nbsp;Qin Liu ,&nbsp;Xiong Li","doi":"10.1016/j.cose.2025.104513","DOIUrl":null,"url":null,"abstract":"<div><div>The Internet of Medical Things (IoMT) improves medical services by collecting and sharing patient data, but it also increases the risk of sensitive privacy breaches. To mitigate the risks, existing methods based on personalized differential privacy add different noises to the query results of each data visitor. However, these methods require additional computation to assign a constant privacy budget for each visitor, leading to low sharing efficiency and data utility. To overcome these challenges, this paper proposes a visitor-attribute-based adaptive differential privacy (VADP) data-sharing scheme. The scheme first constructs a quantifiable hierarchical access structure to control visitors’ access to data attributes precisely, and adaptively determines the privacy level for each data attribute by quantifying the matching degree between the visitor attributes and the access structure. To enhance sharing efficiency, the scheme devises a lightweight privacy budget calculation matrix to compute privacy budgets efficiently, reducing computational overhead. Additionally, integrating the VIKOR method enables the scheme to balance data privacy and utility flexibly. Experiments show that regarding the data utility, the VADP scheme reduces the average query error by 39.4% compared with non-adaptive differential privacy methods. It also decreases computational overhead in the data-sharing phase by 40.3% compared to the state-of-the-art schemes.</div></div>","PeriodicalId":51004,"journal":{"name":"Computers & Security","volume":"156 ","pages":"Article 104513"},"PeriodicalIF":4.8000,"publicationDate":"2025-05-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"VADP: Visitor-attribute-based adaptive differential privacy for IoMT data sharing\",\"authors\":\"Shaobo Zhang ,&nbsp;Lujie Zhang ,&nbsp;Tao Peng ,&nbsp;Qin Liu ,&nbsp;Xiong Li\",\"doi\":\"10.1016/j.cose.2025.104513\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><div>The Internet of Medical Things (IoMT) improves medical services by collecting and sharing patient data, but it also increases the risk of sensitive privacy breaches. To mitigate the risks, existing methods based on personalized differential privacy add different noises to the query results of each data visitor. However, these methods require additional computation to assign a constant privacy budget for each visitor, leading to low sharing efficiency and data utility. To overcome these challenges, this paper proposes a visitor-attribute-based adaptive differential privacy (VADP) data-sharing scheme. The scheme first constructs a quantifiable hierarchical access structure to control visitors’ access to data attributes precisely, and adaptively determines the privacy level for each data attribute by quantifying the matching degree between the visitor attributes and the access structure. To enhance sharing efficiency, the scheme devises a lightweight privacy budget calculation matrix to compute privacy budgets efficiently, reducing computational overhead. Additionally, integrating the VIKOR method enables the scheme to balance data privacy and utility flexibly. Experiments show that regarding the data utility, the VADP scheme reduces the average query error by 39.4% compared with non-adaptive differential privacy methods. It also decreases computational overhead in the data-sharing phase by 40.3% compared to the state-of-the-art schemes.</div></div>\",\"PeriodicalId\":51004,\"journal\":{\"name\":\"Computers & Security\",\"volume\":\"156 \",\"pages\":\"Article 104513\"},\"PeriodicalIF\":4.8000,\"publicationDate\":\"2025-05-10\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Computers & Security\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S0167404825002020\",\"RegionNum\":2,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"COMPUTER SCIENCE, INFORMATION SYSTEMS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Computers & Security","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0167404825002020","RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, INFORMATION SYSTEMS","Score":null,"Total":0}
引用次数: 0

摘要

医疗物联网(IoMT)通过收集和共享患者数据来改善医疗服务,但它也增加了敏感隐私泄露的风险。为了降低风险,现有的基于个性化差分隐私的方法在每个数据访问者的查询结果中添加不同的噪声。然而,这些方法需要额外的计算来为每个访问者分配恒定的隐私预算,导致共享效率和数据效用较低。为了克服这些挑战,本文提出了一种基于访问者属性的自适应差分隐私(VADP)数据共享方案。该方案首先构建可量化的分层访问结构,精确控制访问者对数据属性的访问,并通过量化访问者属性与访问结构的匹配程度,自适应确定每个数据属性的隐私级别。为了提高共享效率,该方案设计了一个轻量级的隐私预算计算矩阵来高效地计算隐私预算,减少了计算开销。此外,集成VIKOR方法使该方案能够灵活地平衡数据隐私性和实用性。实验表明,在数据利用率方面,与非自适应差分隐私方法相比,VADP方案的平均查询误差降低了39.4%。与最先进的方案相比,它还将数据共享阶段的计算开销减少了40.3%。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
VADP: Visitor-attribute-based adaptive differential privacy for IoMT data sharing
The Internet of Medical Things (IoMT) improves medical services by collecting and sharing patient data, but it also increases the risk of sensitive privacy breaches. To mitigate the risks, existing methods based on personalized differential privacy add different noises to the query results of each data visitor. However, these methods require additional computation to assign a constant privacy budget for each visitor, leading to low sharing efficiency and data utility. To overcome these challenges, this paper proposes a visitor-attribute-based adaptive differential privacy (VADP) data-sharing scheme. The scheme first constructs a quantifiable hierarchical access structure to control visitors’ access to data attributes precisely, and adaptively determines the privacy level for each data attribute by quantifying the matching degree between the visitor attributes and the access structure. To enhance sharing efficiency, the scheme devises a lightweight privacy budget calculation matrix to compute privacy budgets efficiently, reducing computational overhead. Additionally, integrating the VIKOR method enables the scheme to balance data privacy and utility flexibly. Experiments show that regarding the data utility, the VADP scheme reduces the average query error by 39.4% compared with non-adaptive differential privacy methods. It also decreases computational overhead in the data-sharing phase by 40.3% compared to the state-of-the-art schemes.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
Computers & Security
Computers & Security 工程技术-计算机:信息系统
CiteScore
12.40
自引率
7.10%
发文量
365
审稿时长
10.7 months
期刊介绍: Computers & Security is the most respected technical journal in the IT security field. With its high-profile editorial board and informative regular features and columns, the journal is essential reading for IT security professionals around the world. Computers & Security provides you with a unique blend of leading edge research and sound practical management advice. It is aimed at the professional involved with computer security, audit, control and data integrity in all sectors - industry, commerce and academia. Recognized worldwide as THE primary source of reference for applied research and technical expertise it is your first step to fully secure systems.
×
引用
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学术官方微信