Searchable symmetric encryption: optimal locality in linear space via two-dimensional balanced allocations

DOI10.1137/19M1303186MaRDI QIDQ5157397zbMATH OpenOpenAlexWikidataFDO

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

zbMATH Keywords

localitysearchable symmetric encryptionbalanced allocations

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Cryptography (94A60) Applications of queueing theory (congestion, allocation, storage, traffic, etc.) (60K30) Database theory (68P15)

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

Cites work

• scientific article; zbMATH DE number 3738722 (Why is no real title available?)
• scientific article; zbMATH DE number 1857645 (Why is no real title available?)
• A proof of security of Yao's protocol for two-party computation
• Balanced Allocations
• Balls and bins: A study in negative dependence
• Concentration of Measure for the Analysis of Randomized Algorithms
• Cuckoo hashing
• Deterministic dictionaries
• Highly-Scalable Searchable Symmetric Encryption with Support for Boolean Queries
• Multidimensional balanced allocations
• Negative association of random variables, with applications
• Privacy Preserving Keyword Searches on Remote Encrypted Data
• Probability and Computing
• Structured encryption and controlled disclosure
• Succinct Data Structures for Retrieval and Approximate Membership (Extended Abstract)
• The locality of searchable symmetric encryption
• Uniform Hashing in Constant Time and Optimal Space

Cited in

(6)

• Tight tradeoffs in searchable symmetric encryption
• The locality of searchable symmetric encryption
• Searchable encryption with optimal locality: achieving sublogarithmic read efficiency
• Tight tradeoffs in searchable symmetric encryption
• Dynamic local searchable symmetric encryption
• Searchable symmetric encryption: optimal locality in linear space via two-dimensional balanced allocations

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)