Lower bounds for encrypted multi-maps and searchable encryption in the leakage cell probe model
From MaRDI portal
Publication:2096495
Recommendations
- Leakage-Resilient Public-Key Cryptography in the Bounded-Retrieval Model
- A ciphertext-size lower bound for order-preserving encryption with limited leakage
- Lower bounds for leakage-resilient secret sharing
- Low-leakage secure search for Boolean expressions
- Ciphertext expansion in limited-leakage order-preserving encryption: a tight computational lower bound
- Limits of a conjecture on a leakage-resilient cryptosystem
- Leakage-Resilient Inner-Product Functional Encryption in the Bounded-Retrieval Model
- Efficient Boolean search over encrypted data with reduced leakage
- Almost tight multi-user security under adaptive corruptions \& leakages in the standard model
Cites work
- \textbf{TWORAM:} efficient oblivious RAM in two rounds with applications to searchable encryption
- Advances in Cryptology - EUROCRYPT 2004
- Boolean searchable symmetric encryption with worst-case sub-linear complexity
- Computationally volume-hiding structured encryption
- Crossing the logarithmic barrier for dynamic Boolean data structure lower bounds
- Deterministic and Efficiently Searchable Encryption
- Dynamic Perfect Hashing: Upper and Lower Bounds
- Fully homomorphic encryption using ideal lattices
- Highly-Scalable Searchable Symmetric Encryption with Support for Boolean Queries
- Is there an oblivious RAM lower bound for online reads?
- Is there an oblivious RAM lower bound?
- Logarithmic Lower Bounds in the Cell-Probe Model
- Lower bounds for differentially private RAMs
- Lower bounds for multi-server oblivious RAMs
- Multi-key searchable encryption, revisited
- OptORAMa: optimal oblivious RAM
- Order-preserving encryption revisited: improved security analysis and alternative solutions
- Order-Preserving Symmetric Encryption
- Searchable encryption with optimal locality: achieving sublogarithmic read efficiency
- Searchable symmetric encryption: optimal locality in linear space via two-dimensional balanced allocations
- Semantically secure order-revealing encryption: multi-input functional encryption without obfuscation
- Should Tables Be Sorted?
- Software protection and simulation on oblivious RAMs
- SQL on structurally-encrypted databases
- Stronger lower bounds for online ORAM
- Structured encryption and controlled disclosure
- Structured encryption and leakage suppression
- The cell probe complexity of dynamic range counting
- The locality of searchable symmetric encryption
- Tight tradeoffs in searchable symmetric encryption
- Yes, there is an oblivious RAM lower bound!
Cited in
(13)- A logarithmic lower bound for oblivious RAM (for all Parameters)
- Computationally volume-hiding structured encryption
- Forward secret encrypted RAM: lower bounds and applications
- Improved security model for public-key authenticated encryption with keyword search
- 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
- Injection-secure structured and searchable symmetric encryption
- Encrypted multi-map that hides query, access, and volume patterns
- Structured encryption and distribution-aware leakage suppression
- A logarithmic lower bound for oblivious RAM (for all parameters)
This page was built for publication: Lower bounds for encrypted multi-maps and searchable encryption in the leakage cell probe model
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2096495)
