Reaching Agreement in the Presence of Faults
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
Highly available systems for database applications
ACM Computing Surveys (CSUR)
How to assign votes in a distributed system
Journal of the ACM (JACM)
Applications of Byzantine agreement in database systems
ACM Transactions on Database Systems (TODS)
Reaching approximate agreement in the presence of faults
Journal of the ACM (JACM)
A communication-efficient canonical form for fault-tolerant distributed protocols
PODC '86 Proceedings of the fifth annual ACM symposium on Principles of distributed computing
An O(lg n) expected rounds randomized Byzantine generals protocol
STOC '85 Proceedings of the seventeenth annual ACM symposium on Theory of computing
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
An O(log n) expected rounds randomized byzantine generals protocol
Journal of the ACM (JACM)
Reliable scheduling in a TMR database system
ACM Transactions on Computer Systems (TOCS)
Completeness theorems for non-cryptographic fault-tolerant distributed computation
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Multiparty unconditionally secure protocols
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Simple constant-time consensus protocols in realistic failure models
Journal of the ACM (JACM)
On the improbability of reaching Byzantine agreements
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
Lower bounds for wait-free computation in message-passing systems
PODC '90 Proceedings of the ninth annual ACM symposium on Principles of distributed computing
Early stopping in Byzantine agreement
Journal of the ACM (JACM)
Fully polynomial Byzantine agreement in t + 1 rounds
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Bounds on information exchange for Byzantine agreement
Journal of the ACM (JACM)
Impossibility of distributed consensus with one faulty process
Journal of the ACM (JACM)
The unified structure of consensus: a layered analysis approach
PODC '98 Proceedings of the seventeenth annual ACM symposium on Principles of distributed computing
Simple constant-time consensus protocols in realistic failure models (extended abstract)
Proceedings of the fourth annual ACM symposium on Principles of distributed computing
Impossibility of distributed consensus with one faulty process
PODS '83 Proceedings of the 2nd ACM SIGACT-SIGMOD symposium on Principles of database systems
A recovery algorithm for a distributed database system
PODS '83 Proceedings of the 2nd ACM SIGACT-SIGMOD symposium on Principles of database systems
Optimal termination protocols for network partitioning
PODS '83 Proceedings of the 2nd ACM SIGACT-SIGMOD symposium on Principles of database systems
New Perspectives in Distributed Computing
MFCS '99 Proceedings of the 24th International Symposium on Mathematical Foundations of Computer Science
A New Synchronous Lower Bound for Set Agreement
DISC '01 Proceedings of the 15th International Conference on Distributed Computing
Finding safe paths in a faulty environment
PODC '82 Proceedings of the first ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Bounds on information exchange for Byzantine Agreement
PODC '82 Proceedings of the first ACM SIGACT-SIGOPS symposium on Principles of distributed computing
The inherent cost of nonblocking commitment
PODC '83 Proceedings of the second annual ACM symposium on Principles of distributed computing
PODC '83 Proceedings of the second annual ACM symposium on Principles of distributed computing
Another advantage of free choice (Extended Abstract): Completely asynchronous agreement protocols
PODC '83 Proceedings of the second annual ACM symposium on Principles of distributed computing
PODC '83 Proceedings of the second annual ACM symposium on Principles of distributed computing
Elections in the presence of faults
PODC '84 Proceedings of the third annual ACM symposium on Principles of distributed computing
Randomized Byzantine Agreements
PODC '84 Proceedings of the third annual ACM symposium on Principles of distributed computing
ACM SIGOPS Operating Systems Review
Optimal Resiliency Against Mobile Faults
FTCS '95 Proceedings of the Twenty-Fifth International Symposium on Fault-Tolerant Computing
Fault Tolerance in Collaborative Sensor Networks for Target Detection
IEEE Transactions on Computers
Uniform consensus is harder than consensus
Journal of Algorithms
Knowledge and common knowledge in a byzantine environment I: crash failures
TARK '86 Proceedings of the 1986 conference on Theoretical aspects of reasoning about knowledge
Fast consensus in networks of bounded degree
Distributed Computing
Self-stabilizing byzantine agreement
Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing
A self-adjusting algorithm for byzantine agreement
Distributed Computing
Agreement in synchronous networks with ubiquitous faults
Theoretical Computer Science
Realistic Failures in Secure Multi-party Computation
TCC '09 Proceedings of the 6th Theory of Cryptography Conference on Theory of Cryptography
On the round complexity of Byzantine agreement without initial set-up
Information and Computation
Two-threshold broadcast and detectable multi-party computation
EUROCRYPT'03 Proceedings of the 22nd international conference on Theory and applications of cryptographic techniques
MPC vs. SFE: perfect security in a unified corruption model
TCC'08 Proceedings of the 5th conference on Theory of cryptography
Fast asynchronous consensus with optimal resilience
DISC'10 Proceedings of the 24th international conference on Distributed computing
Transforming worst-case optimal solutions for simultaneous tasks into all-case optimal solutions
Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Player-centric Byzantine agreement
ICALP'11 Proceedings of the 38th international colloquim conference on Automata, languages and programming - Volume Part I
Synchronous consensus under hybrid process and link failures
Theoretical Computer Science
The contest between simplicity and efficiency in asynchronous byzantine agreement
DISC'11 Proceedings of the 25th international conference on Distributed computing
Stabilizing consensus in mobile networks
DCOSS'06 Proceedings of the Second IEEE international conference on Distributed Computing in Sensor Systems
Majority and unanimity in synchronous networks with ubiquitous dynamic faults
SIROCCO'05 Proceedings of the 12th international conference on Structural Information and Communication Complexity
EUROCRYPT'10 Proceedings of the 29th Annual international conference on Theory and Applications of Cryptographic Techniques
Efficient multi-party computation with dispute control
TCC'06 Proceedings of the Third conference on Theory of Cryptography
Universally composable synchronous computation
TCC'13 Proceedings of the 10th theory of cryptography conference on Theory of Cryptography
On the complexity of asynchronous agreement against powerful adversaries
Proceedings of the 2013 ACM symposium on Principles of distributed computing
| Hi-index | 0.00 |
Reaching agreement in a distributed system while handling malfunctioning behavior is a central issue for reliable computer systems. All previous algorithms for reaching the agreement required an exponential number of messages to be sent, with or without authentication. We give polynomial algorithms for reaching (Byzantine) agreement, both with and without the use of authentication protocols. We also prove that no matter what kind of information is exchanged, there is no way to reach agreement with fewer than t+1 rounds of exchange, where t is the upper bound on the number of faults.