Oblivious network RAM and leveraging parallelism to achieve obliviousness

DOI10.1007/S00145-018-9301-4zbMATH Open1466.94023OpenAlexW2885342792MaRDI QIDQ2318092FDOQ2318092

Authors: Dana Dachman-Soled, Chang Liu, Charalampos Papamanthou, Elaine Shi, Uzi Vishkin 

Publication date: 13 August 2019

Published in: Journal of Cryptology (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00145-018-9301-4

Recommendations

• Oblivious network RAM and leveraging parallelism to achieve obliviousness
• Circuit OPRAM: unifying statistically and computationally secure ORAMs and OPRAMs
• Oblivious parallel RAM: improved efficiency and generic constructions
• Oblivious hashing revisited, and applications to asymptotically efficient ORAM and OPRAM
• Oblivious parallel RAM and applications

zbMATH Keywords

PRAM modeloblivious RAMparallel-computing

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Cryptography (94A60) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10)

Cites Work

• Cuckoo hashing
• More Robust Hashing: Cuckoo Hashing with a Stash
• Chernoff–Hoeffding Bounds for Applications with Limited Independence
• The log-star revolution
• De-amortized Cuckoo Hashing: Provable Worst-Case Performance and Experimental Results
• Title not available (Why is that?)
• Almost \(k\)-wise independence versus \(k\)-wise independence
• Software protection and simulation on oblivious RAMs
• Privacy-preserving access of outsourced data via oblivious RAM simulation
• Oblivious RAM with \(O((\log N)^{3})\) worst-case cost
• Path ORAM
• Title not available (Why is that?)
• Fast parallel space allocation, estimation, and integer sorting
• Oblivious Parallel RAM and Applications
• Optimizing ORAM and Using It Efficiently for Secure Computation
• Statistically-secure ORAM with $\tilde{O}(\log^2 n)$ Overhead
• How to garble RAM programs?
• Garbled RAM Revisited
• Title not available (Why is that?)
• Distributed Oblivious RAM for Secure Two-Party Computation
• Cache-oblivious dictionaries and multimaps with negligible failure probability
• Fast Pseudorandomness for Independence and Load Balancing

Cited In (6)

• Multi-client oblivious RAM with poly-logarithmic communication
• Snapshot-oblivious RAMs: sub-logarithmic efficiency for short transcripts
• On the depth of oblivious parallel RAM
• Multi-client Oblivious RAM Secure Against Malicious Servers
• Path ORAM
• Distributed Oblivious RAM for Secure Two-Party Computation

This page was built for publication: Oblivious network RAM and leveraging parallelism to achieve obliviousness

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