We propose the first linear-space searchable encryption scheme with constant locality and sublogarithmic read efficiency, strictly improving the previously best known read efficiency bound (Asharov et al., STOC 2016) from (formula presented) and where N is the number of keyword-document pairs. Our scheme employs four different allocation algorithms for storing the keyword lists, depending on the size of the list considered each time. For our construction we develop (i) new probability bounds for the offline two-choice allocation problem; (ii) and a new I/O-efficient oblivious RAM with (formula presented) bandwidth overhead and zero failure probability, both of which can be of independent interest.
CITATION STYLE
Demertzis, I., Papadopoulos, D., & Papamanthou, C. (2018). Searchable encryption with optimal locality: Achieving sublogarithmic read efficiency. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 10991 LNCS, pp. 371–406). Springer Verlag. https://doi.org/10.1007/978-3-319-96884-1_13
Mendeley helps you to discover research relevant for your work.