Searchable encryption with optimal locality: achieving sublogarithmic read efficiency
From MaRDI portal
Publication:1673402
DOI10.1007/978-3-319-96884-1_13zbMath1444.94061OpenAlexW2752167152MaRDI QIDQ1673402
Charalampos Papamanthou, Ioannis Demertzis, Dimitrios Papadopoulos
Publication date: 12 September 2018
Full work available at URL: https://doi.org/10.1007/978-3-319-96884-1_13
Related Items (12)
SSE and SSD: page-efficient searchable symmetric encryption ⋮ Perfectly secure oblivious parallel RAM ⋮ Parameter-hiding order revealing encryption ⋮ Encrypted key-value stores ⋮ Pattern matching in encrypted stream from inner product encryption ⋮ Dynamic local searchable symmetric encryption ⋮ Efficient Boolean search over encrypted data with reduced leakage ⋮ More is less: perfectly secure oblivious algorithms in the multi-server setting ⋮ Tight tradeoffs in searchable symmetric encryption ⋮ Locality-preserving oblivious RAM ⋮ Structured encryption and dynamic leakage suppression ⋮ Lower bounds for encrypted multi-maps and searchable encryption in the leakage cell probe model
This page was built for publication: Searchable encryption with optimal locality: achieving sublogarithmic read efficiency
