Lower bounds for encrypted multi-maps and searchable encryption in the leakage cell probe model
From MaRDI portal
Publication:2096495
DOI10.1007/978-3-030-56784-2_15zbMath1503.94042OpenAlexW3048898007MaRDI QIDQ2096495
Giuseppe Persiano, Sarvar Patel, Kevin Yeo
Publication date: 9 November 2022
Full work available at URL: https://doi.org/10.1007/978-3-030-56784-2_15
Related Items (8)
A logarithmic lower bound for oblivious RAM (for all Parameters) ⋮ The complexity of secure RAMs ⋮ Lower bound framework for differentially private and oblivious data structures ⋮ Lower bounds for (batch) PIR with private preprocessing ⋮ Efficient Boolean search over encrypted data with reduced leakage ⋮ Limits of breach-resistant and snapshot-oblivious RAMs ⋮ Forward secret encrypted RAM: lower bounds and applications ⋮ Improved security model for public-key authenticated encryption with keyword search
Uses Software
Cites Work
- SQL on structurally-encrypted databases
- Structured encryption and leakage suppression
- Searchable encryption with optimal locality: achieving sublogarithmic read efficiency
- Multi-key searchable encryption, revisited
- Yes, there is an oblivious RAM lower bound!
- Lower bounds for multi-server oblivious RAMs
- OptORAMa: optimal oblivious RAM
- Stronger lower bounds for online ORAM
- Lower bounds for differentially private RAMs
- Computationally volume-hiding structured encryption
- Is There an Oblivious RAM Lower Bound?
- TWORAM: Efficient Oblivious RAM in Two Rounds with Applications to Searchable Encryption
- Highly-Scalable Searchable Symmetric Encryption with Support for Boolean Queries
- Semantically Secure Order-Revealing Encryption: Multi-input Functional Encryption Without Obfuscation
- Structured Encryption and Controlled Disclosure
- Deterministic and Efficiently Searchable Encryption
- Order-Preserving Symmetric Encryption
- Should Tables Be Sorted?
- Dynamic Perfect Hashing: Upper and Lower Bounds
- Software protection and simulation on oblivious RAMs
- Fully homomorphic encryption using ideal lattices
- Order-Preserving Encryption Revisited: Improved Security Analysis and Alternative Solutions
- Crossing the logarithmic barrier for dynamic Boolean data structure lower bounds
- Boolean Searchable Symmetric Encryption with Worst-Case Sub-linear Complexity
- Advances in Cryptology - EUROCRYPT 2004
- Searchable symmetric encryption: optimal locality in linear space via two-dimensional balanced allocations
- The cell probe complexity of dynamic range counting
- The Locality of Searchable Symmetric Encryption
- Logarithmic Lower Bounds in the Cell-Probe Model
- Is there an oblivious RAM lower bound for online reads?
- Tight tradeoffs in searchable symmetric encryption
This page was built for publication: Lower bounds for encrypted multi-maps and searchable encryption in the leakage cell probe model
