An improved practical Byzantine fault-tolerant consensus algorithm combined with aggregating signature

The consensus algorithm is a key technology of blockchain and determines the performance of distributed systems. The PBFT algorithm with high communication complexity and poor scalability is not suitable for large-scale networks with a large number of nodes. Aiming at these problems, an Improved Practical Byzantine Fault-Tolerant consensus algorithm (IPBFT) was proposed. Combined with the aggregating signature, IPBFT improved the consensus process and reduce the communication complexity. In addition, the introduction of Security Node Set (SNS) could quickly locate honest nodes, and the honest nodes were used as the candidates for the primary nodes of the next round to effectively reduce the time delay caused by view switching. At the same time, nodes were allowed to dynamically join or withdraw from the consensus network. New added nodes participate in a new round of consensus process when one consensus was completed. Simulation results show that the IPBFT contributes to reducing communication overhead and improving scalability. Meanwhile, the activity and security of the system can be maintained by the algorithm.