A Tale of Two Trees: One Writes, and Other Reads. Optimized Oblivious Accesses to Large-Scale Blockchains
Duc V. Le, Lizzy Tengana Hurtado, Adil Ahmad, Mohsen Minaei, and Byoungyoung Lee, Aniket Kate

TL;DR
This paper introduces $T^3$, a trusted hardware-based Bitcoin client that enables efficient, privacy-preserving access to blockchain data for SPV clients by optimizing ORAM techniques tailored to typical usage patterns.
Contribution
The work presents a novel two-tree ORAM construction optimized for SPV client access patterns, enhancing privacy and efficiency in blockchain data retrieval.
Findings
Feasible implementation on Bitcoin UTXO database
Provides strong privacy and security guarantees
Optimized ORAM reduces access latency
Abstract
The Bitcoin network has offered a new way of securely performing financial transactions over the insecure network. Nevertheless, this ability comes with the cost of storing a large (distributed) ledger, which has become unsuitable for personal devices of any kind. Although the simplified payment verification (SPV) clients can address this storage issue, a Bitcoin SPV client has to rely on other Bitcoin nodes to obtain its transaction history and the current approaches offer no privacy guarantees to the SPV clients. This work presents , a trusted hardware-secured Bitcoin full client that supports efficient oblivious search/update for Bitcoin SPV clients without sacrificing the privacy of the clients. In this design, we leverage the trusted execution and attestation capabilities of a trusted execution environment (TEE) and the ability to hide access patterns of oblivious random…
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.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsCryptography and Data Security · Blockchain Technology Applications and Security · Security and Verification in Computing
