主节点随机选取的改进PBFT共识算法

IMPROVED PBFT CONSENSUS ALGORITHM WITH RANDOM SELECTION OF MASTER NODES

针对区块链中的实用拜占庭容错(PBFT)共识算法存在的主节点选取随意、三阶段流程通信开销大、节点不能动态加入、退出等问题,提出一种主节点随机选取的改进拜占庭容错(RPBFT)共识算法。提出一种随机数生成方案,根据随机数选取主节点,提高系统的安全性;引入聚合签名方案对PBFT共识算法中的三段式流程进行改进,降低通信开销,提高系统共识阶段的效率;给节点加入一个待同步状态,使节点可以动态加入、退出,提高系统的可用性。通过实验表明,RPBFT共识算法较PBFT共识算法和AlgoRand共识算法有更高的性能和可用性,可以达到改进的目的。

An improved Byzantine fault tolerance(RPBFT)consensus algorithm with random selection of master nodes is proposed to solve the problems of random selection of master nodes,high communication cost in three-phase process,and failure of nodes to dynamically join and exit in practical Byzantine fault tolerance(PBFT)consensus algorithm.A random number generation scheme was proposed to select master node according to the random number thus improving the security of the system.Then,an aggregate signature scheme was introduced to improve the three-phase process in the PBFT consensus algorithm,reduce the communication cost,and improve the efficiency in system consensus phase.A to-be-synchronized state was attached to the node,so that nodes could dynamically join and exit,improving the availability of the system.Experiments show that the RPBFT consensus algorithm brings higher performance and availability than the original PBFT consensus algorithm and AlgoRand consensus algorithm,and can achieve the purpose of improvement.