应用科学学报 ›› 2023, Vol. 41 ›› Issue (6): 1046-1057.doi: 10.3969/j.issn.0255-8297.2023.06.011

• 计算机科学与应用 • 上一篇    下一篇

基于信誉和聚类的动态拜占庭容错算法

巫光福1,2, 杨子1, 黄宝珠1   

  1. 1. 江西理工大学 信息工程学院, 江西 赣州 341099;
    2. 密码科学技术国家重点实验室, 北京 100878
  • 收稿日期:2022-04-07 出版日期:2023-11-30 发布日期:2023-11-30
  • 通信作者: 巫光福,副教授,研究方向为信息论与编码、密码学、信息安全、区块链。E-mail:wuguangfu@126.com E-mail:wuguangfu@126.com
  • 基金资助:
    密码科学技术国家重点实验室开放课题面上项目(No.MMKFKT202123);江西省科技厅重点项目(No.20212ACB202003);国家自然科学基金地区项目(No.11461031)资助

Dynamic Byzantine Fault Tolerance Algorithm Based on Reputation and Clustering

WU Guangfu1,2, YANG Zi1, HUANG Baozhu1   

  1. 1. College of Information Engineering, Jiangxi University of Science and Technology, Ganzhou 341099, Jiangxi, China;
    2. State Key Laboratory of Cryptology, Beijing 100878, China
  • Received:2022-04-07 Online:2023-11-30 Published:2023-11-30

摘要: 针对目前实用拜占庭容错共识算法主节点选取随意,节点加入或退出没有良好的响应机制以及节点较多时共识效率会降低等问题,提出了一种基于信誉和聚类的动态拜占庭容错算法。根据改进聚类算法将节点分为K个共识区域,提高了较多节点参与共识时的效率;根据信誉评估算法中节点奖罚机制对节点的共识行为进行信誉值评估,然后根据高信誉值选取可靠代理节点,同时剔除信誉值较低的节点,降低了拜占庭节点成为主节点的概率。在节点分类过程中结合信誉评估算法,进行K个代理节点的选取,增加了系统的稳定性、安全性。实验仿真结果表明,所提算法与PBFT相比,具有节点动态加入和退出的功能,同时通信开销较小、交易时延较低、吞吐量较高,有较好的容错性和扩展性。

关键词: 区块链, 拜占庭容错, 信誉评估, K-medoids, 共识算法

Abstract: This paper presents a dynamic Byzantine fault-tolerant consensus algorithm based on reputation and clustering. The existing practical algorithms lack a response mechanism for joining or exiting nodes, leading to decreased consensus efficiency with a large number of nodes. To address this issue, the proposed algorithm utilizes a clustering algorithm to divide nodes into K consensus regions, improving efficiency when more nodes participate in consensus. Additionally, K reliable proxy nodes are selected based on high reputation, while low reputation nodes are eliminated to reduce the probability of Byzantine nodes becoming main nodes. The node classification process combines the reputation evaluation algorithm to select K proxy nodes, enhancing system stability and security. Simulation results demonstrate that compared to PBFT, the proposed algorithm supports dynamic node joining and exiting, with lower communication cost, transaction delay, and higher throughput. It also exhibits better fault tolerance and scalability.

Key words: blockchain, Byzantine fault tolerance, reputation evaluation, K-medoids, consensus mechanism

中图分类号: