Paper 2022/648
Dynamic Searchable Encryption with Optimal Search in the Presence of Deletions
Abstract
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
Metadata
- Available format(s)
- Category
- Cryptographic protocols
- Publication info
- Published elsewhere. USENIX 2022
- Keywords
- Dynamic Searchable Encryption Forward and Backward privacy Optimal Search
- Contact author(s)
-
jgc @ cse ust hk
dipapado @ cse ust hk
mkarbasf @ ucsc edu
idemertz @ ucsc edu - History
- 2022-07-01: revised
- 2022-05-25: received
- See all versions
- Short URL
- https://ia.cr/2022/648
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2022/648, author = {Javad Ghareh Chamani and Dimitrios Papadopoulos and Mohammadamin Karbasforushan and Ioannis Demertzis}, title = {Dynamic Searchable Encryption with Optimal Search in the Presence of Deletions}, howpublished = {Cryptology {ePrint} Archive, Paper 2022/648}, year = {2022}, url = {https://eprint.iacr.org/2022/648} }