Pages that link to "Item:Q2106641"
From MaRDI portal
The following pages link to Efficient 3-party distributed ORAM (Q2106641):
Displaying 13 items.
- 3PC ORAM with low latency, low bandwidth, and fast batch retrieval (Q1656051) (← links)
- Simple and efficient two-server ORAM (Q1710667) (← links)
- Masked triples. Amortizing multiplication triples across conditionals (Q2061960) (← links)
- Two-server distributed ORAM with sublinear computation and constant rounds (Q2061970) (← links)
- Multi-client oblivious RAM with poly-logarithmic communication (Q2692380) (← links)
- Three-Party ORAM for Secure Computation (Q2811139) (← links)
- Low-Communication Multiparty Triple Generation for SPDZ from Ring-LPN (Q5087258) (← links)
- CNF-FSS and Its Applications (Q5087261) (← links)
- 3-party distributed ORAM from oblivious set membership (Q6134831) (← links)
- Explicit and nearly tight lower bound for 2-party perfectly secure FSS (Q6535135) (← links)
- DORAM revisited: maliciously secure RAM-MPC with logarithmic overhead (Q6581801) (← links)
- 3-party secure computation for RAMs: optimal and concretely efficient (Q6581802) (← links)
- Privacy-preserving Dijkstra (Q6653041) (← links)