Skip to main content
placeholder image

ROSE: Robust Searchable Encryption with Forward and Backward Security

Journal Article


Abstract


  • Dynamic searchable symmetric encryption (DSSE) has been widely recognized as a promising technique to delegate update and search queries over an outsourced database to an untrusted server while guaranteeing the privacy of data. Many efforts on DSSE have been devoted to obtaining a good tradeoff between security and performance. However, it appears that all existing DSSE works miss studying on what will happen if the DSSE client issues irrational update queries carelessly, such as duplicate update queries and delete queries to remove non-existent entries (that have been considered by many popular database system in the setting of plaintext). In this scenario, we find that (1) most prior works lose their claimed correctness or security, and (2) no single approach can achieve correctness, forward and backward security, and practical performance at the same time. To address this problem, we study for the first time the notion of robustness of DSSE. Generally, we say that a DSSE scheme is robust if it can keep the same correctness and security even in the case of misoperations. Then, we introduce a new cryptographic primitive named key-updatable pseudo-random function and apply this primitive to constructing ROSE, a robust DSSE scheme with forward and backward security. Finally, we demonstrate the efficiency of ROSE and give the experimental comparisons.

Publication Date


  • 2022

Citation


  • Xu, P., Susilo, W., Wang, W., Chen, T., Wu, Q., Liang, K., & Jin, H. (2022). ROSE: Robust Searchable Encryption with Forward and Backward Security. IEEE Transactions on Information Forensics and Security, 17, 1115-1130. doi:10.1109/TIFS.2022.3155977

Scopus Eid


  • 2-s2.0-85125713517

Start Page


  • 1115

End Page


  • 1130

Volume


  • 17

Abstract


  • Dynamic searchable symmetric encryption (DSSE) has been widely recognized as a promising technique to delegate update and search queries over an outsourced database to an untrusted server while guaranteeing the privacy of data. Many efforts on DSSE have been devoted to obtaining a good tradeoff between security and performance. However, it appears that all existing DSSE works miss studying on what will happen if the DSSE client issues irrational update queries carelessly, such as duplicate update queries and delete queries to remove non-existent entries (that have been considered by many popular database system in the setting of plaintext). In this scenario, we find that (1) most prior works lose their claimed correctness or security, and (2) no single approach can achieve correctness, forward and backward security, and practical performance at the same time. To address this problem, we study for the first time the notion of robustness of DSSE. Generally, we say that a DSSE scheme is robust if it can keep the same correctness and security even in the case of misoperations. Then, we introduce a new cryptographic primitive named key-updatable pseudo-random function and apply this primitive to constructing ROSE, a robust DSSE scheme with forward and backward security. Finally, we demonstrate the efficiency of ROSE and give the experimental comparisons.

Publication Date


  • 2022

Citation


  • Xu, P., Susilo, W., Wang, W., Chen, T., Wu, Q., Liang, K., & Jin, H. (2022). ROSE: Robust Searchable Encryption with Forward and Backward Security. IEEE Transactions on Information Forensics and Security, 17, 1115-1130. doi:10.1109/TIFS.2022.3155977

Scopus Eid


  • 2-s2.0-85125713517

Start Page


  • 1115

End Page


  • 1130

Volume


  • 17