Abstract In this paper, a searchable encryption scheme for cloud data is proposed to address the limitations of existing schemes, which suffer from inefficient index construction and search process, as well as a lack of support for dynamic updates or the complexity and inefficiency of update operations. Firstly, the efficiency and flexibility of index construction are improved by designing a reverse index based on B+ trees, coupled with Bloom filters. Vector matching ideas are employed to enhance the efficiency of searching encrypted cloud data. Secondly, leveraging the bitmap index, a combination design of forward and reverse indices is utilized to improve update efficiency, concealing update types to protect access patterns. Finally, the security analysis and comparative experimental results collectively demonstrate the feasibility, efficiency, and security of the proposed scheme, verifying its potential in practical applications.
Zhang et al. (Wed,) studied this question.