Efficient 3-party distributed ORAM
From MaRDI portal
Publication:2106641
Recommendations
Cited in
(13)- Two-server distributed ORAM with sublinear computation and constant rounds
- 3-party distributed ORAM from oblivious set membership
- 3-party secure computation for RAMs: optimal and concretely efficient
- DORAM revisited: maliciously secure RAM-MPC with logarithmic overhead
- 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
- 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)