Lower bounds for differentially private RAMs

DOI10.1007/978-3-030-17653-2_14MaRDI QIDQ2292653zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• Foundations of differentially oblivious algorithms
• Yes, there is an oblivious RAM lower bound!
• Stronger lower bounds for online ORAM
• A logarithmic lower bound for oblivious RAM (for all Parameters)
• Asymptotically tight bounds for composing ORAM with PIR

Cited in

(15)

• Lower bounds for encrypted multi-maps and searchable encryption in the leakage cell probe model
• A logarithmic lower bound for oblivious RAM (for all Parameters)
• Stronger lower bounds for online ORAM
• A lower bound on the release of differentially private integer partitions
• Forward secret encrypted RAM: lower bounds and applications
• Foundations of differentially oblivious algorithms
• 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
• Advanced composition theorems for differential obliviousness
• A logarithmic lower bound for oblivious RAM (for all parameters)
• Differentially oblivious Turing machines
• Resizable oblivious RAM

This page was built for publication: Lower bounds for differentially private RAMs

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