Abstract
AbstractThis article presents an improved Byzantine fault tolerance algorithm to tolerate Byzantine faults rapidly by minimizing the load of the network with a minimum cost that provides a very simple methodology to design Byzantine fault tolerance (BFT) state machine replication protocol with the most favorable flexibility. Although, we have taken the initiative of fault tolerance from earlier works and conversely perform a different approach than them. Our protocol just requires replicas forffaults instead of in previous Byzantine protocols to mitigate the attacks by faulty primary and replicas. It also improves prior algorithms in terms of different parameters and requires fewer cryptographic techniques. Similar to previous BFT protocols, this protocol also guarantees correctness.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: Concurrency and Computation: Practice and Experience
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
