Jingting Xue , Qinfang Deng , Wenzheng Zhang , Kangyi Liu , Xiaojun Zhang , Yu Zhou
{"title":"具有动态和可撤销的基于属性的策略的双索引布尔检索方案","authors":"Jingting Xue , Qinfang Deng , Wenzheng Zhang , Kangyi Liu , Xiaojun Zhang , 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 , Qinfang Deng , Wenzheng Zhang , Kangyi Liu , Xiaojun Zhang , 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}
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, , 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, 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, allows customizable index modifications and dynamic policy updates on redactable blockchains. Throughout this process, enables non-interactive authorization, significantly alleviating the communication burden on data owners. Finally, we demonstrate the adaptive security and computational feasibility of .
期刊介绍:
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.