Perfectly secure oblivious RAM with sublinear bandwidth overhead

DOI10.1007/978-3-030-34621-8_19zbMath1455.94188OpenAlexW2989644785MaRDI QIDQ2176664

Michael Raskin, Mark Simkin

Publication date: 5 May 2020

Full work available at URL: https://doi.org/10.1007/978-3-030-34621-8_19

zbMATH Keywords

oblivious RAMstatistically secure ORAM

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (4)

Perfectly secure oblivious parallel RAM ⋮ Parameter-hiding order revealing encryption ⋮ PrORAM ⋮ More is less: perfectly secure oblivious algorithms in the multi-server setting

This page was built for publication: Perfectly secure oblivious RAM with sublinear bandwidth overhead