Three-party ORAM for secure computation

DOI10.1007/978-3-662-48797-6_16zbMATH Open1396.94076OpenAlexW2296325326MaRDI QIDQ2811139FDOQ2811139

Authors: Sky Faber, Stanislaw Jarecki, Sotirios Kentros, Boyang Wei 

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_16

Recommendations

• 3PC ORAM with low latency, low bandwidth, and fast batch retrieval
• Simple and efficient two-server ORAM
• Optimizing ORAM and Using It Efficiently for Secure Computation
• Efficient 3-party distributed ORAM
• 3-party distributed ORAM from oblivious set membership

zbMATH Keywords

secure computationprivate information retrievaloblivious RAM

Mathematics Subject Classification ID

Cryptography (94A60)

Cited In (9)

• Efficient 3-party distributed ORAM
• 3-party distributed ORAM from oblivious set membership
• Improved building blocks for secure multi-party computation based on secret sharing with honest majority
• 3-party secure computation for RAMs: optimal and concretely efficient
• DORAM revisited: maliciously secure RAM-MPC with logarithmic overhead
• SQL on structurally-encrypted databases
• Simple and efficient two-server ORAM
• 3PC ORAM with low latency, low bandwidth, and fast batch retrieval
• Optimizing ORAM and Using It Efficiently for Secure Computation

This page was built for publication: Three-party ORAM for secure computation

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