Paper
8 December 2022 Improvement of practical Byzantine fault tolerance algorithm based on node reputation value matching
Moxiang Cui, Ji Zhang, Qingshui Xue, Zhen Xue
Author Affiliations +
Proceedings Volume 12474, Second International Symposium on Computer Technology and Information Science (ISCTIS 2022); 124740C (2022) https://doi.org/10.1117/12.2653577
Event: Second International Symposium on Computer Technology and Information Science (ISCTIS 2022), 2022, Guilin, China
Abstract
Aiming at the problems of low consensus efficiency and low scalability in traditional Byzantine consensus algorithm, propose a Practical Byzantine Algorithm Based on Node Reputation Value Matching TMBFT (Trust-based on Node Reputation Value Matching). Select some consensus nodes for consensus voting according to the neighbor matching model. At the same time, a reputation value evaluation mechanism is introduced to supervise the consensus behavior of neighbor nodes. To sum up, compared with the traditional practical Byzantine fault-tolerant algorithm, the consensus algorithm based on node reputation value matching improves the consensus efficiency of the system, reduces the node overhead in the network, and enhances the stability and security of the system.
© (2022) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Moxiang Cui, Ji Zhang, Qingshui Xue, and Zhen Xue "Improvement of practical Byzantine fault tolerance algorithm based on node reputation value matching", Proc. SPIE 12474, Second International Symposium on Computer Technology and Information Science (ISCTIS 2022), 124740C (8 December 2022); https://doi.org/10.1117/12.2653577
Advertisement
Advertisement
RIGHTS & PERMISSIONS
Get copyright permission  Get copyright permission on Copyright Marketplace
KEYWORDS
Information security

Tolerancing

Computer science

Information science

Network security

Data storage

Databases

Back to Top