Randomized Byzantine Agreements

Randomized algorithms for reaching Byzantine Agreement were recently proposed in [Rabi83]. With these algorithms, agreement is reached within an expected number of phases that is a small constant independent of the number of processes <italic>n</italic> and the number of faulty processes <italic>t</italic>. The algorithms in [Rabi83] tolerate up to [(<italic>n</italic>-1)/10] faulty processes in asynchronous systems, and up to [(<italic>n</italic>-1)/4] faulty processes in synchronous systems. In this paper, using the same computation model as in [Rabi83], we describe algorithms that overcome up to [(<italic>n</italic>-1)/3] faulty processes in asynchronous systems, and up to [(<italic>n</italic>-1)/2] faulty processes in synchronous systems. With both proposed algorithms, agreement is reached within an expected number of phases that is a small constant independent of <italic>n</italic> and <italic>t</italic>, but the communication complexity is higher than in [Rabi83]. It is also shown that no Byzantine Agreement algorithm can overcome more than [(<italic>n</italic>-1)/3] faulty processes in asynchronous authenticated systems, and hence the asynchronous algorithm proposed here is optimal in this respect.

[1]  Adi Shamir,et al.  How to share a secret , 1979, CACM.

[2]  Danny Dolev,et al.  Unanimity in an unknown and unreliable environment , 1981, 22nd Annual Symposium on Foundations of Computer Science (sfcs 1981).

[3]  Sam Toueg,et al.  An Authenticated Byzantine Generals Algorithm with Early Stopping , 1984 .

[4]  Leslie Lamport,et al.  The Byzantine Generals Problem , 1982, TOPL.

[5]  Brian A. Coan,et al.  Extending Binary Byzantine Agreement to Multivalued Byzantine Agreement , 1984, Inf. Process. Lett..

[6]  Danny Dolev,et al.  The Byzantine Generals Strike Again , 1981, J. Algorithms.

[7]  Sam Toueg,et al.  Resilient consensus protocols , 1983, PODC '83.

[8]  Leslie Lamport,et al.  Reaching Agreement in the Presence of Faults , 1980, JACM.

[9]  Nancy A. Lynch,et al.  Impossibility of distributed consensus with one faulty process , 1983, PODS '83.

[10]  Danny Dolev,et al.  Polynomial algorithms for multiple processor agreement , 1982, STOC '82.

[11]  Michael Ben-Or,et al.  Another advantage of free choice (Extended Abstract): Completely asynchronous agreement protocols , 1983, PODC '83.

[12]  Kenneth J. Perry.  Randomized Byzantine Agreement , 1985, IEEE Transactions on Software Engineering.

[13]  Gabriel Bracha,et al.  An asynchronous [(n - 1)/3]-resilient consensus protocol , 1984, PODC '84.

[14]  Nancy A. Lynch,et al.  Simple and efficient Byzantine generals algorithm , 1982 .

[15]  Danny Dolev,et al.  Authenticated Algorithms for Byzantine Agreement , 1983, SIAM J. Comput..

[16]  Michael O. Rabin,et al.  Randomized byzantine generals , 1983, 24th Annual Symposium on Foundations of Computer Science (sfcs 1983).