| dc.contributor.author | Stefanov, Emil | |
| dc.contributor.author | van Dijk, Marten | |
| dc.contributor.author | Shi, Elaine | |
| dc.contributor.author | Ren, Ling | |
| dc.contributor.author | Yu, Xiangyao | |
| dc.contributor.author | Devadas, Srinivas | |
| dc.contributor.author | Fletcher, Christopher Wardlaw | |
| dc.date.accessioned | 2014-04-14T18:11:34Z | |
| dc.date.available | 2014-04-14T18:11:34Z | |
| dc.date.issued | 2013-11 | |
| dc.identifier.isbn | 9781450324779 | |
| dc.identifier.uri | http://hdl.handle.net/1721.1/86163 | |
| dc.description.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. | en_US |
| dc.description.sponsorship | National Science Foundation (U.S.). Graduate Research Fellowship Program (Grant DGE-0946797) | en_US |
| dc.description.sponsorship | National Science Foundation (U.S.). Graduate Research Fellowship Program (Grant DGE-1122374) | en_US |
| dc.description.sponsorship | American Society for Engineering Education. National Defense Science and Engineering Graduate Fellowship | en_US |
| dc.description.sponsorship | National Science Foundation (U.S.) (Grant CNS-1314857) | en_US |
| dc.description.sponsorship | United States. Defense Advanced Research Projects Agency (Clean-slate design of Resilient, Adaptive, Secure Hosts Grant N66001-10-2-4089) | en_US |
| dc.language.iso | en_US | |
| dc.publisher | Association for Computing Machinery (ACM) | en_US |
| dc.relation.isversionof | http://dx.doi.org/10.1145/2508859.2516660 | en_US |
| dc.rights | Creative Commons Attribution-Noncommercial-Share Alike | en_US |
| dc.rights.uri | http://creativecommons.org/licenses/by-nc-sa/4.0/ | en_US |
| dc.source | Other repository | en_US |
| dc.title | Path ORAM: An Extremely Simple Oblivious RAM Protocol | en_US |
| dc.type | Article | en_US |
| dc.identifier.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. | en_US |
| dc.contributor.department | Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory | en_US |
| dc.contributor.mitauthor | Fletcher, Christopher Wardlaw | en_US |
| dc.contributor.mitauthor | Ren, Ling | en_US |
| dc.contributor.mitauthor | Yu, Xiangyao | en_US |
| dc.contributor.mitauthor | Devadas, Srinivas | en_US |
| dc.relation.journal | Proceedings of the 2013 ACM SIGSAC conference on Computer & communications security (CCS '13) | en_US |
| dc.eprint.version | Author's final manuscript | en_US |
| dc.type.uri | http://purl.org/eprint/type/ConferencePaper | en_US |
| eprint.status | http://purl.org/eprint/status/NonPeerReviewed | en_US |
| dspace.orderedauthors | Stefanov, Emil; van Dijk, Marten; Shi, Elaine; Fletcher, Christopher; Ren, Ling; Yu, Xiangyao; Devadas, Srinivas | en_US |
| dc.identifier.orcid | https://orcid.org/0000-0001-8253-7714 | |
| dc.identifier.orcid | https://orcid.org/0000-0003-4317-3457 | |
| dc.identifier.orcid | https://orcid.org/0000-0003-3437-7570 | |
| dc.identifier.orcid | https://orcid.org/0000-0003-1467-2150 | |
| mit.license | OPEN_ACCESS_POLICY | en_US |
| mit.metadata.status | Complete | |
