Random-index oblivious RAM

DOI10.1007/978-3-031-22368-6_2MaRDI QIDQ6169549zbMATH OpenOpenAlexFDO

Authors Shai Halevi, Eyal Kushilevitz

Publication date 14 August 2023

Published in Theory of Cryptography (Search for Journal in Brave)

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

zbMATH Keywords

samplingrandom-index ORAM

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• Oblivious RAM Revisited
• Perfectly secure oblivious RAM without random oracles
• Oblivious parallel RAM: improved efficiency and generic constructions
• Simple and efficient two-server ORAM
• Locality-preserving oblivious RAM

Cites work

• Balls and bins: A study in negative dependence
• Can a public blockchain keep a secret?
• Distributed Oblivious RAM for Secure Two-Party Computation
• Efficient noise-tolerant learning from statistical queries
• Is there an oblivious RAM lower bound for online reads?
• Is there an oblivious RAM lower bound?
• Oblivious parallel RAM and applications
• Oblivious tight compaction in \(O(n)\) time with smaller constant
• 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
• Optimizing ORAM and Using It Efficiently for Secure Computation
• Random-index PIR and applications
• Simple and efficient two-server ORAM
• Software protection and simulation on oblivious RAMs
• Yes, there is an oblivious RAM lower bound!

Cited in

(2)

• Weighted oblivious RAM, with applications to searchable symmetric encryption
• Oblivious RAM Revisited

This page was built for publication: Random-index oblivious RAM

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