《计算机应用》唯一官方网站 ›› 2022, Vol. 42 ›› Issue (7): 2112-2117.DOI: 10.11772/j.issn.1001-9081.2021040659

• 网络空间安全 • 上一篇    

基于二项交换林和HotStuff的改进共识算法

汤春明1(), 陈雨晴2, 张梓迪3   

  1. 1.天津工业大学 人工智能学院, 天津 300387
    2.天津工业大学 控制科学与工程学院, 天津 300387
    3.天津大学 计算机科学与技术学院, 天津 300350
  • 收稿日期:2021-04-25 修回日期:2021-06-25 接受日期:2021-07-15 发布日期:2022-07-15 出版日期:2022-07-10
  • 通讯作者: 汤春明
  • 作者简介:陈雨晴(1997—),女,河北廊坊人,硕士研究生,主要研究方向:区块链、数据安全
    张梓迪(2001—),男,吉林长春人,主要研究方向:计算机视觉、区块链。

Improved consensus algorithm based on binomial swap forest and HotStuff

Chunming TANG1(), Yuqing CHEN2, Zidi ZHANG3   

  1. 1.School of Artificial Intelligence,Tiangong University,Tianjin 300387,China
    2.School of Control Science and Engineering,Tiangong University,Tianjin 300387,China
    3.School of Computer Science and Technology,Tianjin University,Tianjin 300350,China
  • Received:2021-04-25 Revised:2021-06-25 Accepted:2021-07-15 Online:2022-07-15 Published:2022-07-10
  • Contact: Chunming TANG
  • About author:CHEN Yuqing, born in 1997, M. S. candidate. Her research interests include blockchain, data security.
    ZHANG Zidi, born in 2001. His research interests include computer vision, blockchain.

摘要:

针对区块链中拜占庭容错类的共识机制存在通信复杂度高、视图切换复杂以及扩展性差的问题,提出了一种基于二项交换林和HotStuff的改进共识算法,即增强HotStuff(HSP)共识算法。为实现签名批量验证和签名聚合,采用了BLS签名算法;为降低系统的通信复杂度,采用了门限签名技术;为降低视图切换时的通信复杂度,共识过程采用了三阶段确认方式;为减少主副节点间的通信次数并降低主节点聚合签名的压力,采用了改进的二项交换林技术。测试结果表明,HSP共识算法在系统节点总数为64且请求和响应均为256字节的情况下,吞吐量较HotStuff共识机制提升了33.8%,共识延迟缩短了16.4%。HSP共识算法在节点多的情况下,具有较好的性能。

关键词: 区块链, 共识机制, 门限签名, 二项交换林, 视图切换

Abstract:

Aiming at the problems of Byzantine Fault Tolerant (BFT) consensus mechanisms in the blockchain such as high communication complexity, complex view change and poor scalability, a consensus algorithm based on binomial swap forest and HotStuff named HSP (HotStuff Plus) consensus algorithm was proposed. In order to realize signature batch verification and signature aggregation, the Boneh-Lynn-Shacham (BLS) signature algorithm was adopted; in order to reduce the communication complexity of the system, threshold signature technology was adopted; in order to reduce the communication complexity during view change, the consensus process adopted a three-phase confirmation method; in order to reduce the number of communications between the primary and secondary nodes and reduce the pressure on the primary node when aggregating signatures, an improved binomial swap forest technology was adopted. Test results show that when the total number of system nodes is 64 and the request and reply are both 256 bytes, the throughput of HSP consensus algorithm is 33.8% higher than that of HotStuff consensus mechanism, and the consensus delay of HSP consensus algorithm is 16.4% lower than that of HotStuff consensus mechanism. It can be seen that HSP consensus algorithm has better performance when the number of nodes is large.

Key words: blockchain, consensus mechanism, threshold signature, binomial swap forest, view change

中图分类号: