Oblivious parallel RAM and applications

DOI10.1007/978-3-662-49099-0_7MaRDI QIDQ2799095zbMATH OpenOpenAlexFDO

Authors Elette Boyle, Kai-Min Chung, Rafael Pass

Publication date 8 April 2016

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

Full work available at URL https://doi.org/10.1007/978-3-662-49099-0_7

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• Perfectly secure oblivious parallel RAM
• On the depth of oblivious parallel RAM
• Circuit OPRAM: unifying statistically and computationally secure ORAMs and OPRAMs
• Cryptography for parallel RAM from indistinguishability obfuscation
• Black-box parallel garbled RAM

Cites work

• scientific article; zbMATH DE number 1559545 (Why is no real title available?)
• Distributed Oblivious RAM for Secure Two-Party Computation
• Garbled RAM from one-way functions
• Garbled RAM revisited
• How to run Turing machines on encrypted data
• Indistinguishability obfuscation for Turing machines with unbounded memory
• Large-Scale Secure Computation: Multi-party Computation for (Parallel) RAM Programs
• Oblivious RAM with \(O((\log N)^{3})\) worst-case cost
• Oblivious RAMs without cryptogarphic assumptions
• Oblivious parallel RAM: improved efficiency and generic constructions
• Optimizing ORAM and Using It Efficiently for Secure Computation
• Perfectly secure oblivious RAM without random oracles
• Privacy-preserving access of outsourced data via oblivious RAM simulation
• Relations Among Complexity Measures
• Software protection and simulation on oblivious RAMs
• Sorting in Average Time $o(\log \,n)$
• Statistically-secure ORAM with \(\tilde{O}(\log^2 n)\) overhead
• Succinct garbling and indistinguishability obfuscation for RAM programs
• Succinct randomized encodings and their applications

Cited in

(22)

• Adaptively secure garbling schemes for parallel computations
• Oblivious network RAM and leveraging parallelism to achieve obliviousness
• Lower bound framework for differentially private and oblivious data structures
• Oblivious RAM Revisited
• Memory checking for parallel RAMs
• Perfectly secure oblivious parallel RAM
• Random-index oblivious RAM
• Multi-client oblivious RAM with poly-logarithmic communication
• Oblivious parallel RAM: improved efficiency and generic constructions
• Delegating RAM computations with adaptive soundness and privacy
• A logarithmic lower bound for oblivious RAM (for all Parameters)
• Asymptotically tight bounds for composing ORAM with PIR
• On the depth of oblivious parallel RAM
• Multi-client Oblivious RAM Secure Against Malicious Servers
• Collusion-resistant functional encryption for RAMs
• Limits of breach-resistant and snapshot-oblivious RAMs
• Cryptography for parallel RAM from indistinguishability obfuscation
• Oblivious parallel tight compaction
• Black-box parallel garbled RAM
• Maliciously secure multi-client ORAM
• Oblivious network RAM and leveraging parallelism to achieve obliviousness
• The oblivious machine. Or: how to put the C into MPC

Describes a project that uses

Uses Software

• GraphSC

This page was built for publication: Oblivious parallel RAM and applications

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