The complexity of secure RAMs

DOI10.1007/978-3-031-30448-4_2MaRDI QIDQ6057308

Giuseppe Persiano

Publication date: 4 October 2023

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

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Cites Work

• Yes, there is an oblivious RAM lower bound!
• Lower bounds for encrypted multi-maps and searchable encryption in the leakage cell probe model
• OptORAMa: optimal oblivious RAM
• A logarithmic lower bound for oblivious RAM (for all Parameters)
• Lower bounds for differentially private RAMs
• Onion ORAM: A Constant Bandwidth Blowup Oblivious RAM
• Is There an Oblivious RAM Lower Bound?
• Software protection and simulation on oblivious RAMs
• Theory of Cryptography
• Snapshot-oblivious RAMs: sub-logarithmic efficiency for short transcripts
• Unnamed Item
• Unnamed Item

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