The following pages link to Data-Oblivious Data Structures (Q2965516):
Displaying 10 items.
- Alibi: a flaw in cuckoo-hashing based hierarchical ORAM schemes and a solution (Q2056797) (← links)
- Oblivious tight compaction in \(O(n)\) time with smaller constant (Q2106644) (← links)
- OptORAMa: optimal oblivious RAM (Q2119019) (← links)
- Codeless Data Structures and Algorithms (Q4998421) (← links)
- Sorting Short Keys in Circuits of Size ${o(n \log n)}$ (Q5080485) (← links)
- Anti-persistence (Q5176007) (← links)
- Asymptotically Tight Bounds for Composing ORAM with PIR (Q5738784) (← links)
- 3-party distributed ORAM from oblivious set membership (Q6134831) (← links)
- OptORAMa: Optimal oblivious RAM (Q6567264) (← links)
- DORAM revisited: maliciously secure RAM-MPC with logarithmic overhead (Q6581801) (← links)