Path ORAM: An Extremely Simple Oblivious RAM Protocol
This work addresses the need for efficient and secure data access in systems like secure processors, offering a significant improvement over existing methods.
The paper tackled the problem of designing a practical Oblivious RAM protocol with minimal client storage, resulting in Path ORAM, which achieves O(log N) bandwidth cost for specific block sizes and is considered the most practical scheme to date.
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 known to date with small client storage. We formally prove that Path ORAM has a O(log N) bandwidth cost for blocks of size B = Omega(log^2 N) bits. For such block sizes, Path ORAM is asymptotically better than the best known ORAM schemes with small client storage. Due to its practicality, Path ORAM has been adopted in the design of secure processors since its proposal.