Path ORAM-Reference-Cited by-同舟云学术

Path ORAM

Published:2018-08-16 Issue:4 Volume:65 Page:1-26
ISSN:0004-5411
Container-title:Journal of the ACM
language:en
Short-container-title:J. ACM

Author:

Stefanov Emil¹,Dijk Marten Van²,Shi Elaine³,Chan T.-H. Hubert⁴,Fletcher Christopher⁵,Ren Ling⁶,Yu Xiangyao⁶,Devadas Srinivas⁶

Affiliation:

1. UC Berkeley, CA, USA

2. University of Connecticut, CT, USA

3. Cornell University, NY, USA

4. University of Hong Kong, Pokfulam Road, Hong Kong

5. University of Illinois at Urbana-Champaign, IL, USA

6. MIT CSAIL, MA, USA

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

Funder

NSF Graduate Research Fellowship

Hong Kong RGC

DoD NDSEG Fellowship

DARPA CRASH program

Amazon Web Services in Education program

Publisher

Association for Computing Machinery (ACM)

Subject

Artificial Intelligence,Hardware and Architecture,Information Systems,Control and Systems Engineering,Software

Link

https://dl.acm.org/doi/pdf/10.1145/3177872

Reference65 articles.

1. Oblivious RAMs without cryptogrpahic assumptions

2. Practicing Oblivious Access on Cloud Storage

3. Dan Boneh David Mazieres and Raluca Ada Popa. 2011. Remote Oblivious Storage: Making Oblivious RAM practical. Manuscript. Retrieved from http://dspace.mit.edu/bitstream/handle/1721.1/62006/MIT-CSAIL-TR-2011-018.pdf. Dan Boneh David Mazieres and Raluca Ada Popa. 2011. Remote Oblivious Storage: Making Oblivious RAM practical. Manuscript. Retrieved from http://dspace.mit.edu/bitstream/handle/1721.1/62006/MIT-CSAIL-TR-2011-018.pdf.

4. Large-Scale Secure Computation: Multi-party Computation for (Parallel) RAM Programs

5. Oblivious Parallel RAM and Applications

Cited by 185 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Combining Classical and Probabilistic Independence Reasoning to Verify the Security of Oblivious Algorithms;Lecture Notes in Computer Science;2024-09-11

2. SEDCPT: A secure and efficient Dynamic Searchable Encryption scheme with cluster padding assisted by TEE;Journal of Systems Architecture;2024-09

3. PEO-Store: Delegation-Proof Based Oblivious Storage With Secure Redundancy Elimination;IEEE Transactions on Dependable and Secure Computing;2024-09

4. Sort-then-insert: A space efficient and oblivious model aggregation algorithm for top-k sparsification in federated learning;Future Generation Computer Systems;2024-09

5. Panacea: Non-Interactive and Stateless Oblivious RAM;2024 IEEE 9th European Symposium on Security and Privacy (EuroS&P);2024-07-08