The Community for Technology Leaders
2016 IEEE Symposium on Security and Privacy (SP) (2016)
San Jose, CA, USA
May 22, 2016 to May 26, 2016
ISSN: 2375-1207
ISBN: 978-1-5090-0825-4
pp: 178-197
We present a new oblivious RAM that supports variable-sized storage blocks (vORAM), which is the first ORAM to allow varying block sizes without trivial padding. We also present a new history-independent data structure (a HIRB tree) that can be stored within a vORAM. Together, this construction provides an efficient and practical oblivious data structure (ODS) for a key/value map, and goes further to provide an additional privacy guarantee as compared to prior ODS maps: even upon client compromise, deleted data and the history of old operations remain hidden to the attacker. We implement and measure the performance of our system using Amazon Web Services, and the single-operation time for a realistic database (up to 256K entries) is less than 1 second. This represents a 100x speed-up compared to the current best oblivious map data structure (which provides neither secure deletion nor history independence) by Wang et al. (CCS 14).
History, Data structures, Vegetation, Servers, Cloud computing, Security, Random access memory

D. S. Roche, A. Aviv and S. G. Choi, "A Practical Oblivious Map Data Structure with Secure Deletion and History Independence," 2016 IEEE Symposium on Security and Privacy (SP), San Jose, CA, USA, 2016, pp. 178-197.
87 ms
(Ver 3.3 (11022016))