基于联盟链PBFT的BRaft共识算法  

BRaft Consensus Algorithm Based on Consortium Chain PBFT

作　　者：白尚旺[1] 达泓宇 高改梅[1] 刘春霞[1] 党伟超[1] BAI Shangwang;DA Hongyu;GAO Gaimei;LIU Chunxia;DANG Weichao(School of Computer Science and Technology,Taiyuan University of Science and Technology,Taiyuan 030024,China)

机构地区：[1]太原科技大学计算机科学与技术学院,山西太原030024

出　　处：《软件导刊》2023年第9期132-137,共6页Software Guide

基　　金：太原科技大学科研启动基金项目(20192062);太原科技大学研究生教学改革研究课题(JG2022010)。

摘　　要：针对联盟链共识算法不能同时实现低时延、高吞吐量、高安全性的问题,提出适用于联盟链的可容错Raft共识算法——BRaft(PBFT-Raft)。BRaft利用RSA签名解决拜占庭Leader节点篡改日志的问题,并在PBFT算法三段协议的基础上,引入标识位W,解决拜占庭Follower节点恶意响应Leader节点的问题,确保在拜占庭节点发送错误消息的情况下日志项依然能够被正确提交。实验结果表明,BRaft在保证算法可理解性和共识效率的同时,提高了算法安全性。Aiming at the problem that the current alliance chain consensus algorithm cannot achieve low latency,high throughput,and high security at the same time,a fault-tolerant Raft consensus algorithm suitable for alliance chain-BRaft(PBFT-Raft)is proposed.BRaft used digital signature to solve the problem of Byzantine leader node tampering with logs,and based on the three-stage agreement of PBFT algo-rithm,it introduced the flag W,which solve the problem of Byzantine follower node maliciously responding to leader node,and ensure that the error message sent by Byzantine node can be prevented.In this case,the log entry can still be submitted correctly.The experimental results show that BRaft improves the security of the algorithm while ensuring the comprehensibility and consensus efficiency of the algorithm.

关 键 词：Raft算法 PBFT算法 拜占庭节点 数字签名 标识位 

分 类 号：TP311[自动化与计算机技术—计算机软件与理论]