Path ORAM: An Extremely Simple Oblivious RAM Protocol
Author(s)Stefanov, Emil; van Dijk, Marten; Shi, Elaine; Ren, Ling; Yu, Xiangyao; Devadas, Srinivas; Fletcher, Christopher Wardlaw; ... Show more Show less
MetadataShow full item record
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 for small client storage known to date. We formally prove that Path ORAM requires log^2 N / log X bandwidth overhead for block size B = X log N. For block sizes bigger than Omega(log^2 N), 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.
DepartmentMassachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory
Proceedings of the 2013 ACM SIGSAC conference on Computer & communications security (CCS '13)
Association for Computing Machinery (ACM)
Emil Stefanov, Marten van Dijk, Elaine Shi, Christopher Fletcher, Ling Ren, Xiangyao Yu, and Srinivas Devadas. 2013. Path ORAM: an extremely simple oblivious RAM protocol. In Proceedings of the 2013 ACM SIGSAC conference on Computer & communications security (CCS '13). ACM, New York, NY, USA, 299-310.
Author's final manuscript