Danny Dolev
ABSTRACT
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.
- 1.W. Diffie and M. Hellman, "New direction in cryptography," IEEE Trans. on Inform. IT-22,6(1976), 644-654.Google Scholar
Digital Library
- 2.D. Dolev, "The Byzantine Generals Strike Again," Journal of Algorithms, vol. 3, no. 1, 1982.Google ScholarCross Ref
- 3.D. Dolev, "Unanimity in an Unknown and Unreliable Environment," 22nd Annual Symposium on Foundations of Computer Science, pp. 159-168, 1981.Google Scholar
- 4.D. Dolev and H. R. Strong, "Authenticated Algorithms for Byzantine Agreement," submitted for publication; see also "Polynomial algorithms for multiple processor agreement," IBM Research Report RJ3342 {1981).Google Scholar
- 5.R. A. DeMillo, N. A. Lynch, and M. Merritt, "Cryptographic Protocols," in these proceedings.Google Scholar
- 6.L. Lamport, "Using Time Instead of Timeout for Fault-Tolerant Distributed Systems," Technical Report, Computer Science Laboratory, SRI International, 1981.Google Scholar
- 7.L. Lamport, R. Shostak, and M. Pease, "The Byzantine Generals Problem," ACM Trans. on Programming Languages and Systems, to appear. Google ScholarDigital Library
- 8.N. Lynch, and M. Fischer, "A Lower Bound for the Time to Assure Interactive Consistency," submitted for publication.Google Scholar
- 9.M. Pease, R. Shostak, and L. Lamport, "Reaching Agreement in the Presence of Faults," JACM, vol. 27, no. 2, pp. 228-234, 1980. Google ScholarDigital Library
- 10.R. L. Rivest, A. Shamir, and L. Adleman, "A method for obtaining digital signatures and public-key cryptosystems," Comm. ACM 21 (1978), 120-126. Google ScholarDigital Library
Recommendations
Optimal Algorithms for Synchronous Byzantine k-Set Agreement
Stabilization, Safety, and Security of Distributed SystemsAbstractConsidering a system made up of n processes prone to Byzantine failures, k-set agreement allows each process to propose a value and decide a value such that at most k different values are decided by the correct (i.e., non-Byzantine) processes, in ...
The incremental agreement
To achieve reliable distributed systems, the fault-tolerance must be studied. One of the most important problems of fault-tolerance issues lies in the Byzantine Agreement (BA) problem. The primary issue surrounding BA is that fault-free processors must ...
Enabling service-level agreement renegotiation through extending WS-Agreement specification
WS-Agreement is a language and protocol designed for creating service-level agreements (SLAs) based on initial offers, and for monitoring those offers at runtime. The definition of WS-Agreement protocol is very general and does not contemplate the ...
Comments