The Locality of Searchable Symmetric Encryption

DOI10.1007/978-3-642-55220-5_20zbMath1332.94061OpenAlexW59915946MaRDI QIDQ5418705

David Cash, Stefano Tessaro

Publication date: 27 May 2014

Published in: Advances in Cryptology – EUROCRYPT 2014 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-55220-5_20

zbMATH Keywords

lower boundsymmetric encryption

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (15)

SSE and SSD: page-efficient searchable symmetric encryption ⋮ Encrypted key-value stores ⋮ Efficient Asymmetric Index Encapsulation Scheme for Named Data ⋮ Dynamic local searchable symmetric encryption ⋮ Efficient Boolean search over encrypted data with reduced leakage ⋮ Efficient Trapdoor Generation from Multiple Hashing in Searchable Symmetric Encryption ⋮ Limits of breach-resistant and snapshot-oblivious RAMs ⋮ Searchable Symmetric Encryption: Optimal Locality in Linear Space via Two-Dimensional Balanced Allocations ⋮ Tight tradeoffs in searchable symmetric encryption ⋮ Locality-preserving oblivious RAM ⋮ Structured encryption and dynamic leakage suppression ⋮ Efficient No-dictionary Verifiable Searchable Symmetric Encryption ⋮ 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: The Locality of Searchable Symmetric Encryption