An efficient Byzantine fault-tolerant consensus mechanism based on threshold signature

In the application scenario of PKI system, the amount of written data is huge and the consensus will consume a lot of resources. In order to reduce the communication complexity and optimize the master node election process, this paper proposes Threshold Signature Practical Byzantine Fault Tolerant(TS-PBFT), an efficient Byzantine Fault Tolerant consensus mechanism based on the Threshold Signature. This consensus mechanism firstly adds the Threshold Signature technique to the PBFT algorithm with Byzantine Fault Tolerant, which reduces the communication complexity to O(n) level; secondly, it introduces the external monitoring mechanism and node trustworthiness index to improve the master node election strategy; Finally, it adds the batch processing mechanism to improve the performance of the consensus process. Compared with the PBFT algorithm, the TS-PBFT algorithm increases the throughput, reduces the delay, and decreases the out block time, which improves the performance of the algorithm.