Is there an oblivious RAM lower bound for online reads?
From MaRDI portal
Publication:5918328
DOI10.1007/s00145-021-09392-1OpenAlexW2949809737MaRDI QIDQ5918328
Publication date: 2 July 2021
Published in: Journal of Cryptology (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00145-021-09392-1
Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62) Theory of data (68Pxx)
Related Items (2)
A logarithmic lower bound for oblivious RAM (for all Parameters) ⋮ Snapshot-oblivious RAMs: sub-logarithmic efficiency for short transcripts
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
- A lower bound for one-round oblivious RAM
- OptORAMa: optimal oblivious RAM
- 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
- Path ORAM
- Distributed Oblivious RAM for Secure Two-Party Computation
- Dynamic Proofs of Retrievability via Oblivious RAM
- 3-query locally decodable codes of subexponential length
- Lower bounds for external memory integer sorting via network coding
- 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?
