Abstract
This paper presents a Byzantine Agreement protocol with n = 8t + 1, optimal number of rounds (namely min {f + 2, t + 1} where f is number of actual faults), and messages of linear size (namely m ≤ n + O(log n), where m stands for message size). All previous protocols that stop in optimal time and tolerate t = O(n) faults require messages of size at least O(n2). The new protocol uses a novel technique called Reconstructed Traversal which is based on the Reconstruction Principle and on the Coordinated Traversal protocol.
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 callDisclaimer: 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.
