Answers are grounded in this paper and cite their sources.
Attribute-based searchable encryption (ABSE) enables fine-grained access control over encrypted data search, widely being deployed in various scenarios. However, existing ABSE schemes usually suffer from attribute privacy leakage, as the attribute sets and access control policies in ciphertexts and trapdoors are typically exposed in an unencrypted form. Moreover, most ABSE schemes support only access control policies constructed with AND gates, which significantly restricts the flexibility of the policies. Two primary challenges arise in the design of ABSE protocols. The first challenge is to design an access control scheme that supports both AND and OR gates while concealing attribute information in ciphertexts and trapdoors; the second challenge is to develop a lightweight ABSE framework that improves algorithmic efficiency without compromising security. To address these challenges, in this paper, we propose an anonymous attribute-based searchable encryption (A 2 BSE) scheme with flexible access control policies. Furthermore, the proposed protocol is highly efficient in the sense that the search algorithm of the proposed scheme requires only 5 bilinear pairings. We prove its adaptive security under the DLIN assumption and conduct experimental evaluations which confirm that our scheme achieves faster search and matching operations compared to existing approaches.
No takes yet. Share an insight, caveat, or question.
Lv et al. (2025) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: