Oblivious RAM with worst-case logarithmic overhead
From MaRDI portal
Publication:2697677
DOI10.1007/s00145-023-09447-5OpenAlexW3202558991MaRDI QIDQ2697677
Wei-Kai Lin, Elaine Shi, Gilad Asharov, Ilan Komargodski
Publication date: 13 April 2023
Published in: Journal of Cryptology (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00145-023-09447-5
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Surpassing the information theoretic bound with fusion trees
- Perfectly secure oblivious parallel RAM
- Circuit OPRAM: unifying statistically and computationally secure ORAMs and OPRAMs
- Yes, there is an oblivious RAM lower bound!
- Alibi: a flaw in cuckoo-hashing based hierarchical ORAM schemes and a solution
- Oblivious tight compaction in \(O(n)\) time with smaller constant
- OptORAMa: optimal oblivious RAM
- A logarithmic lower bound for oblivious RAM (for all Parameters)
- Oblivious RAM with \textit{worst-case} logarithmic overhead
- 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
- Privacy-Preserving Access of Outsourced Data via Oblivious RAM Simulation
- Oblivious RAM with O((logN)3) Worst-Case Cost
- Software protection and simulation on oblivious RAMs
- Randomized Sorting in O(nloglogn) Time and Linear Space Using Addition, Shift, and Bit-wise Boolean Operations
- Cuckoo hashing
- Distributed Oblivious RAM for Secure Two-Party Computation
- Universally Composable Security
- More Robust Hashing: Cuckoo Hashing with a Stash
This page was built for publication: Oblivious RAM with worst-case logarithmic overhead
