ESVSSE: Enabling Efficient, Secure, Verifiable Searchable Symmetric Encryption
Zhenkui Shi, Xuemei Fu, Xianxian Li, Kai Zhu
Abstract
Symmetric Searchable Encryption(SSE) is deemed to tackle the privacy issue as well as the operability and confidentiality in data outsourcing. However, most SSE schemes assume that the cloud is honest but curious. This assumption is not always applicable. In this paper, we propose an efficient SSE scheme based on B+-Tree and Counting Bloom Filter (CBF) which supports secure verification, dynamic updating, and multi-user queries. Comparing with the previous state of the arts, we design the new data structure CBF to support dynamic updating and boost verification. we evaluate our scheme through comprehensive experiments. The results are consistent with our analysis and show that our scheme is secure, and more efficient compared with the previous schemes with the same functionalities.The average performance can be improved by about 20% for both the cloud servers and users when the missing rate of the searching keywords is 20%. And the higher the missing rate is, the more the performance can be improved.