Stronger lower bounds for online ORAM

DOI10.1007/978-3-030-36033-7_10zbMath1452.68077arXiv1903.03385OpenAlexW2990154253MaRDI QIDQ2175940

Veronika Slívová, Karel Král, Michal Koucký, Pavel Hubáček

Publication date: 30 April 2020

Full work available at URL: https://arxiv.org/abs/1903.03385

zbMATH Keywords

lower boundoblivious RAMbandwidth overhead

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Cryptography (94A60) Data encryption (aspects in computer science) (68P25)

Related Items (6)

A logarithmic lower bound for oblivious RAM (for all Parameters) ⋮ Lower bound framework for differentially private and oblivious data structures ⋮ Lower bounds for (batch) PIR with private preprocessing ⋮ Limits of breach-resistant and snapshot-oblivious RAMs ⋮ Forward secret encrypted RAM: lower bounds and applications ⋮ Lower bounds for encrypted multi-maps and searchable encryption in the leakage cell probe model

Cites Work

• Unnamed Item
• Unnamed Item
• Yes, there is an oblivious RAM lower bound!
• OptORAMa: optimal oblivious RAM
• Lower bounds for differentially private RAMs
• Is There an Oblivious RAM Lower Bound?
• Oblivious RAMs without cryptogrpahic assumptions
• Optimizing ORAM and Using It Efficiently for Secure Computation
• Statistically-secure ORAM with $\tilde{O}(\log^2 n)$ Overhead
• Perfectly Secure Oblivious RAM without Random Oracles
• Privacy-Preserving Access of Outsourced Data via Oblivious RAM Simulation
• Software protection and simulation on oblivious RAMs
• Path ORAM
• Lower Bounds for Oblivious Data Structures
• Logarithmic Lower Bounds in the Cell-Probe Model
• Theory of Cryptography
• Is there an oblivious RAM lower bound for online reads?

This page was built for publication: Stronger lower bounds for online ORAM