PanORAMa: oblivious RAM with logarithmic overhead

DOI10.1109/FOCS.2018.00087MaRDI QIDQ6944325zbMATH OpenFDO

Authors Kevin Yeo, Giuseppe Persiano, Mariana Raykova, Sarvar Patel

Publication date 12 August 2025

Full work available at URL https://doi.org/10.1109/FOCS.2018.00087

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx) Discrete mathematics in relation to computer science (68Rxx) Theory of computing (68Qxx)

Cited in

(4)

• Memory checking requires logarithmic overhead
• A logarithmic lower bound for oblivious RAM (for all parameters)
• Differentially oblivious Turing machines
• \textsf{PicoGRAM}: practical garbled RAM from decisional Diffie-Hellman

This page was built for publication: PanORAMa: oblivious RAM with logarithmic overhead

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