Statistically-secure ORAM with $\tilde{O}(\log^2 n)$ Overhead
From MaRDI portal
Publication:2936600
DOI10.1007/978-3-662-45608-8_4zbMath1317.94097arXiv1307.3699OpenAlexW2964030750MaRDI QIDQ2936600
Zhenming Liu, Rafael Pass, Kai-Min Chung
Publication date: 6 January 2015
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1307.3699
Related Items (15)
Perfectly secure oblivious parallel RAM ⋮ Parameter-hiding order revealing encryption ⋮ Oblivious RAM with \textit{worst-case} logarithmic overhead ⋮ Unnamed Item ⋮ Stronger lower bounds for online ORAM ⋮ Snapshot-oblivious RAMs: sub-logarithmic efficiency for short transcripts ⋮ Lower bound framework for differentially private and oblivious data structures ⋮ Oblivious RAM with worst-case logarithmic overhead ⋮ More is less: perfectly secure oblivious algorithms in the multi-server setting ⋮ Asymptotically Tight Bounds for Composing ORAM with PIR ⋮ Oblivious Parallel RAM and Applications ⋮ Oblivious Parallel RAM: Improved Efficiency and Generic Constructions ⋮ Information-Theoretic Local Non-malleable Codes and Their Applications ⋮ Locality-preserving oblivious RAM ⋮ Oblivious network RAM and leveraging parallelism to achieve obliviousness
This page was built for publication: Statistically-secure ORAM with $\tilde{O}(\log^2 n)$ Overhead
