Searchable symmetric encryption: optimal locality in linear space via two-dimensional balanced allocations
DOI10.1137/19M1303186zbMATH Open1475.94101OpenAlexW3200246893WikidataQ121141247 ScholiaQ121141247MaRDI QIDQ5157397FDOQ5157397
Authors: Gilad Asharov, Moni Naor, Gil Segev, Ido Shahaf 
Publication date: 18 October 2021
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/19m1303186
Recommendations
- 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
- Dynamic local searchable symmetric encryption
Data encryption (aspects in computer science) (68P25) Cryptography (94A60) Applications of queueing theory (congestion, allocation, storage, traffic, etc.) (60K30) Database theory (68P15)
Cites Work
- Negative association of random variables, with applications
- Title not available (Why is that?)
- A proof of security of Yao's protocol for two-party computation
- Uniform Hashing in Constant Time and Optimal Space
- Balanced Allocations
- Cuckoo hashing
- Probability and Computing
- Balls and bins: A study in negative dependence
- Title not available (Why is that?)
- Concentration of Measure for the Analysis of Randomized Algorithms
- Deterministic dictionaries
- Succinct Data Structures for Retrieval and Approximate Membership (Extended Abstract)
- Privacy Preserving Keyword Searches on Remote Encrypted Data
- Highly-Scalable Searchable Symmetric Encryption with Support for Boolean Queries
- Structured encryption and controlled disclosure
- The locality of searchable symmetric encryption
- Multidimensional balanced allocations
Cited In (6)
- Dynamic local searchable symmetric encryption
- Searchable symmetric encryption: optimal locality in linear space via two-dimensional balanced allocations
- Searchable encryption with optimal locality: achieving sublogarithmic read efficiency
- Tight tradeoffs in searchable symmetric encryption
- Tight tradeoffs in searchable symmetric encryption
- The locality of searchable symmetric encryption
This page was built for publication: Searchable symmetric encryption: optimal locality in linear space via two-dimensional balanced allocations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5157397)
