@inbook {19037,
	title = {Oblivious RAM with O((logN)^3) Worst-Case Cost},
	booktitle = {Advances in Cryptology {\textendash} ASIACRYPT 2011},
	series = {Lecture Notes in Computer Science},
	volume = {7073},
	year = {2011},
	month = {2011},
	pages = {197 - 214},
	publisher = {Springer Berlin / Heidelberg},
	organization = {Springer Berlin / Heidelberg},
	abstract = {Oblivious RAM is a useful primitive that allows a client to hide its data access patterns from an untrusted server in storage outsourcing applications. Until recently, most prior works on Oblivious RAM aim to optimize its amortized cost, while suffering from linear or even higher worst-case cost. Such poor worst-case behavior renders these schemes impractical in realistic settings, since a data access request can occasionally be blocked waiting for an unreasonably large number of operations to complete. This paper proposes novel Oblivious RAM constructions that achieves poly-logarithmic worst-case cost, while consuming constant client-side storage. To achieve the desired worst-case asymptotic performance, we propose a novel technique in which we organize the O-RAM storage into a binary tree over data buckets, while moving data blocks obliviously along tree edges.},
	keywords = {Computer science},
	isbn = {978-3-642-25384-3},
	url = {http://www.springerlink.com/content/2214q8013376rj37/abstract/},
	author = {Elaine Shi and Chan, T. and Stefanov, Emil and Li, Mingfei},
	editor = {Lee, Dong and Wang, Xiaoyun}
}
