Perfectly Secure Oblivious RAM without Random Oracles
From MaRDI portal
Publication:3000537
DOI10.1007/978-3-642-19571-6_10zbMath1295.94046OpenAlexW1565007622MaRDI QIDQ3000537
Jesper Buus Nielsen, Sigurd Meldgaard, 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
Related Items (21)
Perfectly secure oblivious parallel RAM ⋮ Parameter-hiding order revealing encryption ⋮ A logarithmic lower bound for oblivious RAM (for all Parameters) ⋮ Constant-Round Maliciously Secure Two-Party Computation in the RAM Model ⋮ Large-Scale Secure Computation: Multi-party Computation for (Parallel) RAM Programs ⋮ A Secure Priority Queue; Or: On Secure Datastructures from Multiparty Computation ⋮ Stronger lower bounds for online ORAM ⋮ Data-Oblivious Graph Algorithms in Outsourced External Memory ⋮ NanoGRAM: garbled RAM with \(\widetilde{O}(\log N)\) overhead ⋮ Secret-shared RAM indefinite private and secure RAM execution of perfectly unrevealed programs ⋮ \textsf{MacORAMa}: optimal oblivious RAM with integrity ⋮ More is less: perfectly secure oblivious algorithms in the multi-server setting ⋮ Privacy-Preserving Access of Outsourced Data via Oblivious RAM Simulation ⋮ Better Two-Round Adaptive Multi-party Computation ⋮ Asymptotically Tight Bounds for Composing ORAM with PIR ⋮ Constant-round maliciously secure two-party computation in the RAM model ⋮ Oblivious Parallel RAM and Applications ⋮ Information-Theoretic Local Non-malleable Codes and Their Applications ⋮ Unnamed Item ⋮ Unnamed Item ⋮ OptORAMa: optimal oblivious RAM
This page was built for publication: Perfectly Secure Oblivious RAM without Random Oracles
