RB-Raft:一种抗拜占庭节点的Raft共识算法

针对Raft算法无法抵抗拜占庭节点的攻击和日志易窜改等问题，设计了一种抵抗拜占庭节点的RB-Raft（resist Byzantine-Raft）算法。首先采用哈希链的方式对每一块日志进行迭代哈希处理，通过动态验证机制对日志进行验证，使得对leader节点的恶意行为具有一定的容错率，解决了日志伪造与验证的问题。其次，提出基于门限加密的遗书机制，使得candidate节点拉取选票具有合法性，防止拜占庭节点随意拉取选票更换leader节点的攻击，解决了拜占庭节点影响系统一致性的问题。实验结果表明，提出的RB-Raft算法具有抗拜占庭节点的能力，其日志识别率可以达到100%。同时，相比PBFT，该算法共识时延降低了53.3%，并且吞吐量提高了61.8%。其适用于在不可信联盟链中进行共识。

RB-Raft:Raft consensus algorithm for anti-Byzantine nodes

Aiming at the problems that the Raft algorithm cannot resist the attacks of Byzantine nodes and the logs are easy to tamper with, this paper proposed a RB-Raft algorithm that resisted Byzantine nodes. Firstly, this paper used the method of hash chain to iteratively hash each log. At the same time, it verificated the log through the dynamic verification mechanism, so that the malicious behavior of the leader node had a certain fault tolerance rate, which solved the problem of log forgery and verification. Secondly, this paper proposed a legacy mechanism based on threshold encryption, which made it legal for candidate nodes to pull votes. This mechanism could prevent Byzantine nodes from randomly the attack of pulling votes to replace leader nodes, and solved the problem that Byzantine nodes affect the system consistency. The experimental results show that the proposed RB-Raft algorithm has the ability to resist Byzantine nodes, and its log recognition rate can reach 100%. At the same time, compared with PBFT, the consensus latency of the algorithm in this paper is reduced by 53.3%, and the throughput is increased by 61.8%. The proposed algorithm is suitable for consensus in untrusted consortium chains.