Reaching Agreement in the Presence of Faults
Journal of the ACM (JACM)
The Weak Byzantine Generals Problem
Journal of the ACM (JACM)
The Byzantine Generals Problem
ACM Transactions on Programming Languages and Systems (TOPLAS)
A method for obtaining digital signatures and public-key cryptosystems
Communications of the ACM
STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
Polynomial algorithms for multiple processor agreement
STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
Bounds on information exchange for Byzantine Agreement
PODC '82 Proceedings of the first ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Modular construction of nearly optimal Byzantine agreement protocols
Proceedings of the eighth 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
The consensus problem in fault-tolerant computing
ACM Computing Surveys (CSUR)
Byzantine Agreement in a Generalized Connected Network
IEEE Transactions on Parallel and Distributed Systems
Proceedings of the fourteenth annual ACM symposium on Parallel algorithms and architectures
Optimal Agreement Protocol in Malicious Faulty Processors and Faulty Links
IEEE Transactions on Knowledge and Data Engineering
On the Impact of Fast Failure Detectors on Real-Time Fault-Tolerant Systems
DISC '02 Proceedings of the 16th International Conference on Distributed Computing
Efficient Secure Multi-party Computation
ASIACRYPT '00 Proceedings of the 6th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
Adaptability and the Usefulness of Hints (Extended Abstract)
ESA '98 Proceedings of the 6th Annual European Symposium on Algorithms
Reaching agreement on an unknown network with partial graphic information
ACM SIGOPS Operating Systems Review
Hundreds of impossibility results for distributed computing
Distributed Computing - Papers in celebration of the 20th anniversary of PODC
Dual link fault diagnosis agreement
Journal of Systems and Software
Revisiting fault diagnosis agreement in a new territory
ACM SIGOPS Operating Systems Review
New application of reliable agreement: underlying an unsecured business environment
ACM SIGOPS Operating Systems Review
Fast and simple distributed consensus
Distributed Computing
Fast consensus in networks of bounded degree
Distributed Computing
Efficient agreement using fault diagnosis
Distributed Computing
Optimal time Byzantine agreement for t n/8 with linear-messages
Distributed Computing
Streets of consensus under unknown unreliable network
ACM SIGOPS Operating Systems Review
Optimally efficient multi-valued byzantine agreement
Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing
A self-adjusting algorithm for byzantine agreement
Distributed Computing
Robust gossiping with an application to consensus
Journal of Computer and System Sciences
Eventually Dual Failure Agreement
Fundamenta Informaticae
Constant-Space Localized Byzantine Consensus
DISC '08 Proceedings of the 22nd international symposium on Distributed Computing
An early fault diagnosis agreement under hybrid fault model
Expert Systems with Applications: An International Journal
Gossiping by processors prone to omission failures
Information Processing Letters
Fast scalable deterministic consensus for crash failures
Proceedings of the 28th ACM symposium on Principles of distributed computing
Locally scalable randomized consensus for synchronous crash failures
Proceedings of the twenty-first annual symposium on Parallelism in algorithms and architectures
Computer Standards & Interfaces
Byzantine Agreement under dual failure mobile network
Computer Standards & Interfaces
Computers and Electrical Engineering
The anatomy study of consensus agreement in MANETs
Computers and Electrical Engineering
Modular construction of a Byzantine agreement protocol with optimal message bit complexity
Information and Computation
International Journal of Systems, Control and Communications
From almost everywhere to everywhere: byzantine agreement with Õ(n³/²) bits
DISC'09 Proceedings of the 23rd international conference on Distributed computing
Breaking the O(n2) bit barrier: scalable byzantine agreement with an adaptive adversary
Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Scalable byzantine computation
ACM SIGACT News
Scalable quantum consensus for crash failures
DISC'10 Proceedings of the 24th international conference on Distributed computing
Breaking the O(n2) bit barrier: Scalable byzantine agreement with an adaptive adversary
Journal of the ACM (JACM)
Error-free multi-valued consensus with byzantine failures
Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Time and communication efficient consensus for crash failures
DISC'06 Proceedings of the 20th international conference on Distributed Computing
Error-free multi-valued broadcast and byzantine agreement with optimal communication complexity
OPODIS'11 Proceedings of the 15th international conference on Principles of Distributed Systems
Eventually Dual Failure Agreement
Fundamenta Informaticae
Efficient Diagnosis Protocol to Enhance the Reliability of a Cloud Computing Environment
Journal of Network and Systems Management
On the communication surplus incurred by faulty processors
DISC'07 Proceedings of the 21st international conference on Distributed Computing
Scalable byzantine agreement with a random beacon
SSS'12 Proceedings of the 14th international conference on Stabilization, Safety, and Security of Distributed Systems
Asynchronous computational VSS with reduced communication complexity
CT-RSA'13 Proceedings of the 13th international conference on Topics in Cryptology
Proceedings of the 2013 ACM symposium on Principles of distributed computing
Early-deciding consensus is expensive
Proceedings of the 2013 ACM symposium on Principles of distributed computing
Proceedings of the 2013 ACM symposium on Principles of distributed computing
Distributing trusted third parties
ACM SIGACT News
Hi-index | 0.01 |
Byzantine Agreement has become increasingly important in establishing distributed properties when errors may exist in the systems. Recent polynomial algorithms for reaching Byzantine Agreement provide us with feasible solutions for obtaining coordination and synchronization in distributed systems. In this paper the amount of information exchange necessary to ensure Byzantine Agreement is studied. This is measured by the total number of messages the participating processors have to send in the worst case. In algorithms that use a signature scheme, the number of signatures appended to messages are also counted.First it is shown that &OHgr;(nt) is a lower bound for the number of signatures for any algorithm using authentication, where n denotes the number of processors and t the upper bound on the number of faults the algorithm is supposed to handle. For algorithms that reach Byzantine Agreement without using authentication this is even a lower bound for the total number of messages. If n is large compared to t, these bounds match the upper bounds from previously known algorithms. For the number of messages in the authenticated case we prove the lower bound &OHgr;(n + t2). Finally algorithms that achieve this bound are presented.