OptORAMa: Optimal oblivious RAM
From MaRDI portal
Publication:6567264
DOI10.1145/3566049MaRDI QIDQ6567264FDOQ6567264
Authors: Gilad Asharov, Ilan Komargodski, Wei-Kai Lin, Kartik Nayak, Enoch Peserico, Elaine Shi 
Publication date: 4 July 2024
Published in: Journal of the ACM (Search for Journal in Brave)
Cites Work
- Introduction to algorithms.
- Computational Complexity
- A Pseudorandom Generator from any One-way Function
- Security and composition of multiparty cryptographic protocols
- Cuckoo hashing
- Foundations of Cryptography
- Superconcentrators
- Explicit constructions of linear-sized superconcentrators
- Title not available (Why is that?)
- Expanders obtained from affine transformations
- Title not available (Why is that?)
- Software protection and simulation on oblivious RAMs
- Title not available (Why is that?)
- Privacy-preserving access of outsourced data via oblivious RAM simulation
- More robust hashing: cuckoo hashing with a stash
- Oblivious RAM with \(O((\log N)^{3})\) worst-case cost
- Privacy-preserving group data access via stateless oblivious RAM simulation
- Title not available (Why is that?)
- Graph-theoretic properties in computational complexity
- Title not available (Why is that?)
- On-Line Algorithms for Path Selection in a Nonblocking Network
- Title not available (Why is that?)
- Improved nonconservative sequential and parallel integer sorting
- On probabilistic networks for selection, merging, and sorting
- Perfectly secure oblivious parallel RAM
- Circuit OPRAM: unifying statistically and computationally secure ORAMs and OPRAMs
- Oblivious hashing revisited, and applications to asymptotically efficient ORAM and OPRAM
- Statistically-secure ORAM with \(\tilde{O}(\log^2 n)\) overhead
- Perfectly secure oblivious RAM without random oracles
- On the (in)security of hash-based oblivious RAM and a new balancing scheme
- Cache-oblivious and data-oblivious sorting and applications
- Distributed Oblivious RAM for Secure Two-Party Computation
- CacheShuffle: a family of oblivious shuffles
- Yes, there is an oblivious RAM lower bound!
- Self-routing superconcentrators
- Private database access with HE-over-ORAM architecture
- Alibi: a flaw in cuckoo-hashing based hierarchical ORAM schemes and a solution
- Data-oblivious data structures
- Is there an oblivious RAM lower bound?
- Internal DLA: efficient simulation of a physical growth model (extended abstract)
- Lower bounds for external memory integer sorting via network coding
- Zig-zag sort
- Exact sublinear binomial sampling
Cited In (1)
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)
