KEYWORDS: Blockchain, Symmetric-key encryption, Tolerancing, Network security, Computer security, Receivers, Data communications, Mathematical optimization, Internet of things, Information security
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.
Access to the requested content is limited to institutions that have purchased or subscribe to SPIE eBooks.
You are receiving this notice because your organization may not have SPIE eBooks access.*
*Shibboleth/Open Athens users─please
sign in
to access your institution's subscriptions.
To obtain this item, you may purchase the complete book in print or electronic format on
SPIE.org.
INSTITUTIONAL Select your institution to access the SPIE Digital Library.
PERSONAL Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.