.png){kind=icon}
.png){kind=icon}
Return
Practical collusion-resistant conjunctive dynamic searchable encryption with result pattern hiding
.png){kind=icon}
PRE
AI
DOI：10.1016/j.jisa.2025.104363.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
With the rapid development of cloud computing security, multi-user conjunctive dynamic searchable encryption is receiving more and more attention. However, existing schemes mainly rely on the XSet structure to implement conjunctive queries, which brings significant additional computational costs such as exponentiation, an extra round of communication. In addition, the leakage of keyword pair result pattern (KPRP) has been overlooked. In this work, a practical multi-user conjunction dynamic searchable encryption scheme (named MORF-MUDSE) is proposed, which can against a passive attack by a server colluding with any search user while ensuring the two basic attributes of both forward and backward security. Specifically, a mask-obfuscation random function protocol (named MORF) that includes document keyword set information is designed to implement a new subset validation method of conjunctive queries. This method only completes one round of communication to obtain results, which greatly improves computational efficiency while protecting KPRP. Moreover, a delayed update strategy is proposed, which address the issue of information synchronization between data owner and users during those updates. Through theoretical and experimental analysis, it has been shown that the proposed scheme in this paper has better efficiency in computation and communication compared to the state-of-the-art schemes.
Journal
IF:
3.7
Papers:
1.9K
Citations:
4.9K