Practical Multiuser Dynamic Searchable Symmetric Encryption With Collusion Resistance
- 3 July 2025
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Reliability
- Vol. 74 (4) , 5119-5132
Abstract
As data sharing becomes more prevalent, there is growing interest in multiuser dynamic searchable symmetric encryption (MU-DSSE). It enables multiple authorized users to search the encrypted database while safeguarding data privacy. However, most existing schemes are inefficient due to complex computation operations and unaffordable storage burdens. In addition, some are susceptible to collusion attacks between cloud server and compromised users, leading to the leakage of search privacy from other legitimate users. To overcome these challenges, we propose a practical MU-DSSE scheme featuring an unlinkable key derivation mechanism to thwart collusion attacks. Moreover, the MU-DSSE scheme ensures both forward and backward securities in the dynamic setting. To enhance efficiency, we introduce an innovative identity-based key encapsulation mechanism for distributing authorization information to multiple users, significantly optimizing computation and storage costs on user sides and the data owner. Furthermore, we provide the formal security proof and performance analyses. The experimental results demonstrate that MU-DSSE incurs the constant-size storage cost on user sides and the data owner, and outperforms the existing schemes in practice.Keywords
Funding Information
- National Key R&D Program of China (2021YFB2700200)
- National Natural Science Foundation of China (62172303, 62076187)
- Key R&D Program of Shandong Province (2022CXPT055)
- Key R&D Program of Hubei Province (2022BAA039, 2021BAA190)
This publication has 40 references indexed in Scilit:
- Bestie: Very Practical Searchable Encryption with Forward and Backward Security2021
- Building a dynamic searchable encrypted medical database for multi-clientInformation Sciences, 2020
- Symmetric Searchable Encryption with Sharing and Unsharing2018
- Multi-Key Searchable Encryption, Revisited2018
- Boolean Searchable Symmetric Encryption with Worst-Case Sub-linear Complexity2017
- An Efficient Non-interactive Multi-client Searchable Encryption with Support for Boolean Queries2016
- New chosen-ciphertext secure identity-based encryption with tight security reduction to the bilinear Diffie–Hellman problemInformation Sciences, 2015
- Parallel and Dynamic Searchable Symmetric Encryption2013
- Highly-Scalable Searchable Symmetric Encryption with Support for Boolean Queries2013
- Identity-Based Encryption from the Weil Pairing2001