DESSE: A Dynamic Efficient Forward Searchable Encryption Scheme

Under the cloud computing environment, Searchable Symmetric Encryption (SSE) is an effective method to solve the problem of encrypted data retrieval, and helps to protect the users' privacy. Recent researches show that some attacks may bring great security threats to SSE, and forward privacy can effectively prevent these attacks, so forward privacy is very necessary for SSE scheme. Most of the existing forward privacy SSE schemes fall into two types: ORAM-based and Bost-based. The former is simple, but it has large communication overhead and low dynamic update efficiency. The latter is better than the former, but it is based on asymmetric encryption primitives. Based on symmetric encryption primitives, we propose a dynamic efficient forward privacy scheme DESSE in this paper. DESSE uses pseudo-random permutation to realize forward privacy, and uses delete list to identify the final state of the same file added and deleted repeatedly, so as to realize the dynamic update of data. The method proposed in this paper is simple and flexible in structure, takes up less additional space, and can significantly improve the efficiency of updating. At the same time, it can achieve real-time updating of data. The correctness of our proposed scheme is tested using the Enron email data set in the end.