International Association for Cryptologic Research

International Association
for Cryptologic Research

CryptoDB

Paper: Oblivious RAM with O((logN)3) Worst-Case Cost

Authors:
Elaine Shi
T.-H. Hubert Chan
Emil Stefanov
Mingfei Li
Download:
DOI: 10.1007/978-3-642-25385-0_11
URL: https://www.iacr.org/archive/asiacrypt2011/70730197/70730197.pdf
Search ePrint
Search Google
Conference: ASIACRYPT 2011
BibTeX
@inproceedings{asiacrypt-2011-24141,
  title={Oblivious RAM with O((logN)3) Worst-Case Cost},
  booktitle={ASIACRYPT},
  series={Lecture Notes in Computer Science},
  publisher={Springer},
  volume={7073},
  pages={197-214},
  url={https://www.iacr.org/archive/asiacrypt2011/70730197/70730197.pdf},
  doi={10.1007/978-3-642-25385-0_11},
  author={Elaine Shi and T.-H. Hubert Chan and Emil Stefanov and Mingfei Li},
  year=2011
}