Enabling Collusion-Resistant Hierarchical Attribute-Based Multi-Keyword Search for Personal Health Records Systems in Cloud

IF 5.3 2区 计算机科学 Q1 COMPUTER SCIENCE, INFORMATION SYSTEMS
IEEE Transactions on Cloud Computing Pub Date : 2026-07-01 Epub Date: 2026-07-02 DOI:10.1109/TCC.2026.3709757
Qianqian Su;Rui Zhang
{"title":"Enabling Collusion-Resistant Hierarchical Attribute-Based Multi-Keyword Search for Personal Health Records Systems in Cloud","authors":"Qianqian Su;Rui Zhang","doi":"10.1109/TCC.2026.3709757","DOIUrl":null,"url":null,"abstract":"The proliferation of cloud-based healthcare services has created a growing demand for secure and fine-grained sharing of Personal Health Records (PHRs). To support layered access control, Hierarchical Attribute-Based Keyword Search (HABKS) schemes have been developed. However, existing designs suffer from inherent collusion vulnerabilities that is users with access to different subtrees can jointly recover higher-level secrets, breaking access boundaries. To address this problem, we propose a collusion-resistant hierarchical multi-keyword searchable encryption scheme for privacy-preserving PHR sharing. Different from the previous HABKS, our scheme effectively prevents the propagation dependence of data encryption keys at nodes and user collusion attacks. This benefits from the root node key decoupling mechanism we designed, which enables each policy subtree to generate keys with embedded randomness. Additionally, we design an identity-bound trapdoor and a dual verification mechanism that tightly bind user attributes and keyword tokens, ensuring verifiable and fine-grained access control. Our scheme supports expressive multi-keyword queries with constant-size trapdoors, and offloads most pairing operations to the cloud, requiring only one pairing locally. Security proofs and experimental results confirm that our scheme achieves strong collusion resistance, efficient keyword retrieval, and practical suitability for secure hierarchical PHR systems.","PeriodicalId":13202,"journal":{"name":"IEEE Transactions on Cloud Computing","volume":"14 3","pages":"1772-1784"},"PeriodicalIF":5.3000,"publicationDate":"2026-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE Transactions on Cloud Computing","FirstCategoryId":"94","ListUrlMain":"https://ieeexplore.ieee.org/document/11594014/","RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"2026/7/2 0:00:00","PubModel":"Epub","JCR":"Q1","JCRName":"COMPUTER SCIENCE, INFORMATION SYSTEMS","Score":null,"Total":0}
引用次数: 0

Abstract

The proliferation of cloud-based healthcare services has created a growing demand for secure and fine-grained sharing of Personal Health Records (PHRs). To support layered access control, Hierarchical Attribute-Based Keyword Search (HABKS) schemes have been developed. However, existing designs suffer from inherent collusion vulnerabilities that is users with access to different subtrees can jointly recover higher-level secrets, breaking access boundaries. To address this problem, we propose a collusion-resistant hierarchical multi-keyword searchable encryption scheme for privacy-preserving PHR sharing. Different from the previous HABKS, our scheme effectively prevents the propagation dependence of data encryption keys at nodes and user collusion attacks. This benefits from the root node key decoupling mechanism we designed, which enables each policy subtree to generate keys with embedded randomness. Additionally, we design an identity-bound trapdoor and a dual verification mechanism that tightly bind user attributes and keyword tokens, ensuring verifiable and fine-grained access control. Our scheme supports expressive multi-keyword queries with constant-size trapdoors, and offloads most pairing operations to the cloud, requiring only one pairing locally. Security proofs and experimental results confirm that our scheme achieves strong collusion resistance, efficient keyword retrieval, and practical suitability for secure hierarchical PHR systems.
云个人健康记录系统中基于分层属性的抗合谋多关键字搜索实现
基于云的医疗保健服务的激增导致对个人健康记录(phr)的安全和细粒度共享的需求不断增长。为了支持分层访问控制,人们开发了基于分层属性的关键字搜索(HABKS)方案。然而,现有设计存在固有的共谋漏洞,即访问不同子树的用户可以联合恢复更高级别的秘密,从而打破访问边界。为了解决这个问题,我们提出了一种防合谋的分层多关键字可搜索加密方案,用于保护隐私的PHR共享。与以往的HABKS不同,我们的方案有效地防止了数据加密密钥在节点上的传播依赖和用户合谋攻击。这得益于我们设计的根节点密钥解耦机制,该机制允许每个策略子树生成具有嵌入随机性的密钥。此外,我们设计了一个身份绑定的活板门和双重验证机制,紧密绑定用户属性和关键字令牌,确保可验证和细粒度的访问控制。我们的方案支持具有恒定大小的活板门的表达性多关键字查询,并将大多数配对操作卸载到云端,只需要在本地进行一次配对。安全性证明和实验结果表明,该方案具有较强的抗合谋性,关键字检索效率高,适合于安全分层PHR系统。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
IEEE Transactions on Cloud Computing
IEEE Transactions on Cloud Computing Computer Science-Software
CiteScore
9.40
自引率
6.20%
发文量
167
期刊介绍: The IEEE Transactions on Cloud Computing (TCC) is dedicated to the multidisciplinary field of cloud computing. It is committed to the publication of articles that present innovative research ideas, application results, and case studies in cloud computing, focusing on key technical issues related to theory, algorithms, systems, applications, and performance.
×
引用
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学术官方微信
小红书