Tight tradeoffs in searchable symmetric encryption
From MaRDI portal
Publication:5915726
DOI10.1007/978-3-319-96884-1_14zbMath1444.94042OpenAlexW3160334165MaRDI QIDQ5915726
Gilad Asharov, Gil Segev, Ido Shahaf
Publication date: 12 September 2018
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-96884-1_14
Related Items (8)
SSE and SSD: page-efficient searchable symmetric encryption ⋮ Encrypted key-value stores ⋮ Dynamic local searchable symmetric encryption ⋮ Efficient Boolean search over encrypted data with reduced leakage ⋮ Locality-preserving oblivious RAM ⋮ Structured encryption and dynamic leakage suppression ⋮ Handling adaptive compromise for practical encryption schemes ⋮ Lower bounds for encrypted multi-maps and searchable encryption in the leakage cell probe model
This page was built for publication: Tight tradeoffs in searchable symmetric encryption
