Improved Byzantine fault tolerance with fast consensus

Abstract

This article presents an improved Byzantine fault tolerance algorithm to tolerate Byzantine faults rapidly by minimizing the load of the network with a minimum cost that provides a very simple methodology to design Byzantine fault tolerance (BFT) state machine replication protocol with the most favorable flexibility. Although, we have taken the initiative of fault tolerance from earlier works and conversely perform a different approach than them. Our protocol just requires 2f + 1 replicas for ffaults instead of 3f + 1 in previous Byzantine protocols to mitigate the attacks by faulty primary and replicas. It also improves prior algorithms in terms of different parameters and requires fewer cryptographic techniques. Similar to previous BFT protocols, this protocol also guarantees correctness.

FP‐BFT: A fast pipeline Byzantine consensus algorithm

“…Some researchers suggest utilizing trustworthy third-party organizations to reduce the number of consensus nodes to increase the performance of the system. [27][28][29][30]. Veronese et al proposed the MinBFT [27] algorithm, and Kapitza et al proposed the CheapBFT [28] algorithm, both of which reduce the number of consensus nodes from 3 f +1 to 2 f +1.…”

“…Decouchant et al proposed the DAMYSUS [29] algorithm, which reduces the rounds of communications to improve the algorithm efficiency through the Checker and Accumulator services. Singh et al proposed the IBFT [30] algorithm based on the Cheap-BFT [28] and MinBFT [27] algorithms, which performs f +1 rounds of broadcast to reach the consensus within 2 f +1 nodes through setting up the forwarding nodes to verify the transactions. It is noticed that the number of nodes participated in the consensus can be reduced with the trustworthy third-party mechanism, but the serial execution model and the centralized message forwarding model still limit the system performance.…”

“…Some researchers suggest utilizing trustworthy third‐party organizations to reduce the number of consensus nodes to increase the performance of the system. [27–30]. Veronese et al.…”

LAP-BFT: Lightweight Asynchronous Provable Byzantine Fault-Tolerant Consensus Mechanism for UAV Network

“…The weaker asynchronous common subset (ACS) proposed by Ben-Or [16] and Rabin [17] pioneered circumventing that impossibility through randomization. Bracha proposed a Byzantine protocol for asynchronous networks in 1987, in which he first proposed the idea of "restricting adversary behavior with a broadcast protocol before consensus" and gave the first implementation of a reliable broadcast protocol (RBC) [18]. This construction idea has had a profound impact on subsequent research on Byzantine protocols, but the scheme itself is slow to achieve consensus, and the desired number of rounds required to achieve consensus is related to the total number of nodes in the system, N, which cannot be guaranteed to be achieved within a constant number of rounds.…”

“…A normal forwarding discount score of 0 is given, 1 point is deducted if there is an intentional delay, 2 points are deducted if one sends one's own data and does not forward others' data, and 3 points are deducted if there is data tampering. Lines (13)(14)(15)(16)(17)(18)(19)(20) of the algorithm refalg:lsc and lines (1-28) of the algorithm refalg:lsa implement this idea. The final tally is the discount score for each neighbouring node.…”