Oblivious parallel RAM and applications
From MaRDI portal
Recommendations
Cites work
- Distributed Oblivious RAM for Secure Two-Party Computation
- Garbled RAM from one-way functions
- Garbled RAM revisited
- How to run Turing machines on encrypted data
- scientific article; zbMATH DE number 1559545 (Why is no real title available?)
- Indistinguishability obfuscation for Turing machines with unbounded memory
- Large-Scale Secure Computation: Multi-party Computation for (Parallel) RAM Programs
- Oblivious parallel RAM: improved efficiency and generic constructions
- Oblivious RAM with \(O((\log N)^{3})\) worst-case cost
- Oblivious RAMs without cryptogarphic assumptions
- Optimizing ORAM and Using It Efficiently for Secure Computation
- Perfectly secure oblivious RAM without random oracles
- Privacy-preserving access of outsourced data via oblivious RAM simulation
- Relations Among Complexity Measures
- Software protection and simulation on oblivious RAMs
- Sorting in Average Time o(\log \,n)
- Statistically-secure ORAM with \(\tilde{O}(\log^2 n)\) overhead
- Succinct garbling and indistinguishability obfuscation for RAM programs
- Succinct randomized encodings and their applications
Cited in
(26)- Perfectly secure oblivious parallel RAM
- Black-box parallel garbled RAM
- A logarithmic lower bound for oblivious RAM (for all Parameters)
- Adaptively secure garbling schemes for parallel computations
- The oblivious machine. Or: how to put the C into MPC
- Oblivious network RAM and leveraging parallelism to achieve obliviousness
- On the depth of oblivious parallel RAM
- Multi-client oblivious RAM with poly-logarithmic communication
- Oblivious parallel RAM: improved efficiency and generic constructions
- Cryptography for parallel RAM from indistinguishability obfuscation
- Oblivious network RAM and leveraging parallelism to achieve obliviousness
- Delegating RAM computations with adaptive soundness and privacy
- Oblivious RAM Revisited
- Asymptotically tight bounds for composing ORAM with PIR
- Oblivious parallel tight compaction
- Collusion-resistant functional encryption for RAMs
- Lower bound framework for differentially private and oblivious data structures
- Random-index oblivious RAM
- Limits of breach-resistant and snapshot-oblivious RAMs
- Maliciously secure multi-client ORAM
- Multi-client Oblivious RAM Secure Against Malicious Servers
- Memory checking for parallel RAMs
- Efficient permutation correlations and batched random access for two-party computation
- Concurrent encrypted multimaps
- A logarithmic lower bound for oblivious RAM (for all parameters)
- Resizable oblivious RAM
This page was built for publication: Oblivious parallel RAM and applications
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2799095)
