Tight tradeoffs in searchable symmetric encryption

DOI10.1007/S00145-020-09370-ZzbMath1460.94035OpenAlexW2809798689WikidataQ123228192 ScholiaQ123228192MaRDI QIDQ5925503

Gil Segev, Ido Shahaf, Gilad Asharov

Publication date: 7 April 2021

Published in: Journal of Cryptology (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00145-020-09370-z

zbMATH Keywords

localityballs and binssearchable symmetric encryption

Mathematics Subject Classification ID

Cryptography (94A60) Data encryption (aspects in computer science) (68P25) Data structures (68P05) Authentication, digital signatures and secret sharing (94A62)

Related Items (2)

Dynamic local searchable symmetric encryption ⋮ Structured encryption for knowledge graphs

Cites Work

• Explicit and efficient hash families suffice for cuckoo hashing with a stash
• Searchable encryption with optimal locality: achieving sublogarithmic read efficiency
• Deterministic Dictionaries
• Highly-Scalable Searchable Symmetric Encryption with Support for Boolean Queries
• Structured Encryption and Controlled Disclosure
• Succinct Data Structures for Retrieval and Approximate Membership (Extended Abstract)
• Privacy Preserving Keyword Searches on Remote Encrypted Data
• Uniform Hashing in Constant Time and Optimal Space
• Foundations of Cryptography
• Cuckoo hashing
• Searchable symmetric encryption: optimal locality in linear space via two-dimensional balanced allocations
• The Locality of Searchable Symmetric Encryption
• More Robust Hashing: Cuckoo Hashing with a Stash

This page was built for publication: Tight tradeoffs in searchable symmetric encryption