Journal of Applied Sciences ›› 2021, Vol. 39 ›› Issue (1): 79-89.doi: 10.3969/j.issn.0255-8297.2021.01.007

• Blockchain • Previous Articles    

Improved PBFT Scheme Based on Reputation Voting

TU Yuanchao1,2, CHEN Yuling1,2, LI Tao1,2, REN Xiaojun3, QING Xinyi1,2   

  1. 1. College of Computer Science and Technology, Guizhou University, Guiyang 550025, Guizhou, China;
    2. State Key Laboratory of Public Big Data, Guizhou University, Guiyang 550025, Guizhou, China;
    3. Blockchain Laboratory of Agricultural Vegetables, Weifang University of Science and Technology, Shouguang 262700, Shandong, China
  • Received:2020-11-12 Published:2021-02-04

Abstract: As a decentralized, tamper-proof distributed ledger, the performance of blockchain is fundamentally affected by the efficiency of consensus mechanisms. Practical Byzantine fault tolerance (PBFT) algorithm randomly selects master nodes through view-switching, leading to problems of security vulnerabilities and low consensus efficiency in the case of large number of nodes. In response to the two problems, a PBFT improvement scheme based on reputation voting is proposed. The reliability of nodes is evaluated according to node division mechanism, where high reputation nodes are dynamically selected to participate in the consensus, and a malicious node is assigned with lower probability of becoming a consensus node, accordingly increasing the security of the system. By switching the role of nodes according to node state transfer mechanism, the scheme can maintain the correct operation of the system and improve the stability of the system. Experiments on the proposed and the traditional PBFT schemes show that the proposed one can reduce Byzantine nodes and communication overhead in long-term consensus processes, and improve the fault tolerance rate and the data throughput of transaction.

Key words: blockchain, practical Byzantine fault tolerance (PBFT), consensus mechanism, credit score, vote by ballot

CLC Number: