Perfectly secure oblivious parallel RAM
From MaRDI portal
Publication:1631354
DOI10.1007/978-3-030-03810-6_23zbMath1430.94063OpenAlexW2805139627MaRDI QIDQ1631354
Kartik Nayak, Elaine Shi, T.-H. Hubert Chan
Publication date: 6 December 2018
Full work available at URL: https://doi.org/10.1007/978-3-030-03810-6_23
Cryptography (94A60) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items (10)
Perfectly secure oblivious parallel RAM ⋮ Parameter-hiding order revealing encryption ⋮ Oblivious RAM with \textit{worst-case} logarithmic overhead ⋮ Klee's measure problem made oblivious ⋮ NanoGRAM: garbled RAM with \(\widetilde{O}(\log N)\) overhead ⋮ \textsf{MacORAMa}: optimal oblivious RAM with integrity ⋮ Oblivious RAM with worst-case logarithmic overhead ⋮ More is less: perfectly secure oblivious algorithms in the multi-server setting ⋮ Locality-preserving oblivious RAM ⋮ OptORAMa: optimal oblivious RAM
Cites Work
- Unnamed Item
- Unnamed Item
- Sorting in \(c \log n\) parallel steps
- Perfectly secure oblivious parallel RAM
- Searchable encryption with optimal locality: achieving sublogarithmic read efficiency
- Circuit OPRAM: unifying statistically and computationally secure ORAMs and OPRAMs
- Perfectly secure oblivious RAM with sublinear bandwidth overhead
- On the depth of oblivious parallel RAM
- Oblivious hashing revisited, and applications to asymptotically efficient ORAM and OPRAM
- Oblivious Parallel RAM and Applications
- Oblivious Parallel RAM: Improved Efficiency and Generic Constructions
- Oblivious RAMs without cryptogrpahic assumptions
- Optimizing ORAM and Using It Efficiently for Secure Computation
- Statistically-secure ORAM with $\tilde{O}(\log^2 n)$ Overhead
- Perfectly Secure Oblivious RAM without Random Oracles
- Efficient Non-interactive Secure Computation
- Privacy-Preserving Access of Outsourced Data via Oblivious RAM Simulation
- Oblivious RAM with O((logN)3) Worst-Case Cost
- Binary AMD Circuits from Secure Multiparty Computation
- Large-Scale Secure Computation: Multi-party Computation for (Parallel) RAM Programs
- Software protection and simulation on oblivious RAMs
- Path ORAM
- Self-routing superconcentrators
- Locality-preserving oblivious RAM
This page was built for publication: Perfectly secure oblivious parallel RAM