Three-party ORAM for secure computation

DOI10.1007/978-3-662-48797-6_16MaRDI QIDQ2811139zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

oblivious RAMprivate information retrievalsecure computation

Mathematics Subject Classification ID

Cryptography (94A60)

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

Cited in

(13)

• SQL on structurally-encrypted databases
• 3PC ORAM with low latency, low bandwidth, and fast batch retrieval
• Simple and efficient two-server ORAM
• Efficient 3-party distributed ORAM
• Improved building blocks for secure multi-party computation based on secret sharing with honest majority
• Optimizing ORAM and Using It Efficiently for Secure Computation
• 3-party distributed ORAM from oblivious set membership
• DORAM revisited: maliciously secure RAM-MPC with logarithmic overhead
• 3-party secure computation for RAMs: optimal and concretely efficient
• A logarithmic lower bound for oblivious RAM (for all parameters)
• Fast ORAM with server-aided preprocessing and pragmatic privacy-efficiency trade-off
• Multi-server doubly efficient PIR in the classical model and beyond
• MetaDORAM: info-theoretic distributed ORAM with less communication

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)