A Byzantine Fault-Tolerant Raft Algorithm Combined with Schnorr Signature

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 cl...

Full description

Saved in:
Bibliographic Details
Published in2021 15th International Conference on Ubiquitous Information Management and Communication (IMCOM) pp. 1 - 5
Main Authors Tian, Sihan, Liu, Yun, Zhang, Yansong, Zhao, Yingsi
Format Conference Proceeding
LanguageEnglish
Published IEEE 04.01.2021
Subjects
blockchain
Byzantine fault tolerance
Distributed ledger
Fabrics
Fault tolerance
Fault tolerant systems
Information management
Raft algorithm
Safety
Schnorr signature
Voting
Online AccessGet full text
DOI10.1109/IMCOM51814.2021.9377376

Cover

More Information
Summary: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.
DOI:10.1109/IMCOM51814.2021.9377376