USENIX Security '22 - Dynamic Searchable Encryption with Optimal Search in the Presence of Deletions

USENIX Security '22 - Dynamic Searchable Encryption with Optimal Search in the Presence of Deletions

Javad Ghareh Chamani and Dimitrios Papadopoulos, Hong Kong University of Science and Technology; Mohammadamin Karbasforushan and Ioannis Demertzis, UC Santa Cruz

We focus on the problem of Dynamic Searchable Encryption (DSE) with efficient (optimal/quasi-optimal) search in the presence of deletions. Towards that end, we first propose OSSE, the first DSE scheme that can achieve asymptotically optimal search time, linear to the result size and independent …

dynamic encryption search searchable security usenix