An Efficient and Scalable Byzantine Fault-Tolerant Consensus Mechanism Based on Credit Scoring and Aggregated Signatures
Practical Byzantine Fault Tolerance (PBFT), a classic consensus algorithm in blockchain technology, is extensively used in consortium blockchain networks. However, it is challenged by issues such as low consensus efficiency, poor scalability, inability to guarantee throughput with large-scale node a...
Main Authors: | Shihua Tong, Jibing Li, Wei Fu |
---|---|
Format: | Article |
Language: | English |
Published: |
IEEE
2024-01-01
|
Series: | IEEE Access |
Subjects: | |
Online Access: | https://ieeexplore.ieee.org/document/10388297/ |
Similar Items
-
Study of Blockchains’s Consensus Mechanism Based on Credit
by: Yuhao Wang, et al.
Published: (2019-01-01) -
An Optimized Byzantine Fault Tolerance Algorithm for Medical Data Security
by: Gang Xu, et al.
Published: (2023-12-01) -
Grouped Multilayer Practical Byzantine Fault Tolerance Algorithm: A Practical Byzantine Fault Tolerance Consensus Algorithm Optimized for Digital Asset Trading Scenarios
by: Jian Liu, et al.
Published: (2023-11-01) -
Workload-based randomization byzantine fault tolerance consensus protocol
by: Baohua Huang, et al.
Published: (2022-09-01) -
Design of improved PBFT algorithm based on aggregate signature and node reputation
by: Jinhua Fu, et al.
Published: (2023-06-01)