Reputation-Based Byzantine Fault-Tolerance for Consortium Blockchain

Citations Over TimeTop 10% of 2018 papers

Abstract

The Practical Byzantine Fault Tolerance algorithm (PBFT)has been highly applied in consortium blockchain systems, however, this kind of consensus algorithm can hardly identify and remove faulty nodes in time, and also vulnerable to many attacks against the primary node of PBFT. The equality of consortium members' discourse rights is inapplicable to some real scenarios where dominating members are likely to have a larger discourse rights in the voting process. To address these problems, this paper presents Reputation-based Byzantine Fault Tolerance (RBFT)algorithm that incorporates a reputation model to evaluate the operations of each node in the consensus process. The faulty nodes will get lower discourse rights in the voting process if any malicious behavior is detected, with their reputation decreased. Furthermore, this paper presents an innovative reputation-based primary change scheme. The node with higher reputation obtains greater opportunities to be a primary to generate new valid blocks, which reduces the security risk of the primary. The experimental results demonstrate that RBFT gains better performance and ensures system security and reliability. Compared with PBFT, it increases the average throughput by 15% and reduces delay by 10%, and the faulty node rate of the system can continue to decrease over time.

Related Papers

• → Checkpointing Algorithms for Fault-Tolerant Execution of Large-Scale Distributed Applications in Cloud(2020)6 cited
• → Distributed Ledger Technology (DLT) and Byzantine Fault Tolerance in Blockchain(2022)2 cited
• → Distributed resource sharing in computer networks(1986)2 cited
• Application of Blockchain Technology based secured online voting system(2021)
• → Processing Erroneous Situations in Large Blockchain Networks by a Consensus Algorithm Based on the Byzantine Generals’ Problem Solution(2021)