H$_2$O$_2$RAM: A High-Performance Hierarchical Doubly Oblivious RAM
Leqian Zheng, Zheng Zhang, Wentao Dong, Yao Zhang, Ye Wu, Cong Wang

TL;DR
H$_2$O$_2$RAM is a novel hierarchical doubly oblivious RAM that significantly improves performance and memory efficiency by leveraging data locality and parallelization, outperforming existing solutions.
Contribution
It introduces a hierarchical framework for doubly oblivious RAM, overcoming challenges of existing designs and achieving high performance and efficiency.
Findings
Reduces execution time by up to 1000 times.
Saves memory usage by 5 to 44 times.
Outperforms state-of-the-art solutions in various scenarios.
Abstract
The combination of Oblivious RAM (ORAM) with Trusted Execution Environments (TEE) has found numerous real-world applications due to their complementary nature. TEEs alleviate the performance bottlenecks of ORAM, such as network bandwidth and roundtrip latency, and ORAM provides general-purpose protection for TEE applications against attacks exploiting memory access patterns. The defining property of this combination, which sets it apart from traditional ORAM designs, is its ability to ensure that memory accesses, both inside and outside of TEEs, are made oblivious, thus termed doubly oblivious RAM (ORAM). Efforts to develop ORAM with enhanced performance are ongoing. In this work, we propose HORAM, a high-performance doubly oblivious RAM construction. The distinguishing feature of our approach, compared to the existing tree-based doubly oblivious designs, is its first…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsCryptography and Data Security · Advanced Data Storage Technologies · Privacy-Preserving Technologies in Data
