A lower bound for one-round oblivious RAM

DOI10.1007/978-3-030-64375-1_16MaRDI QIDQ2055730zbMATH OpenOpenAlexFDO

Authors David Cash, Andrew Drucker, Alexander 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)

Cited in

(5)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2055730)