Path ORAM: An Extremely Simple Oblivious RAM Protocol
Name
Devadas_Path ORAM.pdf
Size
609.62 KB
Format
Adobe PDF
Checksum (MD5)
5bd0aaedfec927ad0f8d12b6f5f5fa9a
Author(s)
Stefanov, Emil
van Dijk, Marten
Shi, Elaine
Ren, Ling
Yu, Xiangyao
Devadas, Srinivas
Fletcher, Christopher Wardlaw
Date Issued
November 2013
Journal
Proceedings of the 2013 ACM SIGSAC conference on Computer & communications security (CCS '13)
Publisher
Association for Computing Machinery (ACM)
Citation
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.
Version
Author's final manuscript
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 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.
MIT Department
Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory
Terms of Use
Creative Commons Attribution-Noncommercial-Share Alike
Persistent DSpace Link
DOI of Published Version
https://doi.org/10.1145/2508859.2516660
