A Byzantine Fault-Tolerant Raft Algorithm Combined with Schnorr Signature

Tian, Sihan; Liu, Yun; Zhang, Yansong; Zhao, Yingsi

doi:10.1109/imcom51814.2021.9377376

Cited by 15 publications

(2 citation statements)

References 7 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…To address the aforementioned issues, researchers intend to optimize the PBFT algorithm's execution protocol. S-PBFT [14], scalable BFT [15], and EPBFT [16] are all examples of improved PBFT algorithms.…”

Section: Introductionmentioning

confidence: 99%

Fault Tolerance Byzantine Algorithm for Lower Overhead Blockchain

Almakki

AlSuwaidan

Khan

et al. 2022

Security and Communication Networks

View full text Add to dashboard Cite

A new algorithm for practical Byzantine fault tolerance (PBFT), called score-PBFT or S-PBFT, is proposed to solve the problems of high communication overhead and low algorithm efficiency. This algorithm is based on the characteristics of the consortium chain. The scoring mechanism for nodes is added. All the nodes are broken up into consensus nodes, candidate nodes, and early nodes. To make sure the consensus nodes are as reliable as possible, the nodes are changed dynamically based on how each node is behaving. Improved: the election method for the controller node has been changed. The node’s score and behaviour are used as the election basis to make the algorithm more stable. In this paper, we want to improve the consensus protocol’s execution process, cut down on how many nodes are involved in the consensus process, simplify it, and make it more efficient. Results show that, when compared with the PBFT algorithm, the S-PBFT algorithm has a shorter consensus delay, less communication overhead and throughput, and better consensus node reliability.

show abstract

Section: Introductionmentioning

confidence: 99%

Fault Tolerance Byzantine Algorithm for Lower Overhead Blockchain

Almakki

AlSuwaidan

Khan

et al. 2022

Security and Communication Networks

View full text Add to dashboard Cite

show abstract

“…Sihan T [11] proposed a consensus algorithm that was based on the Schnorr signature. It requires the client to sign the message before sending it to the leader in order to thwart any potential interference from the Byzantine leader; measures were taken to safeguard the logs.…”

Section: Related Workmentioning

confidence: 99%

P-Raft: An Efficient and Robust Consensus Mechanism for Consortium Blockchains

Zhang

Ren

et al. 2023

Electronics

View full text Add to dashboard Cite

With the rise in blockchain technology, consortium blockchains have garnered increasing attention in practical applications due to their decentralization and immutability. However, the performance of current consortium blockchains remains a significant obstacle to large-scale commercial adoption. The consensus algorithm, as a fundamental component of blockchain technology, plays a critical role in ensuring both security and efficiency. Unfortunately, most existing consensus algorithms for consortium blockchains are vote-based consensus algorithms, and the performance of vote-based consensus algorithms is largely limited by the performance of the leader node. Therefore, we present P-Raft: a high-performance consensus algorithm that builds upon the Raft algorithm and leverages node server performance evaluations. The primary objectives of this article included enhancing the efficiency of Leader processing, promoting the utilization of the consortium blockchain, and ensuring the robustness of Leader election. Specifically designed to meet the service requirements of consortium blockchain’s consensus mechanism, the P-Raft incorporated the Yasa model, which evaluated the instant machine performance of each node. The performance of each node is then associated with the election timeout, ensuring that nodes with superior performance are more likely to be chosen as Leaders. Additionally, we implemented a leader verification mechanism based on the Bohen-Lynn-Shacham (BLS) signature, which prevented malicious Byzantine nodes from becoming Leaders without receiving enough votes. Empirical findings show that the P-Raft can swiftly designate high-performing nodes as Leaders, thereby greatly improving service efficiency in the consensus process and the overall performance of the consensus mechanism. Ultimately, P-Raft is better equipped to meet the demands of consortium blockchain applications for large-scale transactions.

show abstract

Improved Raft Consensus Algorithm in High Real-Time and Highly Adversarial Environment

Wang

et al. 2021

Lecture Notes in Computer Science

View full text Add to dashboard Cite

A Byzantine Fault-Tolerant Raft Algorithm Combined with Schnorr Signature

Cited by 15 publications

References 7 publications

Fault Tolerance Byzantine Algorithm for Lower Overhead Blockchain

Fault Tolerance Byzantine Algorithm for Lower Overhead Blockchain

P-Raft: An Efficient and Robust Consensus Mechanism for Consortium Blockchains

Improved Raft Consensus Algorithm in High Real-Time and Highly Adversarial Environment

Contact Info

Product

Resources

About