Oblivious hashing revisited, and applications to asymptotically efficient ORAM and OPRAM

DOI10.1007/978-3-319-70694-8_23zbMath1420.94048OpenAlexW2769094878MaRDI QIDQ2412887

Elaine Shi, Wei-Kai Lin, T.-H. Hubert Chan, Yue Guo

Publication date: 6 April 2018

Full work available at URL: https://doi.org/10.1007/978-3-319-70694-8_23

zbMATH Keywords

oblivious RAMoblivious PRAM

Mathematics Subject Classification ID

Cryptography (94A60) Data encryption (aspects in computer science) (68P25)

Related Items (11)

Perfectly secure oblivious parallel RAM ⋮ Parameter-hiding order revealing encryption ⋮ A logarithmic lower bound for oblivious RAM (for all Parameters) ⋮ Oblivious RAM with \textit{worst-case} logarithmic overhead ⋮ Generalized cuckoo hashing with a stash, revisited ⋮ Snapshot-oblivious RAMs: sub-logarithmic efficiency for short transcripts ⋮ \textsf{MacORAMa}: optimal oblivious RAM with integrity ⋮ Oblivious RAM with worst-case logarithmic overhead ⋮ More is less: perfectly secure oblivious algorithms in the multi-server setting ⋮ Alibi: a flaw in cuckoo-hashing based hierarchical ORAM schemes and a solution ⋮ OptORAMa: optimal oblivious RAM

This page was built for publication: Oblivious hashing revisited, and applications to asymptotically efficient ORAM and OPRAM