Circuit OPRAM: unifying statistically and computationally secure ORAMs and OPRAMs
From MaRDI portal
Publication:1690263
DOI10.1007/978-3-319-70503-3_3zbMATH Open1416.68015OpenAlexW2766170121MaRDI QIDQ1690263FDOQ1690263
Authors: T.-H. Hubert Chan, Elaine Shi 
Publication date: 19 January 2018
Full work available at URL: https://doi.org/10.1007/978-3-319-70503-3_3
Recommendations
Randomized algorithms (68W20) Cryptography (94A60) Parallel algorithms in computer science (68W10) Mathematical problems of computer architecture (68M07)
Cited In (20)
- Oblivious network RAM and leveraging parallelism to achieve obliviousness
- OptORAMa: optimal oblivious RAM
- NanoGRAM: garbled RAM with \(\widetilde{O}(\log N)\) overhead
- OptORAMa: Optimal oblivious RAM
- Optimal oblivious parallel RAM
- 3-party secure computation for RAMs: optimal and concretely efficient
- Memory checking for parallel RAMs
- Constant-round maliciously secure two-party computation in the RAM model
- Perfectly secure oblivious parallel RAM
- Oblivious parallel RAM and applications
- Oblivious parallel RAM: improved efficiency and generic constructions
- Parameter-hiding order revealing encryption
- Oblivious RAM with \textit{worst-case} logarithmic overhead
- CRAFT: \underline{C}omposable \underline{R}andomness beacons and output-independent \underline{A}bort MPC \underline{F}rom \underline{T}ime
- Cryptography for parallel RAM from indistinguishability obfuscation
- Optimizing ORAM and Using It Efficiently for Secure Computation
- Locality-preserving oblivious RAM
- More is less: perfectly secure oblivious algorithms in the multi-server setting
- Oblivious network RAM and leveraging parallelism to achieve obliviousness
- Oblivious RAM with worst-case logarithmic overhead
This page was built for publication: Circuit OPRAM: unifying statistically and computationally secure ORAMs and OPRAMs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1690263)
