An optimal probabilistic protocol for synchronous Byzantine agreement

SIAM Journal on Computing

Volumn 26, Issue 4, 1997, Pages 873-933

  Feldman, Pesech ^a,b   Micali, Silvio ^b  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^b OHR SOMAYACH   (Israel)

Author keywords

Broadcasting; Byzantine agreement; Fault tolerant computation; Randomization

Indexed keywords

BROADCASTING; FAILURE ANALYSIS; MATHEMATICAL MODELS; POLYNOMIALS; PROBABILITY; RANDOM PROCESSES;

OPTIMAL PROBABILISTIC PROTOCOL; PRIVATE COMMUNICATION LINE; SYNCHRONOUS NETWORKS;

NETWORK PROTOCOLS;

EID: 0031210863     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0097539790187084     Document Type: Article

References (37)

1. L. M. ADLEMAN AND M. A. HUANG, Recognizing primes in random polynomial time, in Proc. 19th ACM Symposium on Theory of Computing, ACM, New York, 1987, pp. 462-469.
2. D. BEAVER, S. MICALI, AND P. ROGAWAY, The round complexity of secure protocols, in Proc. 22th ACM Symposium on Theory of Computing, ACM, New York, 1990.
3. M. BEN-OR, S. GOLDWASSER, AND A. WIGDERSON, Completeness theorems for fault-tolerant distributed computing, in Proc. 20th ACM Symposium on Theory of Computing, ACM, New York, 1988, pp. 1-10.
4. M. BEN-OR AND R. EL-YANIV, Interactive consistency in constant time, Distrib. Comput., 1991, submitted.
5. M. BEN-OR, Another advantage of free choice: Completely asynchronous agreement protocols, in Proc. 2nd Annual Symposium on Principles of Distributed Computing, ACM, New York, 1983, pp. 27-30.
6. G. BRACHA, An "o(log n)" expected rounds randomized Byzantine generals protocol, in Proc. 17th ACM Symposium on Theory of Computing, ACM, New York, 1985.
7. R. CANETTI AND T. RABIN, Fast asynchronous agreement with optimal resilience, in Proc. 25th ACM Symposium on Theory of Computing, ACM, New York, 1993, pp. 42-51.
8. B. CHOR AND B. COAN, A simple and efficient randomized Byzantine agreement problem, IEEE Trans. Software Engrg., SE-11 (1985), pp. 531-539.
9. B. CHOR, S. GOLDWASSER, S. MICALI, AND B. AWERBUCH, Verifiable secret sharing and achieving simultaneity in the presence of faults, in Proc. 26th Annual IEEE Symposium on Foundations of Computer Science, IEEE Computer Society Press, Los Alamitos, CA, 1985, pp. 383-395.
10. D. CHAUM, C. CREPEAU, AND I. DAMGÅRD, Multi-party unconditionally secure protocols, in Proc. 20th ACM Symposium on Theory of Computing, ACM, New York, 1988.
11. B. CHOR AND C. DWORK, Randomization in Byzantine agreement, in Randomness and Computation, S. Micali, ed., JAI Press, Greenwich, CT, 1989, pp. 433-498.
12. D. DOLEV, M. FISCHER, R. FOWLER, N. LYNCH, AND H. STRONG, An efficient algorithm for Byzantine agreement without authentication, Inform. and Control, 52 (1982), pp. 257-274.
13. D. DOLEV, The Byzantine generals strike again, J. Algorithms, 3 (1982), pp. 14-30.
14. D. DOLEV AND C. DWORK, manuscript, 1987.
15. D. DOLEV, C. DWORK, AND M. NAOR, Non-malleable cryptography, in Proc. 23rd ACM Symposium on Theory of Computing, ACM, New York, 1993, pp. 542-552.
16. C. DWORK, D. SHMOYS, AND L. STOCKMEYER, Flipping persuasively in constant expected time, SIAM J. Comput., 19 (1990), pp. 472-499.
17. P. FELDMAN, Optimal algorithms for Byzantine agreement, Ph.D. thesis, Massachusetts Institute of Technology, Cambridge, MA, 1988.
18. P. FELDMAN AND S. MICALI, Byzantine agreement in constant expected time (and trusting no one), in Proc. 26th Annual IEEE Symposium on Foundations of Computer Science, IEEE Computer Society Press, Los Alamitos, CA, 1985, pp. 267-276.
19. M. FISCHER, The consensus problem in unreliable distributed systems (a brief survey), in Proc. International Conference on Foundations of Computation, 1983.
20. M. FISCHER AND N. LYNCH, A lower bound for the time to assure interactive consistency, Inform. Process. Lett., 14 (1982), pp. 183-186.
21. Z. GALIL, S. HABER, AND M. YUNG, Cryptographic computation: Secure falt-tolerant protocols and public-key model, in Proc. CRYPTO '87, Springer-Verlag, Berlin, 1987, pp. 135-155.
22. S. GOLDWASSER AND J. KILIAN, Almost all primes can be quickly certified, in Proc. 18th ACM Symposium on Theory of Computing, ACM, New York, 1986, pp. 316-329.
23. S. GOLDWASSER AND S. MICALI, Probabilistic encryption, J. Comput. System Sci., 28 (1984), pp. 270-299.
24. S. GOLDWASSER, S. MICALI, AND C. RACKOFF, The knowledge complexity of interactive proof-systems, SIAM. J. Comput., 18 (1989), pp. 186-208.
25. S. GOLDWASSER, S. MICALI, AND R. RIVEST, A digital signature scheme secure against adaptive chosen-message attacks, SIAM J. Comput., 17 (1988), pp. 281-308.
26. O. GOLDREICH, S. MICALI, AND A. WIGDERSON, How to play any mental game, or a completeness theorem for protocols with honest majority, in Proc. 19th ACM Symposium on Theory of Computing, ACM, New York, 1987, pp. 218-229.
27. 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.
28. A. KARLIN AND A. YAO, manuscript, 1987.
29. S. MICALI AND T. RABIN, Collective coin tossing without assumptions nor broadcasting, in Proc. CRYPTO '90, Springer-Verlag, Berlin, 1990, pp. 253-266.
30. S. MICALI AND P. ROGAWAY, Secure computation, in Proc. CRYPTO '91, Springer-Verlag, Berlin, 1992; full paper available from authors.
31. Y. MOSES AND O. WAARTS, Coordinated travel: (t + 1)-round Byzantine agreement in polynomial time, in Proc. 29th Annual IEEE Symposium on Foundations of Computer Science, IEEE Computer Society Press, Los Alamitos, CA, 1988, pp. 246-255.
32. M. PEASE, R. SHOSTAK, AND L. LAMPORT, Reaching agreement in the presence of faults, J. Assoc. Comput. Mach., 27 (1980), pp. 228-234.
33. M. RABIN, Probabilistic algorithms for testing primality, J. Number Theory, 12 (1980), pp. 128-138.
34. M. RABIN, Randomized Byzantine generals, in Proc. 24th Annual IEEE Symposium on Foundations of Computer Science, IEEE Computer Society Press, Los Alamitos, CA, 1983, pp. 403-409.
35. T. RABIN AND M. BEN-OR, Verifiable secret sharing and multiparty protocols with honest majority, in Proc. 21th ACM Symposium on Theory of Computing, ACM, New York, 1989.
36. R. SOLOVAY AND V. STRASSEN, A fast Monte-Carlo test for primality, SIAM J. Comput., 6 (1977), pp. 84-85.
37. R. TURPIN AND B. COAN, Extending binary Byzantine agreement to multivalued Byzantine agreement, Inform. Process. Lett., 18 (1984), pp. 73-76.