A Byzantine Fault-Tolerant Raft Algorithm Combined with Schnorr Signature
Sihan Tian, Yun Liu, Yansong Zhang, Yingsi Zhao
Abstract
To optimize the Byzantine fault tolerance of Raft algorithm, a Byzantine fault-tolerant B-Raft algorithm combined with Schnorr signature mechanism is proposed. First, during leader election, followers are required to sign the ballot to prevent the Byzantine node from forging the vote. Second, the client is required to sign the message when sending the message to leader to prevent the Byzantine leader from tampering with the logs. B-Raft combines the signature mechanism with the Raft algorithm and several modifications and additions provide Byzantine fault tolerance. The results of the experiments launched in Hyperledger Fabric show that compared with the Raft algorithm, the safety of B-Raft is greatly improved.