An Efficient and Scalable Byzantine Fault-Tolerant Consensus Mechanism Based on Credit Scoring and Aggregated Signatures

Abstract

Practical Byzantine Fault Tolerance (PBFT), a classic consensus algorithm in blockchain technology, is extensively used in consortium blockchain networks. However, it is challenged by issues such as low consensus efficiency, poor scalability, inability to guarantee throughput with large-scale node access, and complex communication processes. To solve these problems, this paper proposes an improved PBFT consensus mechanism based on credit scoring and aggregated signatures, i.e., the CA-PBFT algorithm. First, the algorithm designs the node credit scoring mechanism, adds the coordination node in the original algorithm model, stipulates the node state and functional limitations, and realizes the dynamic joining and exiting of the nodes, to solve the low efficiency of the PBFT algorithm during the consensus process and the problem of not supporting the dynamic joining and exiting of the nodes; at the same time, the signature scheme based on the BLS aggregated signature is designed, which reduces the length of the signature and simplifies the signing process, to solve the problem of the node’s signature taking up too much space during the consensus process, which affects the efficiency of the signature validation as well as the efficiency of the signature construction. Experimental results show that this consensus mechanism enables an efficient, secure, and scalable consensus process with low resource and computational costs.

Keywords

• Blockchain
• consensus mechanisms
• PBFT
• credit scoring
• aggregated signatures