Searchable symmetric encryption: optimal locality in linear space via two-dimensional balanced allocations
From MaRDI portal
Publication:5361905
DOI10.1145/2897518.2897562zbMath1373.68211OpenAlexW2414102663MaRDI QIDQ5361905
Ido Shahaf, Gil Segev, Moni Naor, Gilad Asharov
Publication date: 29 September 2017
Published in: Proceedings of the forty-eighth annual ACM symposium on Theory of Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/2897518.2897562
Analysis of algorithms and problem complexity (68Q25) Database theory (68P15) Cryptography (94A60) Data encryption (aspects in computer science) (68P25)
Related Items (13)
SSE and SSD: page-efficient searchable symmetric encryption ⋮ Encrypted key-value stores ⋮ Dynamic local searchable symmetric encryption ⋮ Weighted oblivious RAM, with applications to searchable symmetric encryption ⋮ Cuckoo hashing in cryptography: optimal parameters, robustness and applications ⋮ Multi-user image retrieval with suppression of search pattern leakage ⋮ Tight tradeoffs in searchable symmetric encryption ⋮ Locality-preserving oblivious RAM ⋮ Structured encryption and dynamic leakage suppression ⋮ The Feasibility of Outsourced Database Search in the Plain Model ⋮ Handling adaptive compromise for practical encryption schemes ⋮ Lower bounds for encrypted multi-maps and searchable encryption in the leakage cell probe model ⋮ Boolean Searchable Symmetric Encryption with Worst-Case Sub-linear Complexity
This page was built for publication: Searchable symmetric encryption: optimal locality in linear space via two-dimensional balanced allocations
