Path ORAM: An Extremely Simple Oblivious RAM Protocol
Emil Stefanov, Marten van Dijk, Elaine Shi, T-H. Hubert Chan,, Christopher Fletcher, Ling Ren, Xiangyao Yu, Srinivas Devadas

TL;DR
Path ORAM is a simple, practical Oblivious RAM protocol with low client storage and logarithmic bandwidth overhead, making it suitable for secure processor design.
Contribution
It introduces Path ORAM, the simplest and most practical ORAM scheme with formal proofs of efficiency and widespread adoption in secure hardware.
Findings
Achieves O(log N) bandwidth cost for blocks of size Omega(log^2 N) bits
Outperforms previous small-client-storage ORAM schemes asymptotically
Has been adopted in secure processor architectures
Abstract
We present Path ORAM, an extremely simple Oblivious RAM protocol with a small amount of client storage. Partly due to its simplicity, Path ORAM is the most practical ORAM scheme known to date with small client storage. We formally prove that Path ORAM has a O(log N) bandwidth cost for blocks of size B = Omega(log^2 N) bits. For such block sizes, Path ORAM is asymptotically better than the best known ORAM schemes with small client storage. Due to its practicality, Path ORAM has been adopted in the design of secure processors since its proposal.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsCryptography and Data Security · Distributed systems and fault tolerance · DNA and Biological Computing
