The following pages link to OptORAMa: optimal oblivious RAM (Q2119019):
Displaying 23 items.
- Simple and efficient two-server ORAM (Q1710667) (← links)
- Alibi: a flaw in cuckoo-hashing based hierarchical ORAM schemes and a solution (Q2056797) (← links)
- Two-server distributed ORAM with sublinear computation and constant rounds (Q2061970) (← links)
- Lower bounds for encrypted multi-maps and searchable encryption in the leakage cell probe model (Q2096495) (← links)
- A logarithmic lower bound for oblivious RAM (for all Parameters) (Q2139649) (← links)
- Oblivious RAM with \textit{worst-case} logarithmic overhead (Q2139650) (← links)
- Stronger lower bounds for online ORAM (Q2175940) (← links)
- On the depth of oblivious parallel RAM (Q2412885) (← links)
- Oblivious RAM with worst-case logarithmic overhead (Q2697677) (← links)
- Forward secret encrypted RAM: lower bounds and applications (Q2697886) (← links)
- Optimizing ORAM and Using It Efficiently for Secure Computation (Q2876659) (← links)
- Oblivious RAM Revisited (Q3582774) (← links)
- Path ORAM (Q4561506) (← links)
- Sorting Short Keys in Circuits of Size ${o(n \log n)}$ (Q5080485) (← links)
- Is there an oblivious RAM lower bound for online reads? (Q5918328) (← links)
- Locality-preserving oblivious RAM (Q5925543) (← links)
- PrORAM (Q6041295) (← links)
- Snapshot-oblivious RAMs: sub-logarithmic efficiency for short transcripts (Q6111544) (← links)
- 3-party distributed ORAM from oblivious set membership (Q6134831) (← links)
- Random-index oblivious RAM (Q6169549) (← links)
- DORAM revisited: maliciously secure RAM-MPC with logarithmic overhead (Q6581801) (← links)
- 3-party secure computation for RAMs: optimal and concretely efficient (Q6581802) (← links)
- Memory checking for parallel RAMs (Q6582183) (← links)
