Oblivious RAM with \textit{worst-case} logarithmic overhead
From MaRDI portal
Publication:2139650
DOI10.1007/978-3-030-84259-8_21zbMath1489.94084OpenAlexW3189270234MaRDI QIDQ2139650
Elaine Shi, Ilan Komargodski, Gilad Asharov, Wei-Kai Lin
Publication date: 18 May 2022
Full work available at URL: https://doi.org/10.1007/978-3-030-84259-8_21
Related Items (3)
Snapshot-oblivious RAMs: sub-logarithmic efficiency for short transcripts ⋮ Limits of breach-resistant and snapshot-oblivious RAMs ⋮ Oblivious RAM with worst-case logarithmic overhead
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Sorting in \(c \log n\) parallel steps
- 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!
- Oblivious tight compaction in \(O(n)\) time with smaller constant
- OptORAMa: optimal oblivious RAM
- 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
- Distributed Oblivious RAM for Secure Two-Party Computation
This page was built for publication: Oblivious RAM with \textit{worst-case} logarithmic overhead
