On the minimal synchronism needed for distributed consensus
Journal of the ACM (JACM)
The knowledge complexity of interactive proof-systems
STOC '85 Proceedings of the seventeenth annual ACM symposium on Theory of computing
An O(lg n) expected rounds randomized Byzantine generals protocol
STOC '85 Proceedings of the seventeenth annual ACM symposium on Theory of computing
Achieving consensus in fault-tolerant distributed computer systems: protocols, lower bounds, and simulations
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
Impossibility of distributed consensus with one faulty process
Journal of the ACM (JACM)
Reaching Agreement in the Presence of Faults
Journal of the ACM (JACM)
Simple constant-time consensus protocols in realistic failure models (extended abstract)
Proceedings of the fourth annual ACM symposium on Principles of distributed computing
Communications of the ACM
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
Simple constant-time consensus protocols in realistic failure models
Journal of the ACM (JACM)
Non-cryptographic fault-tolerant computing in constant number of rounds of interaction
Proceedings of the eighth annual ACM Symposium on Principles of distributed computing
Verifiable secret sharing and multiparty protocols with honest majority
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
The round complexity of secure protocols
STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
How to withstand mobile virus attacks (extended abstract)
PODC '91 Proceedings of the tenth annual ACM symposium on Principles of distributed computing
Perfectly secure message transmission
Journal of the ACM (JACM)
The consensus problem in fault-tolerant computing
ACM Computing Surveys (CSUR)
Fully polynomial Byzantine agreement in t + 1 rounds
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Fast asynchronous Byzantine agreement with optimal resilience
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Lower bounds for randomized mutual exclusion
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Fast perfection-information leader-election protocol with linear immunity
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Simple and efficient leader election in the full information model
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Robust sharing of secrets when the dealer is honest or cheating
Journal of the ACM (JACM)
Asynchronous secure computations with optimal resilience (extended abstract)
PODC '94 Proceedings of the thirteenth annual ACM symposium on Principles of distributed computing
Randomness-optimal sampling, extractors, and constructive leader election
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Distributed pseudo-random bit generators—a new way to speed-up shared coin tossing
PODC '96 Proceedings of the fifteenth annual ACM symposium on Principles of distributed computing
PODC '96 Proceedings of the fifteenth annual ACM symposium on Principles of distributed computing
Multi party computations: past and present
PODC '97 Proceedings of the sixteenth annual ACM symposium on Principles of distributed computing
Maintaining authenticated communication in the presence of break-ins
PODC '97 Proceedings of the sixteenth annual ACM symposium on Principles of distributed computing
PODC '97 Proceedings of the sixteenth annual ACM symposium on Principles of distributed computing
Randomness vs. fault-tolerance
PODC '97 Proceedings of the sixteenth annual ACM symposium on Principles of distributed computing
Simplified VSS and fast-track multiparty computations with applications to threshold cryptography
PODC '98 Proceedings of the seventeenth annual ACM symposium on Principles of distributed computing
From partial consistency to global broadcast
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Byzantine Agreement Secure against General Adversaries in the Dual Failure Model
Proceedings of the 13th International Symposium on Distributed Computing
Unconditionally Secure Proactive Secret Sharing Scheme with Combinatorial Structures
SAC '99 Proceedings of the 6th Annual International Workshop on Selected Areas in Cryptography
Community Formation via a Distributed, Privacy-Protecting Matchmaking System
Community Computing and Support Systems, Social Interaction in Networked Communities [the book is based on the Kyoto Meeting on Social Interaction and Communityware, held in Kyoto, Japan, in June 1998]
Robustness for Free in Unconditional Multi-party Computation
CRYPTO '01 Proceedings of the 21st Annual International Cryptology Conference on Advances in Cryptology
CRYPTO '91 Proceedings of the 11th Annual International Cryptology Conference on Advances in Cryptology
On Verification in Secret Sharing
CRYPTO '91 Proceedings of the 11th Annual International Cryptology Conference on Advances in Cryptology
Maintaining Security in the Presence of Transient Faults
CRYPTO '94 Proceedings of the 14th Annual International Cryptology Conference on Advances in Cryptology
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
Robust Distributed Multiplicaton with out Interaction
CRYPTO '99 Proceedings of the 19th Annual International Cryptology Conference on Advances in Cryptology
Optimal Resiliency Against Mobile Faults
FTCS '95 Proceedings of the Twenty-Fifth International Symposium on Fault-Tolerant Computing
Simple and Efficient Oracle-Based Consensus Protocols for Asynchronous Byzantine Systems
IEEE Transactions on Dependable and Secure Computing
Reliable broadcast in unknown fixed-identity networks
Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing
Orchestrating fair exchanges between mutually distrustful web services
Proceedings of the 3rd ACM workshop on Secure web services
Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing
Enhanced Fault-Tolerance through Byzantine Failure Detection
OPODIS '09 Proceedings of the 13th International Conference on Principles of Distributed Systems
Robust threshold DSS signatures
EUROCRYPT'96 Proceedings of the 15th annual international conference on Theory and application of cryptographic techniques
Cryptographic protocols provably secure against dynamic adversaries
EUROCRYPT'92 Proceedings of the 11th annual international conference on Theory and application of cryptographic techniques
Efficient multiparty computations secure against an adaptive adversary
EUROCRYPT'99 Proceedings of the 17th international conference on Theory and application of cryptographic techniques
Brief announcement: communication efficient asynchronous byzantine agreement
Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Efficient statistical asynchronous verifiable secret sharing with optimal resilience
ICITS'09 Proceedings of the 4th international conference on Information theoretic security
Algorithms and theory of computation handbook
Fast asynchronous consensus with optimal resilience
DISC'10 Proceedings of the 24th international conference on Distributed computing
Brief anouncement: simple gradecast based algorithms
DISC'10 Proceedings of the 24th international conference on Distributed computing
International Journal of Applied Cryptography
ScatterD: Spatial deployment optimization with hybrid heuristic/evolutionary algorithms
ACM Transactions on Autonomous and Adaptive Systems (TAAS)
Player-centric Byzantine agreement
ICALP'11 Proceedings of the 38th international colloquim conference on Automata, languages and programming - Volume Part I
Structured derivation of semi-synchronous algorithms
DISC'11 Proceedings of the 25th international conference on Distributed computing
A secure checkpointing protocol for survivable server design
ICDCIT'04 Proceedings of the First international conference on Distributed Computing and Internet Technology
EUROCRYPT'10 Proceedings of the 29th Annual international conference on Theory and Applications of Cryptographic Techniques
Optimal randomized fair exchange with secret shared coins
OPODIS'05 Proceedings of the 9th international conference on Principles of Distributed Systems
The vector-ballot approach for online voting procedures
Towards Trustworthy Elections
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
Brief announcement: all-to-all gradecast using coding with byzantine failures
PODC '12 Proceedings of the 2012 ACM symposium on Principles of distributed computing
All-to-All gradecast using coding with byzantine failures
SSS'12 Proceedings of the 14th international conference on Stabilization, Safety, and Security of Distributed Systems
Adaptive request batching for byzantine replication
ACM SIGOPS Operating Systems Review
TCC'13 Proceedings of the 10th theory of cryptography conference on Theory of Cryptography
| Hi-index | 0.00 |
We exhibit randomized Byzantine agreement (BA) algorithms achieving optimal running time and fault tolerance against all types of adversaries ever considered in the literature. Our BA algorithms do not require trusted parties, preprocessing, or non-constructive arguments.Given private communication lines, we show that n processors can reach BA in expected constant time in a syncronous network if any n/3 faults occurin an asynchronous network if any n/4 faults occurFor both synchronous and asynchronous networks whose lines do not guarantee private communication, we may use cryptography to obtain algorithms optimal both in fault tolerance and running time against computationally bounded adversaries. (Thus, in this setting, we tolerate up to n/3 faults even in an asynchronous network.)