You are looking at a specific version 20130516:132830 of this paper.
See the latest version.
Paper 2013/280
Path ORAM: An Extremely Simple Oblivious RAM Protocol
Emil Stefanov and Marten van Dijk and Elaine Shi and Christopher Fletcher and Ling Ren and Xiangyao Yu and Srinivas Devadas
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. We formally prove that Path ORAM requires O(log^2 N / k) bandwidth overhead for block size B = k * log N. For block sizes bigger than O(log^2 N) bits, Path ORAM is asymptotically better than the best known ORAM scheme with small client storage. Due to its practicality, Path ORAM has been adopted in the design of secure processors since its proposal.
Metadata
- Available format(s)
- Category
- Cryptographic protocols
- Publication info
- Published elsewhere. Unknown where it was published
- Keywords
- oblivious ramoramprivacystorageaccess patterns
- Contact author(s)
- emil @ cs berkeley edu
- History
- 2014-01-14: revised
- 2013-05-16: received
- See all versions
- Short URL
- https://ia.cr/2013/280
- License
-
CC BY