Research on PBFT consensus algorithm for grouping based on feature trust

Wang, Yong; Zhong, Meiling; Cheng, Thomas C.

doi:10.1038/s41598-022-15282-8

Cited by 18 publications

(3 citation statements)

References 29 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Wang et al proposed a feature-based trust grouping PBFT algorithm (GPBFT), which selected master nodes and performed grouping by trust degree evaluation. Each consensus group performed PBFT consensus independently to reduce the communication complexity [22]. Li et al proposed a scalable PBFT consensus, first proposing an optimal two-layer PBFT scheme that minimized the communication complexity, and extended the method to PBFT systems with arbitrary layers [23].…”

Section: Related Workmentioning

confidence: 99%

An Improved Byzantine Fault-Tolerant Algorithm Based on Reputation Model

Feng

Liu

2023

Electronics

View full text Add to dashboard Cite

This study proposes an improved Byzantine fault-tolerant consensus RB-BFT based on the reputation model to address the problems of low reliability of primary nodes and high communication complexity in the practical Byzantine algorithm (PBFT). First, this algorithm establishes a dynamic reputation model of nodes to distinguish honest and malicious nodes in the system, lowering the likelihood of malicious nodes being chosen as primary nodes and increasing the dependability of primary nodes. Second, the algorithm introduces supervisory nodes for information supervision while reducing the centrality of the system. Finally, this algorithm improves the consistency protocol of the PBFT algorithm by optimizing the process of mutual communication between nodes in the preparation and commitment phases, which reduces the algorithm communication complexity from O(n2) to O(n). Theoretical and practical studies reveal that the RB-BFT algorithm enhances performance and reliability greatly.

show abstract

Section: Related Workmentioning

confidence: 99%

An Improved Byzantine Fault-Tolerant Algorithm Based on Reputation Model

Feng

Liu

2023

Electronics

View full text Add to dashboard Cite

show abstract

“…Additionally, it allows flexible network capacity expansion by adjusting the hash ri ng size and node distribution to cater to different application scenarios with varying sizes and demands. Yong Wang et al [13] The literature proposed a new PBFT algorithm based o n the hash ring grouping strategy called GPBFT. This algorit hm incorporates feature trust to evaluate node trust levelsdur ing transactions using the EigenTrust trust model.…”

Section: Related Workmentioning

confidence: 99%

A Study on Practical Byzantine Algorithms Based on Short Group Signatures

Liu,

2023

Preprint

View full text Add to dashboard Cite

The Practical Byzantine Fault Tolerance (PBFT) algorithm is a well-known consensus algorithm used in distributed systems. However, it has limitations in terms of performance and fault tolerance.This paper proposes an improved PBFT algorithm called GR-PBFT, which is based on the Short Group Signatures mechanism. Firstly, we introduce the Short Group Signatures mechanism, which involves adding nodes to the group and allowing the master node to verify messages signed by each member. Once enough signatures are collected, the master node generates the commit message. Replica nodes can then verify the commit message and synchronize the state information, thereby enhancing the interaction between the preparation and commit phases and reducing communication complexity. Secondly, we design a mechanism for dynamic node joining and exiting to improve system performance and scalability. Finally, we verify the performance and fault tolerance of the GR-PBFT algorithm through theoretical analysis and large-scale simulation experiments on the Fabric platform. The results show that GR-PBFT achieves a maximum 49.6% improvement in throughput, a 45.5% reduction in latency, and a 32% improvement in transaction success rate compared to PBFT. Particularly, when the number of nodes exceeds the threshold, PBFT performance drastically declines, whereas GR-PBFT remains relatively stable, demonstrating better performance and reliability.

show abstract

“…To evaluate the NetDAO security rating algorithm, we implement the algorithm and compare its performance with state-of-the-art algorithms in terms of the algorithm time. In particular, the practical Byzantine fault tolerance (PBFT) algorithm is compared as a baseline because that algorithm is widely used due to its good performance in terms of latency, resource requirements and node scalability, as well as node complexity [48]. Due to the limited number of nodes in our experiments, the time spent by security rating algorithm is simulated using a Python script installed on each IoT node.…”

Section: The Rating Timementioning

confidence: 99%

NetDAO: Toward Trustful and Secure IoT Networks without Central Gateways

et al. 2022

View full text Add to dashboard Cite

The Internet of Things (IoT) suffers from a profound lack of trust between central gateways and sensors, e.g., gateways suspect sensors of flooding malicious packets, and vice versa, sensors suspect gateways of manipulating traffic data. One important reason for the mistrust is the asymmetry of a centralized network organization. A Decentralized Autonomous Organization (DAO) can establish a trustful and symmetric network with the blockchain. However, it is a vacant area for IoT networks to build trust between gateways and sensors within the DAO. In this paper, we firstly propose a trustful and secure IoT Network DAO solution (NetDAO) to mitigate the data manipulation and the malicious flooding packets. In particular, the NetDAO has a security rating algorithm to assign a reputation value for each entity in the network. Based on this, each entity can mitigate the malicious flooding packets using a proof-of-reputation packet-forwarding mechanism. In addition, the NetDAO stores traffic data using the blockchain to mitigate the data manipulation. The experimental results show that the NetDAO effectively mitigates malicious flooding packets and costs 1 s for ∼480 entities to complete the rating algorithm.

show abstract

Research on PBFT consensus algorithm for grouping based on feature trust

Cited by 18 publications

References 29 publications

An Improved Byzantine Fault-Tolerant Algorithm Based on Reputation Model

An Improved Byzantine Fault-Tolerant Algorithm Based on Reputation Model

A Study on Practical Byzantine Algorithms Based on Short Group Signatures

NetDAO: Toward Trustful and Secure IoT Networks without Central Gateways

Contact Info

Product

Resources

About