Path ORAM An Extremely Simple Oblivious RAM Protocol

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 si...

Full description

Saved in:
Bibliographic Details
Published inJournal of the ACM Vol. 65; no. 4; pp. 1 - 26
Main Authors Stefanov, Emil, Dijk, Marten Van, Shi, Elaine, Chan, T.-H. Hubert, Fletcher, Christopher, Ren, Ling, Yu, Xiangyao, Devadas, Srinivas
Format Journal Article
LanguageEnglish
Published New York Association for Computing Machinery 01.08.2018
Subjects
Algorithms
Numerical analysis
Protocol
Random access memory
Online AccessGet full text

Cover

More Information
Summary: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 = Ω (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.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:0004-5411
1557-735X
DOI:10.1145/3177872