Key points are not available for this paper at this time.
We present Path ORAM, an extremely simple Oblivious RAM protocol with a small amount of client storage. Partly due to its simplicity, Path ORAM is the most practical ORAM scheme for small client storage known to date. We formally prove that Path ORAM requires log² N / log X bandwidth overhead for block size B = X log N. For block sizes bigger than Omega (log² N), Path ORAM is asymptotically better than the best known ORAM scheme with small client storage. Due to its practicality, Path ORAM has been adopted in the design of secure processors since its proposal.
Stefanov et al. (Tue,) studied this question.