Dynamic Searchable Symmetric Encryption with Forward and Backward Privacy: A Survey

6Citations
Citations of this article
10Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Searchable symmetric encryption (SSE) has been proposed that enables the clients to outsource their private encrypted data onto the cloud server and later the data can be searched with limited information leakage. However, existing surveys have not covered most recent advances on SSE technique. To fill the gap, we make a survey on state-of-the-art representative SSE schemes in cloud environment. We mainly focus on dynamic SSE schemes with forward and backward privacy, two vital security elements to maintain query privacy during data update operations. Specifically, we discuss about SSE protocols based on query expressiveness, including single keyword search, conjunctive keyword search, range search, disjunctive keyword search and verifiable search. Finally, through comparison on query expressiveness, security and efficiency, we demonstrate the strengths and weaknesses of the existing SSE protocols.

Cite

CITATION STYLE

APA

Gan, Q., Zuo, C., Wang, J., Sun, S. F., & Wang, X. (2019). Dynamic Searchable Symmetric Encryption with Forward and Backward Privacy: A Survey. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 11928 LNCS, pp. 37–52). Springer. https://doi.org/10.1007/978-3-030-36938-5_3

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free