Paper 2014/185 Original: eprint.iacr.org/2014/185 ↗
Oblivious Data Structures
Abstract
Oblivious RAMs (ORAMs) have traditionally been measured by their bandwidth overhead and client storage. We observe that when using ORAMs to build secure computation protocols for RAM programs, the size of the ORAM circuits is more relevant to the performance. We therefore embark on a study of the circuit-complexity of several recently proposed ORAM constructions. Our careful implementation and experiments show that asymptotic analysis is not indicative of the true performance of ORAM in secure computation protocols with practical data sizes. We then present SCORAM, a heuristic compact ORAM design optimized for secure computation protocols. Our new design is almost 10x smaller in circuit size and also faster than all other designs we have tested for realistic settings (i.e., memory sizes between 4MB and 2GB, constrained by 2^{-80} failure probability). SCORAM makes it feasible to perform secure computations on gigabyte-sized data sets.
Metadata
- Available format(s)
PDF- Category
- Cryptographic protocols
- Publication info
- Preprint.
- History
- 2015-01-24: last updated
- 2014-03-09: published
- Short URL
- https://ia.cr/2014/185
- License
- https://creativecommons.org/licenses/by/4.0/
BibTeX
@misc{cryptoeprint:2014/185,
author = {Xiao Shaun Wang and Kartik Nayak and Chang Liu and T-H. Hubert Chan and Elaine Shi and Emil Stefanov and Yan Huang},
title = {Oblivious Data Structures},
howpublished = {Cryptology {ePrint} Archive, Paper 2014/185},
year = {2014},
url = {https://eprint.iacr.org/2014/185}
}