Path ORAM: An Extremely Simple Oblivious RAM Protocol

@article{Stefanov2013PathOA,
  title={Path ORAM: An Extremely Simple Oblivious RAM Protocol},
  author={Emil Stefanov and Marten van Dijk and Elaine Shi and T.-H. Hubert Chan and Christopher W. Fletcher and Lingxue Ren and Xiangyao Yu and Srinivas Devadas},
  journal={IACR Cryptology ePrint Archive},
  year={2013},
  volume={2013},
  pages={280}
}
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… CONTINUE READING
Tweets
This paper has been referenced on Twitter 1 time. VIEW TWEETS

Citations

Publications citing this paper.

References

Publications referenced by this paper.
SHOWING 1-10 OF 12 REFERENCES

Usable PIR

  • Peter Williams, Radu Sion, Bogdan Carbunar
  • Proceedings of the ACM SIGSAC Conference on…
  • 2008
Highly Influential
7 Excerpts

Security and Privacy (SP’13)

  • Emil Stefanov, Elaine Shi, Dawn Song
  • 2012
Highly Influential
4 Excerpts

Similar Papers

Loading similar papers…