Searchable encryption with optimal locality: achieving sublogarithmic read efficiency
From MaRDI portal
Recommendations
- 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
- Tight tradeoffs in searchable symmetric encryption
- Tight tradeoffs in searchable symmetric encryption
- The locality of searchable symmetric encryption
Cited in
(17)- Perfectly secure oblivious parallel RAM
- Parameter-hiding order revealing encryption
- More is less: perfectly secure oblivious algorithms in the multi-server setting
- Structured encryption and dynamic leakage suppression
- Lower bounds for encrypted multi-maps and searchable encryption in the leakage cell probe model
- SSE and SSD: page-efficient searchable symmetric encryption
- Encrypted key-value stores
- Searchable symmetric encryption: optimal locality in linear space via two-dimensional balanced allocations
- Tight tradeoffs in searchable symmetric encryption
- Locality-preserving oblivious RAM
- Pattern matching in encrypted stream from inner product encryption
- Dynamic local searchable symmetric encryption
- Efficient Boolean search over encrypted data with reduced leakage
- Beyond volume pattern: storage-efficient Boolean searchable symmetric encryption with suppressed leakage
- Injection-secure structured and searchable symmetric encryption
- Hermes: I/O-efficient forward-secure searchable symmetric encryption
- Concurrent encrypted multimaps
This page was built for publication: Searchable encryption with optimal locality: achieving sublogarithmic read efficiency
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1673402)
