Recommendations
Cites work
- scientific article; zbMATH DE number 3757704 (Why is no real title available?)
- scientific article; zbMATH DE number 3487716 (Why is no real title available?)
- scientific article; zbMATH DE number 1263219 (Why is no real title available?)
- scientific article; zbMATH DE number 1559545 (Why is no real title available?)
- scientific article; zbMATH DE number 4187086 (Why is no real title available?)
- scientific article; zbMATH DE number 3045028 (Why is no real title available?)
- A Pseudorandom Generator from any One-way Function
- Alibi: a flaw in cuckoo-hashing based hierarchical ORAM schemes and a solution
- Cache-oblivious and data-oblivious sorting and applications
- CacheShuffle: a family of oblivious shuffles
- Circuit OPRAM: unifying statistically and computationally secure ORAMs and OPRAMs
- Computational Complexity
- Cuckoo hashing
- Data-oblivious data structures
- Distributed Oblivious RAM for Secure Two-Party Computation
- Exact sublinear binomial sampling
- Expanders obtained from affine transformations
- Explicit constructions of linear-sized superconcentrators
- Foundations of Cryptography
- Graph-theoretic properties in computational complexity
- Improved nonconservative sequential and parallel integer sorting
- Internal DLA: efficient simulation of a physical growth model (extended abstract)
- Introduction to algorithms.
- Is there an oblivious RAM lower bound?
- Lower bounds for external memory integer sorting via network coding
- More robust hashing: cuckoo hashing with a stash
- Oblivious RAM with \(O((\log N)^{3})\) worst-case cost
- Oblivious hashing revisited, and applications to asymptotically efficient ORAM and OPRAM
- On probabilistic networks for selection, merging, and sorting
- On the (in)security of hash-based oblivious RAM and a new balancing scheme
- On-Line Algorithms for Path Selection in a Nonblocking Network
- Perfectly secure oblivious RAM without random oracles
- Perfectly secure oblivious parallel RAM
- Privacy-preserving access of outsourced data via oblivious RAM simulation
- Privacy-preserving group data access via stateless oblivious RAM simulation
- Private database access with HE-over-ORAM architecture
- Security and composition of multiparty cryptographic protocols
- Self-routing superconcentrators
- Software protection and simulation on oblivious RAMs
- Statistically-secure ORAM with \(\tilde{O}(\log^2 n)\) overhead
- Superconcentrators
- Yes, there is an oblivious RAM lower bound!
- Zig-zag sort
Cited in
(7)- Memory checking requires logarithmic overhead
- Optimal oblivious parallel RAM
- A logarithmic lower bound for oblivious RAM (for all parameters)
- \textsf{MacORAMa}: optimal oblivious RAM with integrity
- \textsf{PicoGRAM}: practical garbled RAM from decisional Diffie-Hellman
- Privacy-preserving Dijkstra
- Optimal offline ORAM with perfect security via simple oblivious priority queues
This page was built for publication: OptORAMa: Optimal oblivious RAM
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6567264)
