【Author】
Yu, Xiaosheng; Qin, Jie; Chen, Peng
【Source】SECURITY AND COMMUNICATION NETWORKS
【Abstract】The practical Byzantine fault-tolerant consensus algorithm reduces the operational complexity of Byzantine protocols from an exponential level to a polynomial level, which makes it possible to apply Byzantine protocols in distributed systems. However, it still has some problems, such as high communication overhead, low security, poor scalability, and difficulty in tracking. In this article, we propose a Byzantine fault-tolerant consensus algorithm based on dual administrator short group signatures (GPBFT). Firstly, the certification authority chooses the master node and group administrators based on the credit value. The group administrators organize the nodes into a group, and the members generate the signatures by applying the short group signatures scheme, in which any group member can represent the group during the GroupSign phase. Additionally, the GPBFT algorithm adds the Trace phase. According to member and client authentication information, the group administrator can track the true identity of the malicious node, identify the malicious node, and revoke it. The experimental results show that compared with the PBFT algorithm, the GPBFT algorithm can reduce the network communication overhead, reduce the consensus delay, and greatly improve the security and stability of the system. The algorithm can effectively manage member nodes and enable the tracking of identified malicious nodes while maintaining anonymity in terms of node tracking.
【标题】GPBFT：一种基于双管理员短组签名的实用拜占庭容错共识算法
【摘要】实用的拜占庭容错共识算法将拜占庭协议的操作复杂度从指数级降低到多项式级，使得拜占庭协议在分布式系统中的应用成为可能。但是，它仍然存在通信开销大、安全性低、可扩展性差、难以跟踪等问题。在本文中，我们提出了一种基于双管理员短组签名（GPBFT）的拜占庭容错共识算法。首先，认证机构根据信用值选择主节点和组管理员。组管理员将节点组织成一个组，成员通过应用短组签名方案生成签名，其中任何组成员都可以在 GroupSign 阶段代表该组。此外，GPBFT 算法增加了 Trace 阶段。群管理员根据成员和客户端的认证信息，可以追踪到恶意节点的真实身份，识别出恶意节点，并进行撤销。实验结果表明，与PBFT算法相比，GPBFT算法可以减少网络通信开销，减少共识延迟，大大提高系统的安全性和稳定性。该算法可以有效地管理成员节点，实现对识别的恶意节点的跟踪，同时在节点跟踪方面保持匿名。
评论