Is there an oblivious RAM lower bound for online reads?
From MaRDI portal
Publication:5915623
DOI10.1007/978-3-030-03810-6_22zbMath1430.94090OpenAlexW2886070468MaRDI QIDQ5915623
Publication date: 6 December 2018
Published in: Theory of Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-030-03810-6_22
Cryptography (94A60) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items (9)
The function-inversion problem: barriers and opportunities ⋮ Stronger lower bounds for online ORAM ⋮ Lower bound framework for differentially private and oblivious data structures ⋮ Random-index oblivious RAM ⋮ Limits of breach-resistant and snapshot-oblivious RAMs ⋮ Is there an oblivious RAM lower bound for online reads? ⋮ Is there an oblivious RAM lower bound for online reads? ⋮ Two-server distributed ORAM with sublinear computation and constant rounds ⋮ Lower bounds for encrypted multi-maps and searchable encryption in the leakage cell probe model
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A Boolean function requiring 3n network size
- Sorting in \(c \log n\) parallel steps
- Can we access a database both locally and privately?
- Towards doubly efficient private information retrieval
- Simple and efficient two-server ORAM
- Yes, there is an oblivious RAM lower bound!
- Query-efficient locally decodable codes of subexponential length
- Sub-logarithmic distributed oblivious RAM with small block size
- Private anonymous data access
- Private Database Access with HE-over-ORAM Architecture
- Onion ORAM: A Constant Bandwidth Blowup Oblivious RAM
- Is There an Oblivious RAM Lower Bound?
- Optimizing ORAM and Using It Efficiently for Secure Computation
- Efficient, Oblivious Data Structures for MPC
- Public Key Locally Decodable Codes with Short Keys
- Oblivious RAM with O((logN)3) Worst-Case Cost
- On the efficiency of local decoding procedures for error-correcting codes
- Large-Scale Secure Computation: Multi-party Computation for (Parallel) RAM Programs
- Public-Key Locally-Decodable Codes
- Software protection and simulation on oblivious RAMs
- Distributed Oblivious RAM for Secure Two-Party Computation
- Dynamic Proofs of Retrievability via Oblivious RAM
- 3-query locally decodable codes of subexponential length
- Zig-zag sort
- Verifiable Oblivious Storage
- Logarithmic Lower Bounds in the Cell-Probe Model
- Asymptotically Tight Bounds for Composing ORAM with PIR
- Is there an oblivious RAM lower bound for online reads?
This page was built for publication: Is there an oblivious RAM lower bound for online reads?
