Perfectly secure oblivious RAM without random oracles

DOI10.1007/978-3-642-19571-6_10MaRDI QIDQ3000537zbMATH OpenOpenAlexFDO

Authors Sigurd Meldgaard, Jesper Buus Nielsen, Ivan B. Damgård

Publication date 19 May 2011

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

Full work available at URL https://doi.org/10.1007/978-3-642-19571-6_10

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• Oblivious RAMs without cryptogarphic assumptions
• Perfectly secure oblivious parallel RAM
• Oblivious RAM Revisited
• Yes, there is an oblivious RAM lower bound!
• Perfectly secure oblivious RAM with sublinear bandwidth overhead

Cited in

(31)

• Perfectly secure oblivious parallel RAM
• Parameter-hiding order revealing encryption
• More is less: perfectly secure oblivious algorithms in the multi-server setting
• Constant-round maliciously secure two-party computation in the RAM model
• Oblivious tight compaction in \(O(n)\) time with smaller constant
• OptORAMa: optimal oblivious RAM
• A logarithmic lower bound for oblivious RAM (for all Parameters)
• Stronger lower bounds for online ORAM
• Secret-shared RAM indefinite private and secure RAM execution of perfectly unrevealed programs
• Oblivious parallel RAM and applications
• Information-Theoretic Local Non-malleable Codes and Their Applications
• Oblivious RAMs without cryptogarphic assumptions
• Data-oblivious graph algorithms in outsourced external memory
• Privacy-preserving access of outsourced data via oblivious RAM simulation
• Constant-round maliciously secure two-party computation in the RAM model
• A Secure Priority Queue; Or: On Secure Datastructures from Multiparty Computation
• Large-Scale Secure Computation: Multi-party Computation for (Parallel) RAM Programs
• Software protection and simulation on oblivious RAMs
• Path ORAM
• Better two-round adaptive multi-party computation
• Asymptotically tight bounds for composing ORAM with PIR
• On the (in)security of hash-based oblivious RAM and a new balancing scheme
• Privacy-preserving group data access via stateless oblivious RAM simulation
• NanoGRAM: garbled RAM with \(\widetilde{O}(\log N)\) overhead
• Random-index oblivious RAM
• \textsf{MacORAMa}: optimal oblivious RAM with integrity
• Maliciously secure multi-client ORAM
• OptORAMa: Optimal oblivious RAM
• PIR with client-side preprocessing: information-theoretic constructions and lower bounds
• Towards practical doubly-efficient private information retrieval
• A logarithmic lower bound for oblivious RAM (for all parameters)

This page was built for publication: Perfectly secure oblivious RAM without random oracles

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