返回
Multi-Client Boolean File Retrieval With Adaptable Authorization Switching for Secure Cloud Search Services
DOI:10.1109/TDSC.2022.3227650.png)
摘要
En 中文
Secure cloud search services provide a cost-effective way for resource-constrained clients to search encrypted files in the cloud, where data owners can customize search authorization. Despite providing fine-grained authorization, traditional attribute-based keyword search (ABKS) solutions generally support single keyword search. Towards expressive queries over encrypted data, multi client searchable symmetric encryption (MC-SSE) was introduced. However, current search authorizations of existing MC-SSEs: (i) cannot support dynamic updating; (ii) are (semi-)black-box implementations of attribute-based encryption; (iii) incur significant cost during system initialization and file encryption. To address these limitations, we present AasBirch, an MC-SSE system with fast finegrained authorization that supports adaptable authorization switching from one policy to any other one. AasBirch achieves constant size storage and lightweight time cost for system initialization, file encryption and file searching. We conduct extensive experiments based on Enron dataset in real cloud environment. Compared to state-of-the-art MC-SSE with fine-grained authorization, AasBirch achieves 30 similar to 200x smaller public parameter and secret key size, with the assumed least frequent keyword in a query (s-term) as 21. Moreover, it runs 10 similar to 20x faster for file encryption and > 20x faster for file searching. In addition, AasBirch outperforms 80,000x (resp. 7,850x) faster with s-term=1 (resp. =21), as compared to classic dynamic ABKS system.
Keyword:
Access control
boolean query
cloud storage
keyword search
searchable encryption
期刊
IF:
7.5
论文数:
2.6K
被引数:
9.6K
机构
引用论文
Non-Interactive Multi-Client Searchable Encryption: Realization and Implementation非交互式多客户端可搜索加密: 实现与实现

