A logarithmic lower bound for oblivious RAM (for all Parameters)
From MaRDI portal
Publication:2139649
DOI10.1007/978-3-030-84259-8_20zbMATH Open1489.94102OpenAlexW3192610252MaRDI QIDQ2139649FDOQ2139649
Publication date: 18 May 2022
Full work available at URL: https://doi.org/10.1007/978-3-030-84259-8_20
Recommendations
Data encryption (aspects in computer science) (68P25) Cryptography (94A60) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Classical models of computation (Turing machines, etc.) (68Q04)
Cites Work
- Should Tables Be Sorted?
- The cell probe complexity of dynamic range counting
- Title not available (Why is that?)
- Software protection and simulation on oblivious RAMs
- Privacy-Preserving Access of Outsourced Data via Oblivious RAM Simulation
- Oblivious RAM with O((logN)3) Worst-Case Cost
- Path ORAM
- Dynamic proofs of retrievability via oblivious RAM
- Logarithmic Lower Bounds in the Cell-Probe Model
- Can We Overcome the n log n Barrier for Oblivious Sorting?
- Oblivious hashing revisited, and applications to asymptotically efficient ORAM and OPRAM
- Oblivious Parallel RAM and Applications
- Optimizing ORAM and Using It Efficiently for Secure Computation
- Perfectly Secure Oblivious RAM without Random Oracles
- Large-Scale Secure Computation: Multi-party Computation for (Parallel) RAM Programs
- Garbled RAM Revisited
- Title not available (Why is that?)
- Title not available (Why is that?)
- Distributed Oblivious RAM for Secure Two-Party Computation
- Asymptotically Tight Bounds for Composing ORAM with PIR
- OptORAMa: optimal oblivious RAM
- Yes, there is an oblivious RAM lower bound!
- Permuting Information in Idealized Two-Level Storage
- Private Database Access with HE-over-ORAM Architecture
- Crossing the logarithmic barrier for dynamic Boolean data structure lower bounds
- A lower bound for one-round oblivious RAM
- Lower bounds for multi-server oblivious RAMs
- Lower bounds for encrypted multi-maps and searchable encryption in the leakage cell probe model
- Stronger lower bounds for online ORAM
- Lower bounds for differentially private RAMs
- Is there an oblivious RAM lower bound?
- Lower bounds for external memory integer sorting via network coding
- Onion ORAM: A Constant Bandwidth Blowup Oblivious RAM
- Lower Bounds for Oblivious Near-Neighbor Search
- Lower Bounds for Oblivious Data Structures
- Is there an oblivious RAM lower bound for online reads?
Cited In (10)
- Lower bound framework for differentially private and oblivious data structures
- Lower bounds for (batch) PIR with private preprocessing
- Is there an oblivious RAM lower bound for online reads?
- Snapshot-oblivious RAMs: sub-logarithmic efficiency for short transcripts
- \textsf{MacORAMa}: optimal oblivious RAM with integrity
- Limits of breach-resistant and snapshot-oblivious RAMs
- Single-server private information retrieval with sublinear amortized time
- Doubly efficient private information retrieval and fully homomorphic RAM computation from ring LWE
- The complexity of secure RAMs
- Oblivious RAM with worst-case logarithmic overhead
Uses Software
This page was built for publication: A logarithmic lower bound for oblivious RAM (for all Parameters)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2139649)
