Path ORAM: An Extremely Simple Oblivious RAM Protocol
Name
PathORam.pdf
Description
Accepted version
Size
743.05 KB
Format
Adobe PDF
Checksum (MD5)
6ae5ea4ba5c0267ee2dc7da313ce76db
Author(s)
Stefanov, Emil
Dijk, Marten Van
Shi, Elaine
Chan, T-H Hubert
Fletcher, Christopher
Ren, Ling
Yu, Xiangyao
Devadas, Srinivas
Date Issued
2018
Journal
Journal of the ACM
Publisher
Association for Computing Machinery (ACM)
Version
Author's final manuscript
Abstract
© 2018 ACM 0004-5411/2018/04-ART18 $15.00 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 = Ω(log2 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.
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/3177872
