Improvement of graded PBFT algorithm based on threshold signature
Sheping Zhai, Yuanyuan Huo, Haonan Nie, Rui Yang · 2023
A hierarchical TGBFT consensus algorithm based on threshold signature is proposed to address the high communication complexity and poor scalability of the practical Byzantine fault-tolerant algorithm PBFT. Firstly, group the system nodes, select the main nodes of each group and each group of high reputation nodes to form a consensus cluster, and perform hierarchical consensus within and between groups. Secondly, the consensus process is optimized. The main nodes of each group use an improved two-stage PBFT algorithm for inter group consensus, and the ELGamal type threshold signature consensus scheme is used in the intra group consensus. Finally, improvements were made to the view switching protocol to reduce communication overhead during view switching. The experimental results show that compared to the PBFT algorithm, the TGBFT algorithm has lower communication complexity, better performance in consensus latency and throughput than the PBFT algorithm, and has good consensus efficiency and scalability.