You are looking at a specific version 20140309:201800 of this paper.
See the latest version.
Paper 2014/185
Oblivious Data Structures
Xiao Wang and Kartik Nayak and Chang Liu and Elaine Shi and Emil Stefanov and Yan Huang
Abstract
We are among the first to systematically investigate (memory-trace) oblivious data structures. We propose a framework for constructing a variety of oblivious data structures, achieving asymptotic performance gains in comparison with generic Oblivious RAM (ORAM). We evaluate the performance of our oblivious data structures in terms of their bandwidth over- heads, and also when applied to a secure computation setting. Finally, we leverage our new framework to design an efficient oblivious memory allocator which is particularly useful due to the community’s recent efforts in compiling programs targeting ORAM-capable secure processors.
Metadata
- Available format(s)
- Category
- Cryptographic protocols
- Publication info
- Preprint.
- Keywords
- oblivious RAMORAMsecure computation
- Contact author(s)
- wangxiao @ cs umd edu
- History
- 2015-01-24: last of 5 revisions
- 2014-03-09: received
- See all versions
- Short URL
- https://ia.cr/2014/185
- License
-
CC BY