[SCSL11] Oblivious RAM with $O((\log N{)}^3)$ Worst-Case Cost

Authors: Elaine Shi, T.-H. Hubert Chan, Emil Stefanov, Mingfei Li | Venue: Asiacrypt 2011 | Source

Abstract

TODO — abstract.

BibTeX

Copy

@Inproceedings{AC:SCSL11,
  author = {Elaine Shi and T.-H. Hubert Chan and Emil Stefanov and Mingfei Li},
  title = {Oblivious {RAM} with {$O((\log N)^3)$} Worst-Case Cost},
  pages = {197--214},
  editor = {Dong Hoon Lee and Xiaoyun Wang},
  booktitle = {Advances in Cryptology -- {ASIACRYPT}~2011},
  volume = {7073},
  series = {Lecture Notes in Computer Science},
  address = {Seoul, South Korea},
  month = {dec~4--8},
  publisher = {Springer Berlin Heidelberg, Germany},
  year = {2011},
  doi = {10.1007/978-3-642-25385-0_11},
}