Perfectly secure oblivious RAM without random oracles

DOI10.1007/978-3-642-19571-6_10zbMATH Open1295.94046OpenAlexW1565007622MaRDI QIDQ3000537FDOQ3000537

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

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

Mathematics Subject Classification ID

Cryptography (94A60)

Cited In (28)

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

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)