Oblivious network RAM and leveraging parallelism to achieve obliviousness
From MaRDI portal
(Redirected from Publication:2318092)
Recommendations
- Oblivious network RAM and leveraging parallelism to achieve obliviousness
- Circuit OPRAM: unifying statistically and computationally secure ORAMs and OPRAMs
- Oblivious parallel RAM: improved efficiency and generic constructions
- Oblivious hashing revisited, and applications to asymptotically efficient ORAM and OPRAM
- Oblivious parallel RAM and applications
Cites work
- scientific article; zbMATH DE number 1559545 (Why is no real title available?)
- Almost \(k\)-wise independence versus \(k\)-wise independence
- Cache-oblivious dictionaries and multimaps with negligible failure probability
- Chernoff–Hoeffding Bounds for Applications with Limited Independence
- Cuckoo hashing
- De-amortized Cuckoo Hashing: Provable Worst-Case Performance and Experimental Results
- Distributed Oblivious RAM for Secure Two-Party Computation
- Fast parallel space allocation, estimation, and integer sorting
- Fast pseudorandomness for independence and load balancing (extended abstract)
- Garbled RAM revisited
- How to garble RAM programs?
- More Robust Hashing: Cuckoo Hashing with a Stash
- Oblivious RAM with \(O((\log N)^{3})\) worst-case cost
- Oblivious parallel RAM and applications
- On the (in)security of hash-based oblivious RAM and a new balancing scheme
- Optimizing ORAM and Using It Efficiently for Secure Computation
- Path ORAM
- Privacy-preserving access of outsourced data via oblivious RAM simulation
- Privacy-preserving group data access via stateless oblivious RAM simulation
- Software protection and simulation on oblivious RAMs
- Statistically-secure ORAM with \(\tilde{O}(\log^2 n)\) overhead
- The log-star revolution
Cited in
(9)- Multi-client Oblivious RAM Secure Against Malicious Servers
- On the depth of oblivious parallel RAM
- Circuit OPRAM: unifying statistically and computationally secure ORAMs and OPRAMs
- Path ORAM
- Multi-client oblivious RAM with poly-logarithmic communication
- Oblivious network RAM and leveraging parallelism to achieve obliviousness
- Distributed Oblivious RAM for Secure Two-Party Computation
- Oblivious parallel RAM: improved efficiency and generic constructions
- Snapshot-oblivious RAMs: sub-logarithmic efficiency for short transcripts
This page was built for publication: Oblivious network RAM and leveraging parallelism to achieve obliviousness
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2318092)
