Paper
26 June 2023 Improved PBFT consensus algorithm based on RSA
Author Affiliations +
Proceedings Volume 12714, International Conference on Computer Network Security and Software Engineering (CNSSE 2023); 127141E (2023) https://doi.org/10.1117/12.2683170
Event: Third International Conference on Computer Network Security and Software Engineering (CNSSE 2023), 2023, Sanya, China
Abstract
Practical Byzantine Fault Tolerance (PBFT) for alliance chains is limited by high communication cost, which makes it unsuitable for more consensus networks. In view of the limitation of PBFT algorithm, a consensus algorithm of RPBFT is proposed. The RPBFT algorithm introduces RSA (Rivest-Shamir-Adleman) signature on the basis of PBFT algorithm, which not only increases the security, but also solves the high communication problem of PBFT algorithm and reduces the communication complexity to O(n). RPBFT also optimizes the consensus phase, shortens the consensus process and improves the efficiency of consensus. Experimental results show that RPBFT not only can effectively reduce the consensus delay, but also can improve the transaction throughput and scalability, which makes RPBFT more suitable for complex networks.
© (2023) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Pengliu Tan, Runshu Wang, Zhihui Tao, Teng Xu, Guangyong Xu, and Sijia Yang "Improved PBFT consensus algorithm based on RSA", Proc. SPIE 12714, International Conference on Computer Network Security and Software Engineering (CNSSE 2023), 127141E (26 June 2023); https://doi.org/10.1117/12.2683170
Advertisement
Advertisement
RIGHTS & PERMISSIONS
Get copyright permission  Get copyright permission on Copyright Marketplace
KEYWORDS
Blockchain

Symmetric-key encryption

Tolerancing

Computer security

Network security

Data communications

Receivers

RELATED CONTENT


Back to Top