具有动态和可撤销的基于属性的策略的双索引布尔检索方案

IF 3.7 2区 计算机科学 Q1 COMPUTER SCIENCE, HARDWARE & ARCHITECTURE
Jingting Xue , Qinfang Deng , Wenzheng Zhang , Kangyi Liu , Xiaojun Zhang , Yu Zhou
{"title":"具有动态和可撤销的基于属性的策略的双索引布尔检索方案","authors":"Jingting Xue ,&nbsp;Qinfang Deng ,&nbsp;Wenzheng Zhang ,&nbsp;Kangyi Liu ,&nbsp;Xiaojun Zhang ,&nbsp;Yu Zhou","doi":"10.1016/j.sysarc.2025.103366","DOIUrl":null,"url":null,"abstract":"<div><div>Boolean retrieval is widely employed in information retrieval due to its versatile operator combinations. In the context of secure cloud data sharing, data owners can tailor retrieval authorizations, offering remote nodes a convenient way to access data. Nevertheless, traditional retrieval models depend on online interactions for authorization, and fixed policies restrict control over retrieval. Constrained by index structures, existing Boolean retrieval methods encounter performance bottlenecks in terms of retrieval speed and storage efficiency. In this paper, we propose a dual-index Boolean retrieval scheme, <span><math><mrow><mi>d</mi><mi>i</mi><mi>b</mi><mi>R</mi><mi>S</mi></mrow></math></span>, that incorporates dynamic and revocable attribute-based policies. Specifically, leveraging attribute-based zero-knowledge proofs (AB-ZKP), we construct the authorization verification structure using Lagrange interpolation polynomials. By constructing a dual-index structure that integrates both inverted and forward indexes, <span><math><mrow><mi>d</mi><mi>i</mi><mi>b</mi><mi>R</mi><mi>S</mi></mrow></math></span> facilitates efficient Boolean retrieval. A puncturable pseudorandom function constructs the forward index, enabling selective revocation of search trapdoors through puncturing, without requiring full index regeneration. Additionally, by utilizing chameleon hash collisions, <span><math><mrow><mi>d</mi><mi>i</mi><mi>b</mi><mi>R</mi><mi>S</mi></mrow></math></span> allows customizable index modifications and dynamic policy updates on redactable blockchains. Throughout this process, <span><math><mrow><mi>d</mi><mi>i</mi><mi>b</mi><mi>R</mi><mi>S</mi></mrow></math></span> enables non-interactive authorization, significantly alleviating the communication burden on data owners. Finally, we demonstrate the adaptive security and computational feasibility of <span><math><mrow><mi>d</mi><mi>i</mi><mi>b</mi><mi>R</mi><mi>S</mi></mrow></math></span>.</div></div>","PeriodicalId":50027,"journal":{"name":"Journal of Systems Architecture","volume":"161 ","pages":"Article 103366"},"PeriodicalIF":3.7000,"publicationDate":"2025-02-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"A dual-index Boolean retrieval scheme with dynamic and revocable attribute-based policies\",\"authors\":\"Jingting Xue ,&nbsp;Qinfang Deng ,&nbsp;Wenzheng Zhang ,&nbsp;Kangyi Liu ,&nbsp;Xiaojun Zhang ,&nbsp;Yu Zhou\",\"doi\":\"10.1016/j.sysarc.2025.103366\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><div>Boolean retrieval is widely employed in information retrieval due to its versatile operator combinations. In the context of secure cloud data sharing, data owners can tailor retrieval authorizations, offering remote nodes a convenient way to access data. Nevertheless, traditional retrieval models depend on online interactions for authorization, and fixed policies restrict control over retrieval. Constrained by index structures, existing Boolean retrieval methods encounter performance bottlenecks in terms of retrieval speed and storage efficiency. In this paper, we propose a dual-index Boolean retrieval scheme, <span><math><mrow><mi>d</mi><mi>i</mi><mi>b</mi><mi>R</mi><mi>S</mi></mrow></math></span>, that incorporates dynamic and revocable attribute-based policies. Specifically, leveraging attribute-based zero-knowledge proofs (AB-ZKP), we construct the authorization verification structure using Lagrange interpolation polynomials. By constructing a dual-index structure that integrates both inverted and forward indexes, <span><math><mrow><mi>d</mi><mi>i</mi><mi>b</mi><mi>R</mi><mi>S</mi></mrow></math></span> facilitates efficient Boolean retrieval. A puncturable pseudorandom function constructs the forward index, enabling selective revocation of search trapdoors through puncturing, without requiring full index regeneration. Additionally, by utilizing chameleon hash collisions, <span><math><mrow><mi>d</mi><mi>i</mi><mi>b</mi><mi>R</mi><mi>S</mi></mrow></math></span> allows customizable index modifications and dynamic policy updates on redactable blockchains. Throughout this process, <span><math><mrow><mi>d</mi><mi>i</mi><mi>b</mi><mi>R</mi><mi>S</mi></mrow></math></span> enables non-interactive authorization, significantly alleviating the communication burden on data owners. Finally, we demonstrate the adaptive security and computational feasibility of <span><math><mrow><mi>d</mi><mi>i</mi><mi>b</mi><mi>R</mi><mi>S</mi></mrow></math></span>.</div></div>\",\"PeriodicalId\":50027,\"journal\":{\"name\":\"Journal of Systems Architecture\",\"volume\":\"161 \",\"pages\":\"Article 103366\"},\"PeriodicalIF\":3.7000,\"publicationDate\":\"2025-02-15\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Journal of Systems Architecture\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S1383762125000384\",\"RegionNum\":2,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"COMPUTER SCIENCE, HARDWARE & ARCHITECTURE\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Systems Architecture","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S1383762125000384","RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, HARDWARE & ARCHITECTURE","Score":null,"Total":0}
引用次数: 0

摘要

布尔检索由于其运算符组合的通用性而被广泛应用于信息检索中。在安全云数据共享的上下文中,数据所有者可以定制检索授权,为远程节点提供访问数据的便捷方式。然而,传统的检索模型依赖于在线交互进行授权,并且固定的策略限制了对检索的控制。由于索引结构的限制,现有的布尔检索方法在检索速度和存储效率方面存在性能瓶颈。在本文中,我们提出了一种双索引布尔检索方案,dibRS,它结合了动态和可撤销的基于属性的策略。具体而言,利用基于属性的零知识证明(AB-ZKP),我们使用拉格朗日插值多项式构造了授权验证结构。通过构建一个集成倒排索引和正向索引的双索引结构,dibRS促进了高效的布尔检索。一个可穿刺的伪随机函数构建正向索引,通过穿刺有选择地撤销搜索陷阱门,而不需要完整的索引再生。此外,通过利用变色龙哈希碰撞,dibRS允许在可读区块链上进行可定制的索引修改和动态策略更新。在整个过程中,dibRS支持非交互式授权,大大减轻了数据所有者的通信负担。最后,我们验证了dibRS的自适应安全性和计算可行性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
A dual-index Boolean retrieval scheme with dynamic and revocable attribute-based policies
Boolean retrieval is widely employed in information retrieval due to its versatile operator combinations. In the context of secure cloud data sharing, data owners can tailor retrieval authorizations, offering remote nodes a convenient way to access data. Nevertheless, traditional retrieval models depend on online interactions for authorization, and fixed policies restrict control over retrieval. Constrained by index structures, existing Boolean retrieval methods encounter performance bottlenecks in terms of retrieval speed and storage efficiency. In this paper, we propose a dual-index Boolean retrieval scheme, dibRS, that incorporates dynamic and revocable attribute-based policies. Specifically, leveraging attribute-based zero-knowledge proofs (AB-ZKP), we construct the authorization verification structure using Lagrange interpolation polynomials. By constructing a dual-index structure that integrates both inverted and forward indexes, dibRS facilitates efficient Boolean retrieval. A puncturable pseudorandom function constructs the forward index, enabling selective revocation of search trapdoors through puncturing, without requiring full index regeneration. Additionally, by utilizing chameleon hash collisions, dibRS allows customizable index modifications and dynamic policy updates on redactable blockchains. Throughout this process, dibRS enables non-interactive authorization, significantly alleviating the communication burden on data owners. Finally, we demonstrate the adaptive security and computational feasibility of dibRS.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
Journal of Systems Architecture
Journal of Systems Architecture 工程技术-计算机:硬件
CiteScore
8.70
自引率
15.60%
发文量
226
审稿时长
46 days
期刊介绍: The Journal of Systems Architecture: Embedded Software Design (JSA) is a journal covering all design and architectural aspects related to embedded systems and software. It ranges from the microarchitecture level via the system software level up to the application-specific architecture level. Aspects such as real-time systems, operating systems, FPGA programming, programming languages, communications (limited to analysis and the software stack), mobile systems, parallel and distributed architectures as well as additional subjects in the computer and system architecture area will fall within the scope of this journal. Technology will not be a main focus, but its use and relevance to particular designs will be. Case studies are welcome but must contribute more than just a design for a particular piece of software. Design automation of such systems including methodologies, techniques and tools for their design as well as novel designs of software components fall within the scope of this journal. Novel applications that use embedded systems are also central in this journal. While hardware is not a part of this journal hardware/software co-design methods that consider interplay between software and hardware components with and emphasis on software are also relevant here.
×
引用
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学术官方微信