We take an important step forward in making Oblivious RAM (O-RAM) practical. We propose an O-RAM construction achieving an amortized overhead of 20X-35X (for an O-RAM roughly 1 terabyte in size), about 63 times faster than the best existing scheme. On the theoretic front, we propose a fundamentally novel technique for constructing Oblivious RAMs: specifically, we partition a bigger O-RAM into smaller O-RAMs, and employ a background eviction technique to obliviously evict blocks from the client-side cache into a randomly assigned server-side partition. This novel technique is the key to achieving the gains in practical performance.
@article{arxiv.1106.3652,
title = {Towards Practical Oblivious RAM},
author = {Emil Stefanov and Elaine Shi and Dawn Song},
journal= {arXiv preprint arXiv:1106.3652},
year = {2015}
}