On expected constant-round protocols for Byzantine agreement

Journal of Computer and System Sciences

Volumn 75, Issue 2, 2009, Pages 91-112

  Katz, Jonathan ^a   Koo, Chiu Yuen ^a  

^a University of Maryland ^*  (United States)

Author keywords

Broadcast; Cryptography; Distributed computing; Secure computation

Indexed keywords

BROADCASTING; CRYPTOGRAPHY; DISTRIBUTED COMPUTER SYSTEMS; PUBLIC KEY CRYPTOGRAPHY;

BYZANTINE AGREEMENT; POINT-TO-POINT NETWORK; PUBLIC KEY INFRASTRUCTURE; SECURE COMPUTATION; SEQUENTIAL COMPOSITIONS; SIGNATURE SCHEME; TECHNICAL TOOLS;

NETWORK SECURITY;

EID: 58149153139     PISSN: 00220000     EISSN: 10902724     Source Type: Journal    
DOI: 10.1016/j.jcss.2008.08.001     Document Type: Article

References (46)

1. Beaver D., and Haber S. Cryptographic protocols provably secure against dynamic adversaries. Advances in Cryptology - Eurocrypt '92. Lecture Notes in Comput. Sci. vol. 658 (1993), Springer-Verlag 307-323
2. D. Beaver, S. Micali, P. Rogaway, The round complexity of secure protocols, in: 22nd Annual ACM Symposium on Theory of Computing (STOC), 1990, pp. 503-513
3. M. Ben-Or, Another advantage of free choice: Completely asynchronous agreement protocols, in: 2nd Annual ACM Symposium on Principles of Distributed Computing (PODC), 1983, pp. 27-30
4. Ben-Or M., and El-Yaniv R. Resilient-optimal interactive consistency in constant time. Distrib. Comput. 16 4 (2003) 249-262
5. M. Ben-Or, S. Goldwasser, A. Wigderson, Completeness theorems for non-cryptographic fault-tolerant distributed computation, in: 20th Annual ACM Symposium on Theory of Computing (STOC), 1988, pp. 1-10
6. M. Ben-Or, E. Pavlov, V. Vaikuntanathan, Byzantine agreement in the full-information model in O (log n) rounds, in: 38th Annual ACM Symposium on Theory of Computing (STOC), 2006, pp. 179-186
7. Blakley G. Safeguarding cryptographic keys. National Computer Conference. Lecture Notes in Comput. Sci. vol. 48 (1979), AFIPS Press 313-317
8. Bracha G. An O (log n) expected rounds randomized Byzantine generals protocol. J. ACM 34 4 (1987) 910-920
9. Cachin C., Kursawe K., and Shoup V. Random oracles in Constantinople: Practical asynchronous Byzantine agreement using cryptography. J. Cryptology 18 3 (2005) 219-246
10. R. Canetti, Universally composable security: A new paradigm for cryptographic protocols, in: 42nd Annual IEEE Symposium on Foundations of Computer Science (FOCS), 2001, pp. 136-145
11. R. Canetti, U. Feige, O. Goldreich, M. Naor, Adaptively secure multi-party computation, in: 28th Annual ACM Symposium on Theory of Computing (STOC), 1996, pp. 639-648
12. Chor B., and Coan B. A simple and efficient randomized Byzantine agreement algorithm. IEEE Trans. Softw. Eng. 11 6 (1985) 531-539
13. B. Chor, S. Goldwasser, S. Micali, B. Awerbuch, Verifiable secret sharing and achieving simultaneity in the presence of faults, in: 26th Annual IEEE Symposium on the Foundations of Computer Science (FOCS), 1985, pp. 383-395
14. Cramer R., Damgård I., Dziembowski S., Hirt M., and Rabin T. Efficient multiparty computations secure against an adaptive adversary. Advances in Cryptology - Eurocrypt '99. Lecture Notes in Comput. Sci. vol. 1592 (1999), Springer-Verlag 311-326
15. Damgård I., and Ishai Y. Constant-round multiparty computation using a black-box pseudorandom generator. Advances in Cryptology - Crypto 2005. Lecture Notes in Comput. Sci. vol. 3621 (2005), Springer-Verlag 378-394
16. Dolev D., and Strong H. Authenticated algorithms for Byzantine agreement. SIAM J. Comput. 12 4 (1983) 656-666
17. Dwork C., Shmoys D., and Stockmeyer L. Flipping persuasively in constant time. SIAM J. Comput. 19 3 (1990) 472-499
18. P. Feldman, Optimal algorithms for Byzantine agreement, PhD thesis, Massachusetts Institute of Technology, 1988
19. P. Feldman, S. Micali, Byzantine agreement in constant expected time (and trusting no one), in: 26th Annual IEEE Symposium on the Foundations of Computer Science (FOCS), 1985, pp. 267-276
20. Feldman P., and Micali S. An optimal probabilistic protocol for synchronous Byzantine agreement. SIAM J. Comput. 26 4 (1997) 873-933
21. Fischer M.J., and Lynch N.A. A lower bound for the time to assure interactive consistency. Inform. Process. Lett. 14 4 (1982) 183-186
22. M. Fitzi, J. Garay, Efficient player-optimal protocols for strong and differential consensus, in: 22nd Annual ACM Symposium on Principles of Distributed Computing (PODC), 2003, pp. 211-220
23. Fitzi M., Garay J., Gollakota S., Rangan C.P., and Srinathan K. Round-optimal and efficient verifiable secret sharing. 3rd Theory of Cryptography Conference (TCC). Lecture Notes in Comput. Sci. vol. 3876 (2006), Springer-Verlag 329-342
24. M. Fitzi, U. Maurer, From partial consistency to global broadcast, in: 32nd Annual ACM Symposium on Theory of Computing (STOC), 2000, pp. 494-503
25. J. Garay, J. Katz, C.-Y. Koo, R. Ostrovsky, Round complexity of authenticated broadcast with a dishonest majority, in: 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS), 2007, pp. 658-668
26. Garay J.A., and Moses Y. Fully polynomial Byzantine agreement for n > 3 t processors in t + 1 rounds. SIAM J. Comput. 27 1 (1998) 247-290
27. R. Gennaro, Y. Ishai, E. Kushilevitz, T. Rabin, The round complexity of verifiable secret sharing and secure multicast, in: 33rd Annual ACM Symposium on Theory of Computing (STOC), 2001, pp. 580-589
28. Goldreich O. Foundations of Cryptography, vol. 2. Basic Applications (2004), Cambridge University Press
29. Goldwasser S., and Lindell Y. Secure computation without agreement. J. Cryptology 18 3 (2005) 247-287
30. S. Goldwasser, E. Pavlov, V. Vaikuntanathan, Fault-tolerant distributed computing in full-information networks, in: 47th Anuual IEEE Symposium on Foundations of Computer Science (FOCS), 2006, pp. 15-26
31. A. Hevia, D. Micciancio, Simultaneous broadcast revisited, in: 24th ACM Symposium on Principles of Distributed Computing (PODC), 2005, pp. 324-333
32. Katz J., and Koo C.-Y. Round-efficient secure computation in point-to-point networks. Advances in Cryptology - Eurocrypt 2007. Lecture Notes in Comput. Sci. vol. 4515 (2007), Springer-Verlag 311-328
33. Katz J., Koo C.-Y., and Kumaresan R. Improving the round complexity of VSS in point-to-point networks. 35th International Colloquium on Automata, Languages and Programming (ICALP). Lecture Notes in Comput. Sci. vol. 5126 (2008), Springer-Verlag 499-510
34. E. Kushilevitz, Y. Lindell, T. Rabin, Information-theoretically secure protocols and security under composition, in: 38th Annual ACM Symposium on Theory of Computing (STOC), 2006, pp. 109-118
35. Lamport L., Shostak R., and Pease M. The Byzantine generals problem. ACM Trans. Progr. Lang. Systems 4 3 (1982) 382-401
36. Y. Lindell, A. Lysyanskaya, T. Rabin, On the composition of authenticated Byzantine agreement, in: 34th Annual ACM Symposium on Theory of Computing (STOC), 2002, pp. 514-523
37. Y. Lindell, A. Lysyanskaya, T. Rabin, Sequential composition of protocols without simultaneous termination, in: 21st Annual ACM Symposium on Principles of Distributed Computing (PODC), 2002, pp. 203-212
38. Nielsen J.B. A threshold pseudorandom function construction and its applications. Advances in Cryptology - Crypto 2002. Lecture Notes in Comput. Sci. vol. 2442 (2002), Springer-Verlag 401-416
39. Pease M., Shostak R., and Lamport L. Reaching agreement in the presence of faults. J. ACM 27 2 (1980) 228-234
40. B. Pfitzmann, M. Waidner, Information-theoretic pseudosignatures and Byzantine agreement for t ≥ n / 3, Technical Report RZ 2882 (#90830), IBM Research, 1996
41. M. Rabin, Randomized Byzantine generals, in: 24th Annual IEEE Symposium on Foundations of Computer Science (FOCS), 1983, pp. 403-409
42. J. Rompel, One-way functions are necessary and sufficient for secure signatures, in: 22nd Annual ACM Symposium on Theory of Computing (STOC), 1990, pp. 387-394
43. Shamir A. How to share a secret. Comm. ACM 22 11 (1979) 612-613
44. S. Toueg, Randomized Byzantine agreements, in: 3rd Annual ACM Symposium on Principles of Distributed Computing (PODC), 1984, pp. 163-178
45. Turpin R., and Coan B. Extending binary Byzantine agreement to multivalued Byzantine agreement. Inform. Process. Lett. 18 2 (1984) 73-76. http://publications.csail.mit.edu/lcs/specpub.php?id=883 available at
46. M. Waidner, Byzantinische Verteilung ohne Kryptographische Annahmen trotz Beliebig Vieler Fehler, PhD thesis, University of Karlsruhe, 1991 (in German)