Circuit OPRAM: unifying statistically and computationally secure ORAMs and OPRAMs

DOI10.1007/978-3-319-70503-3_3zbMath1416.68015OpenAlexW2766170121MaRDI QIDQ1690263

Elaine Shi, T.-H. Hubert Chan

Publication date: 19 January 2018

Full work available at URL: https://doi.org/10.1007/978-3-319-70503-3_3

zbMATH Keywords

oblivious RAMoblivious parallel RAMstatistical and computational security

Mathematics Subject Classification ID

Cryptography (94A60) Parallel algorithms in computer science (68W10) Mathematical problems of computer architecture (68M07) Randomized algorithms (68W20)

Related Items (9)

Perfectly secure oblivious parallel RAM ⋮ Parameter-hiding order revealing encryption ⋮ Oblivious RAM with \textit{worst-case} logarithmic overhead ⋮ NanoGRAM: garbled RAM with \(\widetilde{O}(\log N)\) overhead ⋮ Oblivious RAM with worst-case logarithmic overhead ⋮ More is less: perfectly secure oblivious algorithms in the multi-server setting ⋮ Constant-round maliciously secure two-party computation in the RAM model ⋮ Locality-preserving oblivious RAM ⋮ OptORAMa: optimal oblivious RAM

This page was built for publication: Circuit OPRAM: unifying statistically and computationally secure ORAMs and OPRAMs