T-RBFT: A Scalable and Efficient Byzantine Consensus Based on Trusted Execution Environment for Consortium Blockchain
Wen Gao, Xinhong Hei, Yichuan Wang

TL;DR
T-RBFT introduces a scalable, efficient Byzantine consensus protocol for consortium blockchains, leveraging trusted execution environments and a two-layer approach to improve performance and reduce communication costs.
Contribution
The paper presents T-RBFT, a novel two-layer consensus mechanism combining TEE-assisted BFT and improved Raft, enhancing scalability and efficiency for permissioned blockchains.
Findings
Reduces communication overhead and latency.
Achieves higher throughput than existing protocols.
Provides a scalable consensus solution for consortium blockchains.
Abstract
With the continuous expansion of blockchain application scenarios, consortium chains have raised higher performance and security requirements for consensus mechanisms. Unlike public blockchains, consortium chains typically implement an admission mechanism that restricts participation to trusted entities, ensuring that most replicas are honest and the number of faulty nodes remains small under normal circumstances. In such settings, conventional Byzantine Fault Tolerant (BFT) protocols, which are designed for worst-case adversarial scenarios, incur excessive message exchanges and computational overhead, thereby limiting performance and scalability. To address this issue, this paper proposes T-RBFT, a two-layer consensus mechanism inspired by network sharding and enhanced by the trusted execution environment (TEE). In T-RBFT, consensus nodes are first dynamically grouped based on their…
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.
