Pages that link to "Item:Q2412887"
From MaRDI portal
The following pages link to Oblivious hashing revisited, and applications to asymptotically efficient ORAM and OPRAM (Q2412887):
Displayed 11 items.
- Perfectly secure oblivious parallel RAM (Q1631354) (← links)
- Parameter-hiding order revealing encryption (Q1633450) (← links)
- More is less: perfectly secure oblivious algorithms in the multi-server setting (Q1710668) (← links)
- Alibi: a flaw in cuckoo-hashing based hierarchical ORAM schemes and a solution (Q2056797) (← links)
- OptORAMa: optimal oblivious RAM (Q2119019) (← links)
- A logarithmic lower bound for oblivious RAM (for all Parameters) (Q2139649) (← links)
- Oblivious RAM with \textit{worst-case} logarithmic overhead (Q2139650) (← links)
- Generalized cuckoo hashing with a stash, revisited (Q2681400) (← links)
- Oblivious RAM with worst-case logarithmic overhead (Q2697677) (← links)
- Snapshot-oblivious RAMs: sub-logarithmic efficiency for short transcripts (Q6111544) (← links)
- \textsf{MacORAMa}: optimal oblivious RAM with integrity (Q6190099) (← links)