Path ORAM: An Extremely Simple Oblivious RAM Protocol
© 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...
| Main Authors: | , , , , , , , |
|---|---|
| Other Authors: | |
| Format: | Article |
| Language: | English |
| Published: |
Association for Computing Machinery (ACM)
2021
|
| Online Access: | https://hdl.handle.net/1721.1/135810 |
| _version_ | 1811081122257305600 |
|---|---|
| author | Stefanov, Emil Dijk, Marten Van Shi, Elaine Chan, T-H Hubert Fletcher, Christopher Ren, Ling Yu, Xiangyao Devadas, Srinivas |
| author2 | Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory |
| author_facet | Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory Stefanov, Emil Dijk, Marten Van Shi, Elaine Chan, T-H Hubert Fletcher, Christopher Ren, Ling Yu, Xiangyao Devadas, Srinivas |
| author_sort | Stefanov, Emil |
| collection | MIT |
| description | © 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. |
| first_indexed | 2024-09-23T11:41:53Z |
| format | Article |
| id | mit-1721.1/135810 |
| institution | Massachusetts Institute of Technology |
| language | English |
| last_indexed | 2024-09-23T11:41:53Z |
| publishDate | 2021 |
| publisher | Association for Computing Machinery (ACM) |
| record_format | dspace |
| spelling | mit-1721.1/1358102023-09-25T20:41:44Z Path ORAM: An Extremely Simple Oblivious RAM Protocol Stefanov, Emil Dijk, Marten Van Shi, Elaine Chan, T-H Hubert Fletcher, Christopher Ren, Ling Yu, Xiangyao Devadas, Srinivas Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory © 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. 2021-10-27T20:29:25Z 2021-10-27T20:29:25Z 2018 2019-05-28T17:09:34Z Article http://purl.org/eprint/type/JournalArticle https://hdl.handle.net/1721.1/135810 en 10.1145/3177872 Journal of the ACM Creative Commons Attribution-Noncommercial-Share Alike http://creativecommons.org/licenses/by-nc-sa/4.0/ application/pdf Association for Computing Machinery (ACM) MIT web domain |
| spellingShingle | Stefanov, Emil Dijk, Marten Van Shi, Elaine Chan, T-H Hubert Fletcher, Christopher Ren, Ling Yu, Xiangyao Devadas, Srinivas Path ORAM: An Extremely Simple Oblivious RAM Protocol |
| title | Path ORAM: An Extremely Simple Oblivious RAM Protocol |
| title_full | Path ORAM: An Extremely Simple Oblivious RAM Protocol |
| title_fullStr | Path ORAM: An Extremely Simple Oblivious RAM Protocol |
| title_full_unstemmed | Path ORAM: An Extremely Simple Oblivious RAM Protocol |
| title_short | Path ORAM: An Extremely Simple Oblivious RAM Protocol |
| title_sort | path oram an extremely simple oblivious ram protocol |
| url | https://hdl.handle.net/1721.1/135810 |
| work_keys_str_mv | AT stefanovemil pathoramanextremelysimpleobliviousramprotocol AT dijkmartenvan pathoramanextremelysimpleobliviousramprotocol AT shielaine pathoramanextremelysimpleobliviousramprotocol AT chanthhubert pathoramanextremelysimpleobliviousramprotocol AT fletcherchristopher pathoramanextremelysimpleobliviousramprotocol AT renling pathoramanextremelysimpleobliviousramprotocol AT yuxiangyao pathoramanextremelysimpleobliviousramprotocol AT devadassrinivas pathoramanextremelysimpleobliviousramprotocol |