Oblivious parallel RAM: improved efficiency and generic constructions

DOI10.1007/978-3-662-49099-0_8MaRDI QIDQ2799096zbMATH OpenOpenAlexFDO

Authors Binyi Chen, Huijia Lin, Stefano Tessaro

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_8

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• Circuit OPRAM: unifying statistically and computationally secure ORAMs and OPRAMs
• On the depth of oblivious parallel RAM
• Perfectly secure oblivious parallel RAM
• Oblivious network RAM and leveraging parallelism to achieve obliviousness
• Oblivious network RAM and leveraging parallelism to achieve obliviousness

Cites work

• Basics of Applied Stochastic Processes
• Cache-oblivious dictionaries and multimaps with negligible failure probability
• scientific article; zbMATH DE number 4020467 (Why is no real title available?)
• Oblivious parallel RAM and applications
• Oblivious RAM Revisited
• Oblivious RAM with \(O((\log N)^{3})\) worst-case cost
• Optimizing ORAM and Using It Efficiently for Secure Computation
• Privacy-preserving access of outsourced data via oblivious RAM simulation
• Software protection and simulation on oblivious RAMs
• Statistically-secure ORAM with \(\tilde{O}(\log^2 n)\) overhead

Cited in

(19)

• Perfectly secure oblivious parallel RAM
• Circuit OPRAM: unifying statistically and computationally secure ORAMs and OPRAMs
• More is less: perfectly secure oblivious algorithms in the multi-server setting
• Oblivious network RAM and leveraging parallelism to achieve obliviousness
• On the depth of oblivious parallel RAM
• Multi-client oblivious RAM with poly-logarithmic communication
• Oblivious parallel RAM and applications
• Oblivious network RAM and leveraging parallelism to achieve obliviousness
• Delegating RAM computations with adaptive soundness and privacy
• Oblivious RAM Revisited
• Asymptotically tight bounds for composing ORAM with PIR
• Oblivious parallel tight compaction
• Lower bound framework for differentially private and oblivious data structures
• Random-index oblivious RAM
• Limits of breach-resistant and snapshot-oblivious RAMs
• Maliciously secure multi-client ORAM
• Optimal oblivious parallel RAM
• Memory checking for parallel RAMs
• Concurrent encrypted multimaps

This page was built for publication: Oblivious parallel RAM: improved efficiency and generic constructions

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