A lower bound for one-round oblivious RAM

DOI10.1007/978-3-030-64375-1_16OpenAlexW3095329330MaRDI QIDQ2055730

David Cash, Andrew Drucker, Alexander P. Hoover

Publication date: 1 December 2021

Full work available at URL: https://doi.org/10.1007/978-3-030-64375-1_16

Mathematics Subject Classification ID

Cryptography (94A60) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (5)

A logarithmic lower bound for oblivious RAM (for all Parameters) ⋮ Snapshot-oblivious RAMs: sub-logarithmic efficiency for short transcripts ⋮ Lower bound framework for differentially private and oblivious data structures ⋮ Limits of breach-resistant and snapshot-oblivious RAMs ⋮ Is there an oblivious RAM lower bound for online reads?

This page was built for publication: A lower bound for one-round oblivious RAM