Resizable oblivious RAM

DOI10.1007/978-3-032-25330-9_10MaRDI QIDQ7304143zbMATH OpenFDO

Authors Amine Bahi, Brice Minaud, Tarik Moataz

Publication date 24 July 2026

Full work available at URL https://doi.org/10.1007/978-3-032-25330-9_10

Mathematics Subject Classification ID

Cryptography (94A60)

Cites work

• \textbf{TWORAM:} efficient oblivious RAM in two rounds with applications to searchable encryption
• Injection-secure structured and searchable symmetric encryption
• Is there an oblivious RAM lower bound?
• Limits of breach-resistant and snapshot-oblivious RAMs
• Lower bounds for differentially private RAMs
• Lower bounds for multi-server oblivious RAMs
• Oblivious parallel RAM and applications
• Oblivious RAM with \(O((\log N)^{3})\) worst-case cost
• 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
• PanORAMa: oblivious RAM with logarithmic overhead
• Software protection and simulation on oblivious RAMs
• Structured encryption and controlled disclosure
• Structured encryption and dynamic leakage suppression
• Structured encryption and leakage suppression
• The design of dynamic data structures
• Weighted oblivious RAM, with applications to searchable symmetric encryption
• Yes, there is an oblivious RAM lower bound!

This page was built for publication: Resizable oblivious RAM

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