The complexity of secure RAMs

DOI10.1007/978-3-031-30448-4_2MaRDI QIDQ6057308zbMATH OpenFDO

Authors Giuseppe Persiano

Publication date 4 October 2023

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-031-30448-4_2

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Cites work

• A logarithmic lower bound for oblivious RAM (for all Parameters)
• Is there an oblivious RAM lower bound?
• Lower bounds for differentially private RAMs
• Lower bounds for encrypted multi-maps and searchable encryption in the leakage cell probe model
• On the (in)security of hash-based oblivious RAM and a new balancing scheme
• Onion ORAM: a constant bandwidth blowup oblivious RAM
• OptORAMa: optimal oblivious RAM
• Privacy-preserving group data access via stateless oblivious RAM simulation
• Snapshot-oblivious RAMs: sub-logarithmic efficiency for short transcripts
• Software protection and simulation on oblivious RAMs
• Theory of Cryptography
• Yes, there is an oblivious RAM lower bound!

Cited in

(4)

• Gradual GRAM and secure computation for RAM programs
• Adaptively secure computation for RAM programs
• Forward secret encrypted RAM: lower bounds and applications
• Optimizing ORAM and Using It Efficiently for Secure Computation

This page was built for publication: The complexity of secure RAMs

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