Lower bounds for differentially private RAMs

DOI10.1007/978-3-030-17653-2_14zbMath1470.94097OpenAlexW2902857846MaRDI QIDQ2292653

Giuseppe Persiano, Kevin Yeo

Publication date: 4 February 2020

Full work available at URL: https://doi.org/10.1007/978-3-030-17653-2_14

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (9)

A logarithmic lower bound for oblivious RAM (for all Parameters) ⋮ Stronger lower bounds for online ORAM ⋮ The complexity of secure RAMs ⋮ Snapshot-oblivious RAMs: sub-logarithmic efficiency for short transcripts ⋮ Lower bound framework for differentially private and oblivious data structures ⋮ Lower bounds for (batch) PIR with private preprocessing ⋮ 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 differentially private RAMs