A Hierarchy Byzantine Fault Tolerance Consensus Protocol Based on Node Reputation.

Area of Science:

• Computer Science
• Distributed Systems
• Cybersecurity

Background:

• Blockchain technology faces scalability, efficiency, and security challenges with increasing network nodes.
• Consensus protocols are crucial for maintaining transaction consistency in blockchain networks.
• Existing protocols struggle to meet the demands of large-scale, decentralized applications.

Purpose of the Study:

• To propose a novel Hierarchy Byzantine Fault Tolerance (HBFT) consensus protocol to address blockchain limitations.
• To enhance scalability and security through a two-layer hierarchical structure and a node reputation system.
• To improve network efficiency by reducing communication complexity.

Main Methods:

• Implemented a two-layer hierarchy to segment nodes and reduce inter-layer communication.
• Developed a reputation model with a punishment and reward mechanism to identify malicious nodes.
• Integrated a random selection mechanism for unpredictable and secure leader node election.
• Evaluated performance against state-of-the-art consensus models.

Main Results:

• The HBFT protocol demonstrated improved scalability by limiting node communication within groups.
• The reputation system effectively isolated malicious nodes to the bottom layer, reducing high-layer communication overhead.
• Random leader selection enhanced network security through unpredictability.
• Experimental results showed superior performance compared to existing models.

Conclusions:

• The proposed HBFT consensus protocol offers a viable solution for enhancing blockchain scalability, efficiency, and security.
• Hierarchical structures and reputation-based mechanisms are effective in managing large-scale blockchain networks.
• The protocol shows significant potential for applications in cryptocurrency, smart cities, and digital finance.