Pages that link to "Item:Q1690263"
From MaRDI portal
The following pages link to Circuit OPRAM: unifying statistically and computationally secure ORAMs and OPRAMs (Q1690263):
Displaying 15 items.
- Perfectly secure oblivious parallel RAM (Q1631354) (← links)
- Parameter-hiding order revealing encryption (Q1633450) (← links)
- More is less: perfectly secure oblivious algorithms in the multi-server setting (Q1710668) (← links)
- Constant-round maliciously secure two-party computation in the RAM model (Q2010585) (← links)
- OptORAMa: optimal oblivious RAM (Q2119019) (← links)
- Oblivious RAM with \textit{worst-case} logarithmic overhead (Q2139650) (← links)
- Oblivious network RAM and leveraging parallelism to achieve obliviousness (Q2318092) (← links)
- Oblivious RAM with worst-case logarithmic overhead (Q2697677) (← links)
- Cryptography for parallel RAM from indistinguishability obfuscation (Q2800564) (← links)
- Optimizing ORAM and Using It Efficiently for Secure Computation (Q2876659) (← links)
- Locality-preserving oblivious RAM (Q5925543) (← links)
- CRAFT: \underline{C}omposable \underline{R}andomness beacons and output-independent \underline{A}bort MPC \underline{F}rom \underline{T}ime (Q6070771) (← links)
- OptORAMa: Optimal oblivious RAM (Q6567264) (← links)
- 3-party secure computation for RAMs: optimal and concretely efficient (Q6581802) (← links)
- Memory checking for parallel RAMs (Q6582183) (← links)