Limits of breach-resistant and snapshot-oblivious RAMs
From MaRDI portal
Publication:6190101
DOI10.1007/978-3-031-38551-3_6MaRDI QIDQ6190101
Publication date: 6 February 2024
Published in: Advances in Cryptology – CRYPTO 2023 (Search for Journal in Brave)
Cites Work
- Unnamed Item
- Unnamed Item
- SQL on structurally-encrypted databases
- Structured encryption and leakage suppression
- Yes, there is an oblivious RAM lower bound!
- Reducing the servers' computation in private information retrieval: PIR with preprocessing
- Private information retrieval with sublinear online time
- A lower bound for one-round oblivious RAM
- Lower bounds for multi-server oblivious RAMs
- Structured encryption and dynamic leakage suppression
- Lower bounds for encrypted multi-maps and searchable encryption in the leakage cell probe model
- OptORAMa: optimal oblivious RAM
- SSE and SSD: page-efficient searchable symmetric encryption
- A logarithmic lower bound for oblivious RAM (for all Parameters)
- Oblivious RAM with \textit{worst-case} logarithmic overhead
- Single-server private information retrieval with sublinear amortized time
- Stronger lower bounds for online ORAM
- Lower bounds for differentially private RAMs
- Computationally volume-hiding structured encryption
- Oblivious Parallel RAM and Applications
- Oblivious Parallel RAM: Improved Efficiency and Generic Constructions
- Is There an Oblivious RAM Lower Bound?
- Highly-Scalable Searchable Symmetric Encryption with Support for Boolean Queries
- Structured Encryption and Controlled Disclosure
- Should Tables Be Sorted?
- Software protection and simulation on oblivious RAMs
- Lower Bounds for Oblivious Near-Neighbor Search
- Lower Bounds for Oblivious Data Structures
- Boolean Searchable Symmetric Encryption with Worst-Case Sub-linear Complexity
- Advances in Cryptology - EUROCRYPT 2004
- The Locality of Searchable Symmetric Encryption
- Logarithmic Lower Bounds in the Cell-Probe Model
- Is there an oblivious RAM lower bound for online reads?
- Dynamic local searchable symmetric encryption
- Snapshot-oblivious RAMs: sub-logarithmic efficiency for short transcripts
- Encapsulated search index: public-key, sub-linear, distributed, and delegatable
- Efficient Boolean search over encrypted data with reduced leakage
This page was built for publication: Limits of breach-resistant and snapshot-oblivious RAMs
