Answers are grounded in this paper and cite their sources.
With the rapid advancement of 5G networks and cloud computing technologies, multi-source data integration and sharing have become key approaches to releasing the value of data. However, traditional data management paradigms are difficult to handle the growing security and privacy concerns associated with such integration and sharing. Dynamic searchable encryption, as a novel cryptographic primitive, enables efficient search operations over encrypted data while supporting dynamic updates such as data insertion and deletion. To address the security requirements in a multi-source data environment, this paper proposes a dynamic searchable encryption scheme that supports multiple data owners and a single data user. The proposed scheme allows multiple data owners to independently perform batch updates to an encrypted database while ensuring epoch-based forward security and Type-II backward security. To design the proposed scheme, advanced cryptographic tools such as set-constrained pseudo-random functions and key-homomorphic pseudo-random functions are employed to reduce communication and storage overhead during authorized queries by the data user. Additionally, a novel chained index structure and a batch update algorithm are introduced to enable parallelized search, significantly improving retrieval efficiency. Finally, comprehensive evaluations including theoretical analysis and experimental testing are conducted to show the scheme's security, correctness, and performance. The results demonstrate that the proposed scheme exhibits strong potential for practical deployment in multi-source data sharing scenarios.
No takes yet. Share an insight, caveat, or question.
LI et al. (2026) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: