Lower bounds for multi-server oblivious RAMs

DOI10.1007/978-3-030-64375-1_17OpenAlexW2982482487MaRDI QIDQ2055732

Kasper Green Larsen, Kevin Yeo, Mark Simkin

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)

Related Items (7)

A logarithmic lower bound for oblivious RAM (for all Parameters) ⋮ Single-server private information retrieval with sublinear amortized time ⋮ 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 ⋮ 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