Sub-logarithmic distributed oblivious RAM with small block size

DOI10.1007/978-3-030-17253-4_1zbMath1465.94075arXiv1802.05145OpenAlexW2963152786MaRDI QIDQ2289203

Eyal Kushilevitz, Tamer Mour

Publication date: 28 January 2020

Full work available at URL: https://arxiv.org/abs/1802.05145

zbMATH Keywords

secure computationoblivious RAMmulti-server settingprivate storage

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (8)

Parameter-hiding order revealing encryption ⋮ CNF-FSS and Its Applications ⋮ 3-party distributed ORAM from oblivious set membership ⋮ More is less: perfectly secure oblivious algorithms in the multi-server setting ⋮ Is there an oblivious RAM lower bound for online reads? ⋮ Is there an oblivious RAM lower bound for online reads? ⋮ Alibi: a flaw in cuckoo-hashing based hierarchical ORAM schemes and a solution ⋮ Two-server distributed ORAM with sublinear computation and constant rounds

This page was built for publication: Sub-logarithmic distributed oblivious RAM with small block size