The following pages link to (Q5743386):
Displayed 18 items.
- Dynamic proofs of retrievability via oblivious RAM (Q514467) (← links)
- Perfectly secure oblivious parallel RAM (Q1631354) (← links)
- Constant-round maliciously secure two-party computation in the RAM model (Q2010585) (← links)
- Alibi: a flaw in cuckoo-hashing based hierarchical ORAM schemes and a solution (Q2056797) (← links)
- OptORAMa: optimal oblivious RAM (Q2119019) (← links)
- Oblivious RAM with \textit{worst-case} logarithmic overhead (Q2139650) (← links)
- Oblivious network RAM and leveraging parallelism to achieve obliviousness (Q2318092) (← links)
- Secret-shared RAM indefinite private and secure RAM execution of perfectly unrevealed programs (Q2687034) (← links)
- Multi-client oblivious RAM with poly-logarithmic communication (Q2692380) (← links)
- Oblivious RAM with worst-case logarithmic overhead (Q2697677) (← links)
- Data-Oblivious Graph Algorithms in Outsourced External Memory (Q2942400) (← links)
- (Q5743386) (← 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)
- The complexity of secure RAMs (Q6057308) (← links)
- 3-party distributed ORAM from oblivious set membership (Q6134831) (← links)
- Lower bound framework for differentially private and oblivious data structures (Q6138099) (← links)
- Limits of breach-resistant and snapshot-oblivious RAMs (Q6190101) (← links)