Optimal time Byzantine agreement for t n/8 with linear-messages

Authors:
Arkady Zamsky;Amos Israeli;Shlomit S. Pinter
Affiliations:
Department of Electrical Engineering, Technion, Israel Institute of Technology, Haifa 32000, Israel;Department of Electrical Engineering, Technion, Israel Institute of Technology, Haifa 32000, Israel;Department of Electrical Engineering, Technion, Israel Institute of Technology, Haifa 32000, Israel
Venue:
Distributed Computing
Year:
1995

Citing 8
Cited 2

Shifting gears: changing algorithms on the fly to expedite Byzantine agreement

PODC '87 Proceedings of the sixth annual ACM Symposium on Principles of distributed computing
Early stopping in Byzantine agreement

Journal of the ACM (JACM)
Message-optimal protocols for byzantine agreement (extended abstract)

PODC '91 Proceedings of the tenth annual ACM symposium on Principles of distributed computing
Bounds on information exchange for Byzantine agreement

Journal of the ACM (JACM)
Reaching Agreement in the Presence of Faults

Journal of the ACM (JACM)
Efficient Distributed Consensus with n = (3 + epsilon) t Processors (Extended Abstract)

WDAG '91 Proceedings of the 5th International Workshop on Distributed Algorithms
Optimal Early Stopping in Distributed Consensus (Extended Abstract)

WDAG '92 Proceedings of the 6th International Workshop on Distributed Algorithms
Families of Consensus Algorithms

AWOC '88 Proceedings of the 3rd Aegean Workshop on Computing: VLSI Algorithms and Architectures

An randomized Byzantine agreement protocol with constant expected time and guaranteed termination in optimal (deterministic) time

PODC '96 Proceedings of the fifteenth annual ACM symposium on Principles of distributed computing
A flexible formal framework for masking/demasking faults

Information Sciences—Informatics and Computer Science: An International Journal

Quantified Score

Hi-index	0.00

Visualization

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.