Paper 2017/749
Searchable Encryption with Optimal Locality: Achieving Sublogarithmic Read Efficiency
Ioannis Demertzis, Dimitrios Papadopoulos, and Charalampos Papamanthou
Abstract
We propose the first linear-space searchable encryption scheme with constant locality and \emph{sublogarithmic} read efficiency, strictly improving the previously best known read efficiency bound (Asharov et al., STOC 2016) from
Metadata
- Available format(s)
-
PDF
- Category
- Foundations
- Publication info
- Preprint. MINOR revision.
- Keywords
- Searchable EncryptionLocalityRead Efficiency
- Contact author(s)
- cpap @ umd edu
- History
- 2017-11-03: last of 5 revisions
- 2017-08-07: received
- See all versions
- Short URL
- https://ia.cr/2017/749
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2017/749, author = {Ioannis Demertzis and Dimitrios Papadopoulos and Charalampos Papamanthou}, title = {Searchable Encryption with Optimal Locality: Achieving Sublogarithmic Read Efficiency}, howpublished = {Cryptology {ePrint} Archive, Paper 2017/749}, year = {2017}, url = {https://eprint.iacr.org/2017/749} }