基于可跟踪环签名的拜占庭容错共识算法  

Byzantine Fault Tolerant Consensus Algorithm Based on Traceable Ring Signature

作　　者：涂俊 贾东立[1] 王津 TU Jun;JIA Dongli;WANG Jin(School of Information and Electrical Engineering,Hebei University of Engineering,Handan,Hebei 056038,China)

机构地区：[1]河北工程大学信息与电气工程学院,河北邯郸056038

出　　处：《计算机科学》2023年第S01期733-739,共7页Computer Science

基　　金：河北省高等学校科学技术研究项目(ZD2015087)。

摘　　要：针对联盟链的实用拜占庭容错(PBFT)共识算法在共识过程中节点间的隐私保护弱、网络结构静态、选取主节点不可靠和通信开销大的问题,提出一种基于可跟踪环签名的拜占庭容错共识算法(tracePBFT)。首先,随机将节点分为主域节点和副域节点并且赋予其不同的权量,选择权重高的主域节点为主节点;然后在准备阶段引入可追踪环签名对节点进行隐私保护,并且节点可以通过权重选择可靠节点,在确认阶段验证签名和跟踪拜占庭节点;最后适当惩罚拜占庭节点。这样选择的主节点更加可靠,减少因主节点出错而更换视图导致的通信开销。实验结果表明,相比传统的PBFT算法,tracePBFT算法在通信复杂度、安全性、吞吐量等方面均有一定的提高。The practical Byzantine fault tolerance(PBFT)consensus algorithm of alliance chain has the problems of weak privacy protection between nodes,static network structure,unreliable selection of master node and high communication overhead.A Byzantine fault-tolerant consensus algorithm(tracePBFT)based on traceable ring signature is proposed.Firstly,the nodes are randomly divided into primary domain nodes and secondary domain nodes,and different weights are given,and the primary domain node with high weight is selected as the primary node.Then,the ring signature is introduced in the preparation stage to protect the privacy of the node,and the node can select the reliable node through the weight,verify the signature and track the Byzantine node in the confirmation stage,and finally appropriately punish the Byzantine node.In this way,the selected master node is more reliable and reduce the communication overhead caused by changing the view due to the error of the master node.Experiments show that the tracePBFT algorithm is better than the traditional PBFT algorithm in communication complexity,security,throughput and so on.

关 键 词：联盟链 实用拜占庭容错共识算法 可跟踪环签名 主节点 

分 类 号：TP301.6[自动化与计算机技术—计算机系统结构]