Oblivious network RAM and leveraging parallelism to achieve obliviousness

DOI10.1007/978-3-662-48797-6_15zbMATH Open1396.94071OpenAlexW2255046487MaRDI QIDQ2811137FDOQ2811137

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

Publication date: 10 June 2016

Published in: Advances in Cryptology -- ASIACRYPT 2015 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-662-48797-6_15

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

Mathematics Subject Classification ID

Cryptography (94A60)

Cited In (7)

• 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
• 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 Q2811137)