Optimizing ORAM and Using It Efficiently for Secure Computation
From MaRDI portal
Publication:2876659
DOI10.1007/978-3-642-39077-7_1zbMath1315.94075OpenAlexW2096379058MaRDI QIDQ2876659
Kenny A. Goldman, Daniel Wichs, Shai Halevi, Mariana Raykova, Charanjit Julta, Craig Gentry
Publication date: 19 August 2014
Published in: Privacy Enhancing Technologies (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-39077-7_1
Related Items (24)
Perfectly secure oblivious parallel RAM ⋮ SQL on structurally-encrypted databases ⋮ A logarithmic lower bound for oblivious RAM (for all Parameters) ⋮ Unnamed Item ⋮ Constant-Round Maliciously Secure Two-Party Computation in the RAM Model ⋮ Large-Scale Secure Computation: Multi-party Computation for (Parallel) RAM Programs ⋮ Stronger lower bounds for online ORAM ⋮ Data-Oblivious Graph Algorithms in Outsourced External Memory ⋮ Efficient Integer Encoding for Homomorphic Encryption via Ring Isomorphisms ⋮ Snapshot-oblivious RAMs: sub-logarithmic efficiency for short transcripts ⋮ NanoGRAM: garbled RAM with \(\widetilde{O}(\log N)\) overhead ⋮ Secret-shared RAM indefinite private and secure RAM execution of perfectly unrevealed programs ⋮ Random-index oblivious RAM ⋮ Simple and efficient two-server ORAM ⋮ Asymptotically Tight Bounds for Composing ORAM with PIR ⋮ Constant-round maliciously secure two-party computation in the RAM model ⋮ Is there an oblivious RAM lower bound for online reads? ⋮ Is there an oblivious RAM lower bound for online reads? ⋮ Private Database Access with HE-over-ORAM Architecture ⋮ Onion ORAM: A Constant Bandwidth Blowup Oblivious RAM ⋮ Oblivious Parallel RAM and Applications ⋮ Oblivious Parallel RAM: Improved Efficiency and Generic Constructions ⋮ TWORAM: Efficient Oblivious RAM in Two Rounds with Applications to Searchable Encryption ⋮ Oblivious network RAM and leveraging parallelism to achieve obliviousness
This page was built for publication: Optimizing ORAM and Using It Efficiently for Secure Computation
