OptORAMa: Optimal oblivious RAM
From MaRDI portal
Publication:6567264
DOI10.1145/3566049MaRDI QIDQ6567264
Kartik Nayak, Ilan Komargodski, Elaine Shi, Gilad Asharov, Enoch Peserico, Wei-Kai Lin
Publication date: 4 July 2024
Published in: (Search for Journal in Brave)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Improved nonconservative sequential and parallel integer sorting
- Expanders obtained from affine transformations
- Explicit constructions of linear-sized superconcentrators
- Graph-theoretic properties in computational complexity
- On probabilistic networks for selection, merging, and sorting
- Perfectly secure oblivious parallel RAM
- Circuit OPRAM: unifying statistically and computationally secure ORAMs and OPRAMs
- Yes, there is an oblivious RAM lower bound!
- Self-routing superconcentrators
- Security and composition of multiparty cryptographic protocols
- Alibi: a flaw in cuckoo-hashing based hierarchical ORAM schemes and a solution
- Oblivious hashing revisited, and applications to asymptotically efficient ORAM and OPRAM
- Private Database Access with HE-over-ORAM Architecture
- Is there an oblivious RAM lower bound?
- Statistically-secure ORAM with $\tilde{O}(\log^2 n)$ Overhead
- Data-Oblivious Data Structures
- Perfectly Secure Oblivious RAM without Random Oracles
- Privacy-Preserving Access of Outsourced Data via Oblivious RAM Simulation
- Oblivious RAM with O((logN)3) Worst-Case Cost
- Superconcentrators
- A Pseudorandom Generator from any One-way Function
- Software protection and simulation on oblivious RAMs
- Cuckoo hashing
- Foundations of Cryptography
- On-Line Algorithms for Path Selection in a Nonblocking Network
- Distributed Oblivious RAM for Secure Two-Party Computation
- Internal DLA: Efficient Simulation of a Physical Growth Model
- Lower bounds for external memory integer sorting via network coding
- Zig-zag sort
- Computational Complexity
- More Robust Hashing: Cuckoo Hashing with a Stash
- Exact sublinear binomial sampling
Related Items (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)
