pith. sign in

arxiv: 1106.3652 · v5 · pith:5L5NT3HYnew · submitted 2011-06-18 · 💻 cs.CR

Towards Practical Oblivious RAM

classification 💻 cs.CR
keywords o-ramobliviouspracticaltechniqueachievingnovelpartitionpropose
0
0 comments X
read the original abstract

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.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.