Pages that link to "Item:Q1710667"
From MaRDI portal
The following pages link to Simple and efficient two-server ORAM (Q1710667):
Displaying 15 items.
- Parameter-hiding order revealing encryption (Q1633450) (← links)
- 3PC ORAM with low latency, low bandwidth, and fast batch retrieval (Q1656051) (← links)
- More is less: perfectly secure oblivious algorithms in the multi-server setting (Q1710668) (← links)
- Two-server distributed ORAM with sublinear computation and constant rounds (Q2061970) (← links)
- Efficient 3-party distributed ORAM (Q2106641) (← links)
- Three-Party ORAM for Secure Computation (Q2811139) (← links)
- Succinct oblivious RAM (Q3304151) (← links)
- CNF-FSS and Its Applications (Q5087261) (← links)
- Is there an oblivious RAM lower bound for online reads? (Q5915623) (← links)
- Is there an oblivious RAM lower bound for online reads? (Q5918328) (← links)
- PrORAM (Q6041295) (← links)
- 3-party distributed ORAM from oblivious set membership (Q6134831) (← links)
- Random-index oblivious RAM (Q6169549) (← links)
- Maliciously Secure Multi-Client ORAM (Q6487223) (← links)
- DORAM revisited: maliciously secure RAM-MPC with logarithmic overhead (Q6581801) (← links)