KEYWORDS: Information security, Tolerancing, Information science, Computer science, Network security, Telecommunications, Reliability, Information technology, Databases, Data storage
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.
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.