Boolean Searchable Symmetric Encryption with Worst-Case Sub-linear Complexity
From MaRDI portal
Publication:5270359
DOI10.1007/978-3-319-56617-7_4zbMath1394.94935OpenAlexW2592956480MaRDI QIDQ5270359
Publication date: 23 June 2017
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-56617-7_4
Related Items (13)
Encrypted key-value stores ⋮ Dynamic multi-client searchable symmetric encryption with support for Boolean queries ⋮ Efficient searchable symmetric encryption for join queries ⋮ Updatable searchable symmetric encryption: definitions and constructions ⋮ Efficient Boolean search over encrypted data with reduced leakage ⋮ Exipnos: an efficient verifiable dynamic symmetric searchable encryption scheme with forward and backward privacy ⋮ Efficient Trapdoor Generation from Multiple Hashing in Searchable Symmetric Encryption ⋮ Limits of breach-resistant and snapshot-oblivious RAMs ⋮ Multi-user image retrieval with suppression of search pattern leakage ⋮ Publicly verifiable database scheme with efficient keyword search ⋮ Efficient identity-based broadcast encryption with keyword search against insider attacks for database systems ⋮ Structured encryption and dynamic leakage suppression ⋮ Lower bounds for encrypted multi-maps and searchable encryption in the leakage cell probe model
Uses Software
Cites Work
- On-line ciphers and the Hash-CBC constructions
- Private Large-Scale Databases with Distributed Searchable Symmetric Encryption
- Highly-Scalable Searchable Symmetric Encryption with Support for Boolean Queries
- Parallelizable and Authenticated Online Ciphers
- Functional Encryption: Definitions and Challenges
- Structured Encryption and Controlled Disclosure
- Deterministic and Efficiently Searchable Encryption
- Order-Preserving Symmetric Encryption
- Software protection and simulation on oblivious RAMs
- Fully homomorphic encryption using ideal lattices
- Advances in Cryptology - EUROCRYPT 2004
- Searchable symmetric encryption: optimal locality in linear space via two-dimensional balanced allocations
- The Locality of Searchable Symmetric Encryption
This page was built for publication: Boolean Searchable Symmetric Encryption with Worst-Case Sub-linear Complexity