The locality of searchable symmetric encryption
From MaRDI portal
Publication:5418705
DOI10.1007/978-3-642-55220-5_20zbMATH Open1332.94061OpenAlexW59915946MaRDI QIDQ5418705FDOQ5418705
Authors: 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
Recommendations
- Tight tradeoffs in searchable symmetric encryption
- Tight tradeoffs in searchable symmetric encryption
- Searchable symmetric encryption: optimal locality in linear space via two-dimensional balanced allocations
- Searchable symmetric encryption: optimal locality in linear space via two-dimensional balanced allocations
- Dynamic local searchable symmetric encryption
Cited In (22)
- Dynamic local searchable symmetric encryption
- Boolean searchable symmetric encryption with worst-case sub-linear complexity
- Searchable symmetric encryption: optimal locality in linear space via two-dimensional balanced allocations
- Searchable encryption with optimal locality: achieving sublogarithmic read efficiency
- SSE and SSD: page-efficient searchable symmetric encryption
- Title not available (Why is that?)
- Hermes: I/O-efficient forward-secure searchable symmetric encryption
- Injection-secure structured and searchable symmetric encryption
- Forward-secure searchable encryption on labeled bipartite graphs
- Tight tradeoffs in searchable symmetric encryption
- Tight tradeoffs in searchable symmetric encryption
- Efficient Asymmetric Index Encapsulation Scheme for Named Data
- Encrypted key-value stores
- Efficient Trapdoor Generation from Multiple Hashing in Searchable Symmetric Encryption
- Limits of breach-resistant and snapshot-oblivious RAMs
- Efficient no-dictionary verifiable searchable symmetric encryption
- Searchable symmetric encryption: optimal locality in linear space via two-dimensional balanced allocations
- Locality-preserving oblivious RAM
- Efficient Boolean search over encrypted data with reduced leakage
- 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: The locality of searchable symmetric encryption
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5418705)
