Lower bounds for multi-server oblivious RAMs

DOI10.1007/978-3-030-64375-1_17MaRDI QIDQ2055732zbMATH OpenOpenAlexFDO

Authors Kasper Green Larsen, Mark Simkin, Kevin Yeo

Publication date 1 December 2021

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

Mathematics Subject Classification ID

Cryptography (94A60) Computer system organization (68Mxx)

Cited in

(9)

• 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
• Multi-client Oblivious RAM Secure Against Malicious Servers
• Limits of breach-resistant and snapshot-oblivious RAMs
• Single-server private information retrieval with sublinear amortized time
• Forward secret encrypted RAM: lower bounds and applications
• Lower bounds for encrypted multi-maps and searchable encryption in the leakage cell probe model

This page was built for publication: Lower bounds for multi-server oblivious RAMs

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