| 摘 要: 为针对应用于区块链中的PBFT共识算法存在计算效率低、不适用于节点数量庞大的区块链系统、扩展性差等问题,基于BLS聚合签名算法,设计了BLS-PBFT共识算法。针对PBFT共识过程中两次全部节点之间的相互广播机制,使用BLS签名算法将各节点之间的广播改为主节点对各节点的单播,在原Prepare阶段各节点的签名通过验证之后,对这些签名进行聚合操作。经实验对比,在 BLS-PBFT算法的共识过程中,通信开销降低了约85%。在节点数量为19个时,共识时延降低了约80%,吞吐量提高了近2.5倍,证明了本算法的有效性和可行性。 |
| 关键词: 联盟链 PBFT BLS签名算法 |
|
中图分类号: TP301.6
文献标识码: A
|
|
| Research on PBFT Consensus Algorithm Based on BLS Signature Algorithm |
|
SHAO Qi1,LIU Congjuni1,2
|
(1.School of Computer, Jiangsu University of Science and Technology, Zhenjiang 212000, China;
2.Jangsu KEDAHUIFENG Technology Co., Ltd., Zhenjiang 212000, China)
15370096752@163.com; liu_cj@163.com
|
| Abstract: To address the issues of low computational efficiency, poor scalability, and unsuitability for large-scale blockchain systems in the PBFT consensus algorithm applied to blockchain, this paper proposes the BLS-PBFT consensus algorithm based on the BLS aggregate signature scheme. By replacing the two rounds of al-l to-all broadcasting in the original PBFT process with a unicast mechanism based on BLS signatures, the algorithm converts node broadcasts into unicast communication from the primary node. Signatures from nodes in the Prepare phase are aggregated after verification. Experimental comparison demonstrates that the BLS-PBFT algorithm reduces communication overhead by approximately 85% . With 19 nodes, consensus latency decreases by about 80% , while throughput increases by nearly 2.5 times, validating the algorithm’s effectiveness and feasibility. |
| Keywords: consortium blockchain PBFT BLS signature algorithm |
