Path ORAM

DOI10.1145/3177872zbMath1426.68008arXiv1202.5150OpenAlexW2796933658MaRDI QIDQ4561506

Elaine Shi, T.-H. Hubert Chan, Srinivas Devadas, Xiangyao Yu, Christopher W. Fletcher, Marten van Dijk, Ling Ren, Emil Stefanov

Publication date: 6 December 2018

Published in: Journal of the ACM (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1202.5150

zbMATH Keywords

oblivious RAMORAMaccess patternpath ORAM

Mathematics Subject Classification ID

Mathematical problems of computer architecture (68M07)

Related Items (18)

Perfectly secure oblivious parallel RAM ⋮ Parameter-hiding order revealing encryption ⋮ A logarithmic lower bound for oblivious RAM (for all Parameters) ⋮ Stronger lower bounds for online ORAM ⋮ Data-Oblivious Graph Algorithms in Outsourced External Memory ⋮ Snapshot-oblivious RAMs: sub-logarithmic efficiency for short transcripts ⋮ 3-party distributed ORAM from oblivious set membership ⋮ NanoGRAM: garbled RAM with \(\widetilde{O}(\log N)\) overhead ⋮ PAC privacy: automatic privacy measurement and control of data processing ⋮ \textsf{MacORAMa}: optimal oblivious RAM with integrity ⋮ More is less: perfectly secure oblivious algorithms in the multi-server setting ⋮ Dynamic proofs of retrievability via oblivious RAM ⋮ Constant-round maliciously secure two-party computation in the RAM model ⋮ Is there an oblivious RAM lower bound for online reads? ⋮ Private Database Access with HE-over-ORAM Architecture ⋮ Locality-preserving oblivious RAM ⋮ Structured encryption and dynamic leakage suppression ⋮ Oblivious network RAM and leveraging parallelism to achieve obliviousness

This page was built for publication: Path ORAM