Circuit OPRAM: unifying statistically and computationally secure ORAMs and OPRAMs
From MaRDI portal
Recommendations
Cited in
(20)- Parameter-hiding order revealing encryption
- Oblivious RAM with \textit{worst-case} logarithmic overhead
- Cryptography for parallel RAM from indistinguishability obfuscation
- Perfectly secure oblivious parallel RAM
- Oblivious network RAM and leveraging parallelism to achieve obliviousness
- 3-party secure computation for RAMs: optimal and concretely efficient
- Memory checking for parallel RAMs
- Optimal oblivious parallel RAM
- Oblivious RAM with worst-case logarithmic overhead
- Optimizing ORAM and Using It Efficiently for Secure Computation
- NanoGRAM: garbled RAM with \(\widetilde{O}(\log N)\) overhead
- Oblivious network RAM and leveraging parallelism to achieve obliviousness
- OptORAMa: Optimal oblivious RAM
- OptORAMa: optimal oblivious RAM
- More is less: perfectly secure oblivious algorithms in the multi-server setting
- Constant-round maliciously secure two-party computation in the RAM model
- Oblivious parallel RAM and applications
- Oblivious parallel RAM: improved efficiency and generic constructions
- Locality-preserving oblivious RAM
- CRAFT: \underline{C}omposable \underline{R}andomness beacons and output-independent \underline{A}bort MPC \underline{F}rom \underline{T}ime
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)