Fully polynomial byzantine agreement for n > 3t processors in t + 1 rounds

SIAM Journal on Computing

Volumn 27, Issue 1, 1998, Pages 247-290

  Garay, Juan A ^a,b   Moses, Yoram ^b  

^a IBM T J WATSON RESEARCH CENTER   (United States)

^b WEIZMANN INSTITUTE OF SCIENCE   (Israel)

Author keywords

Byzantine agreement; Computer security; Consensus; Distributed computing; Fault tolerance

Indexed keywords

EID: 0012525797     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0097539794265232     Document Type: Article

References (33)

1. A. BAR-NOY AND D. DOLEV, Consensus algorithms with one-bit messages, Distrib. Comput., 4 (1991), pp. 105-110. Preliminary version appeared as Families of consensus algorithms, in Proc. 3rd Aegean Workshop on Computing, Lecture Notes in Comput. Sci. 319, Springer-Verlag, New York, 1988, pp. 380-390.
2. A. BAR-NOY AND D. DOLEV, Consensus algorithms with one-bit messages, Distrib. Comput., 4 (1991), pp. 105-110. Preliminary version appeared as Families of consensus algorithms, in Proc. 3rd Aegean Workshop on Computing, Lecture Notes in Comput. Sci. 319, Springer-Verlag, New York, 1988, pp. 380-390.
3. A. BAR-NOY, D. DOLEV, C. DWORK, AND H. R. STRONG, Shifting gears: Changing algorithms on the fly to expedite Byzantine agreement, Inform, and Comput., 97 (1992), pp. 205-233.
4. P. BERMAN AND J. A. GARAY, Cloture votes: n/4-resilient distributed consensus in t + 1 rounds, Math. Systems Theory, Ray Strong, ed., 26 (1993), pp. 3-20; special issue dedicated to fault-tolerant distributed algorithms.
5. P. BERMAN AND J. A. GARAY, Efficient distributed consensus with n = (3 + ε)t processors, in Proc. 5th Internat. Workshop on Distributed Algorithms, Lecture Notes in Comput. Sci. 579, Springer-Verlag, New York, 1991, pp. 129-142.
6. P. BERMAN AND J. A. GARAY, private communication, 1992.
7. P. BERMAN, J. A. GARAY, AND K. J. PERRY, Towards optimal distributed consensus, in Proc. 30th IEEE Symposium on the Foundations of Computer Science, IEEE Computer Society Press, Los Alamitos, CA, 1989, pp. 410-415.
8. P. BERMAN, J. A. GARAY, AND K. J. PERRY, Optimal early stopping in distributed consensus, in Proc. 6th Internat. Workshop on Distributed Algorithms, Lecture Notes in Comput. Sci. 647, Springer-Verlag, New York, 1992, pp. 221-237.
9. B. COAN, A communication-efficient canonical form for fault-tolerant distributed protocols, in Proc. 5th ACM Symposium on the Principles of Distributed Computing, ACM, New York, 1986, pp. 63-72.
10. B. COAN, Efficient agreement using fault diagnosis, Distrib. Comput., 7 (1993), pp. 87-98; also in Proc. 26th Allerton Conference on Communication, Control and Computing, University of Illinois, Urbana, IL, 1988, pp. 663-672.
11. B. COAN, Efficient agreement using fault diagnosis, Distrib. Comput., 7 (1993), pp. 87-98; also in Proc. 26th Allerton Conference on Communication, Control and Computing, University of Illinois, Urbana, IL, 1988, pp. 663-672.
12. B. COAN AND J. WELCH, Modular construction of an efficient 1-Bit Byzantine agreement protocol, Math. Systems Theory, H. R. Strong, ed., 26 (1993), pp. 131-154; special issue dedicated to fault-tolerant distributed algorithms.
13. D. DOLEV, M. J. FISCHER, R. FOWLER, N. A. LYNCH, AND H. R. STRONG, An efficient algorithm for Byzantine agreement without authentication, Inform. and Control, 52 (1982), pp. 257-274.
14. C. DWORK AND Y. MOSES, Knowledge and common knowledge in a Byzantine environment: Crash failures, Inform, and Comput., 88 (1990), pp. 156-186.
15. D. DOLEV, R. REISCHUK, AND H. R. STRONG, Early Stopping in Byzantine Agreement, IBM Research Report RJ5406 (55357), IBM Almaden Research Center, San Jose, CA, 1986; revised version appears in J. Assoc. Comput. Mach., 37 (1990), pp. 720-741.
16. D. DOLEV, R. REISCHUK, AND H. R. STRONG, Early Stopping in Byzantine Agreement, IBM Research Report RJ5406 (55357), IBM Almaden Research Center, San Jose, CA, 1986; revised version appears in J. Assoc. Comput. Mach., 37 (1990), pp. 720-741.
17. D. DOLEV AND H. R. STRONG, Polynomial algorithms for multiple processor agreement, in Proc. 14th Annual Symposium on Theory of Computing, ACM, New York, 1982, pp. 401-407.
18. M. J. FISCHER, The Consensus Problem in Unreliable Distributed Systems (A Brief Survey), Yale University Technical Report YALEU/DCS/RR-273, New Haven, CT, 1983.
19. M. J. FISCHER AND N. A. LYNCH, A lower bound for the time to assure interactive consistency, Inform. Process. Lett., 14 (1982), pp. 183-186.
20. P. FELDMAN AND S. MICALI, Optimal algorithms for Byzantine agreement, in Proc. of the 20th Annual Symposium on Theory of Computing, ACM, New York, 1988, pp. 148-161.
21. J. A. GARAY AND Y. MOSES, Fully polynomial Byzantine agreement in t+1 rounds, in Proc. of the 25th Annual ACM Symposium on Theory of Computing, ACM, New York, 1993, pp. 31-41.
22. O. GOLDREICH AND E. PETRANK, The best of both worlds: Guaranteeing termination in fast randomized Byzantine agreement protocols, Inform. Process. Lett., 36 (1990), pp. 45-49.
23. L. LAMPORT, R. E. SHOSTAK, AND M. PEASE, The Byzantine generals problem, ACM Trans. Prog. Lang, and Systems, 4 (1982), pp. 382-401.
24. Y. MOSES AND O. WAARTS, Coordinated traversal: (t + 1)-round Byzantine agreement in polynomial time, J. Algorithms, 17 (1994), pp. 110-156; an extended abstract appeared in Proc. 29th IEEE Symposium on the Foundations of Computer Science, IEEE Computer Society Press, Los Alamitos, CA, 1988, pp. 246-255.
25. Y. MOSES AND O. WAARTS, Coordinated traversal: (t + 1)-round Byzantine agreement in polynomial time, J. Algorithms, 17 (1994), pp. 110-156; an extended abstract appeared in Proc. 29th IEEE Symposium on the Foundations of Computer Science, IEEE Computer Society Press, Los Alamitos, CA, 1988, pp. 246-255.
26. M. PEASE, R. SHOSTAK, AND L. LAMPORT, Reaching agreement in the presence of faults, J. Comput. Mach., 27 (1980), pp. 121-169.
27. M. RABIN, Randomized Byzantine generals, in Proc. 24th IEEE Symposium on the Foundations of Computer Science, IEEE Computer Society Press, Los Alamitos, CA, 1983, pp. 403-409.
28. S. TOUEG, K. J. PERRY, AND T. K. SRIKANTH, Fast distributed agreement, SIAM J. Comput., 16 (1987), pp. 445-457.
29. O. WAARTS, Coordinated traversal: Byzantine Agreement in Polynomial Time, M. Sc. thesis, Weizmann Institute of Science, Rehovot, Israel, 1988.
30. A. ZAMSKY, New Algorithms for Agreement in Synchronous Distributed Networks, M. Sc. thesis, Technion - Israel Institute of Technology, Haifa, Israel, 1992.
31. A. ZAMSKY, A randomized Byzantine agreement protocol with constant expected time and guaranteed termination in optimal (deterministic) time, in Proc. 15th Annual ACM Symposium on Priniciples of Distributed Computing, ACM, New York, 1996, pp. 201-208.
32. A. ZAMSKY, A. ISRAELI, AND S. PINTER, Optimal time Byzantine agreement for t < n/8, Distrib. Comput., 9 (1995), pp. 95-108.
33. H. ATTIYA, C. DWORK, N. LYNCH, AND L. STOCKMEYER, Bounds on the time to reach agreement in the presence of timing uncertainty, J. Assoc. Comput. Mach., 41 (1994), pp. 122-152.