Efficient 3-party distributed ORAM

DOI10.1007/978-3-030-57990-6_11MaRDI QIDQ2106641zbMATH OpenOpenAlexFDO

Authors Paul Bunn, Eyal Kushilevitz, Rafail Ostrovsky, Jonathan Katz

Publication date 16 December 2022

Full work available at URL https://doi.org/10.1007/978-3-030-57990-6_11

zbMATH Keywords

secure multiparty computationoblivious RAMdistributed computationfunction secret sharing3-party DORAM protocol

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• 3-party distributed ORAM from oblivious set membership
• Two-server distributed ORAM with sublinear computation and constant rounds
• Sub-logarithmic distributed oblivious RAM with small block size
• Three-party ORAM for secure computation
• Simple and efficient two-server ORAM

Cited in

(17)

• Two-server distributed ORAM with sublinear computation and constant rounds
• 3-party distributed ORAM from oblivious set membership
• A logarithmic lower bound for oblivious RAM (for all parameters)
• 3-party secure computation for RAMs: optimal and concretely efficient
• DORAM revisited: maliciously secure RAM-MPC with logarithmic overhead
• Fast ORAM with server-aided preprocessing and pragmatic privacy-efficiency trade-off
• Multi-client oblivious RAM with poly-logarithmic communication
• Simple and efficient two-server ORAM
• Three-party ORAM for secure computation
• 3PC ORAM with low latency, low bandwidth, and fast batch retrieval
• Low-communication multiparty triple generation for SPDZ from ring-LPN
• CNF-FSS and its applications
• Row reduction techniques for n-party garbling
• Multiparty distributed point functions
• Masked triples. Amortizing multiplication triples across conditionals
• Privacy-preserving Dijkstra
• Explicit and nearly tight lower bound for 2-party perfectly secure FSS

This page was built for publication: Efficient 3-party distributed ORAM

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