On the composition of authenticated Byzantine Agreement

Journal of the ACM

Volumn 53, Issue 6, 2006, Pages 881-917

  Lindell, Yehuda ^a   Lysyanskaya, Anna ^b,d   Rabin, Tal ^c  

^a BAR ILAN UNIVERSITY   (Israel)

^b BROWN UNIVERSITY   (United States)

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

^d Brown Univerity   (United States)

Author keywords

Authenticated Byzantine Agreement; Lower bounds; Protocol composition; Randomized protocols

Indexed keywords

AUTHENTICATED BYZANTINE AGREEMENT; PROTOCOL COMPOSITION; RANDOMIZED PROTOCOLS;

COMMUNICATION CHANNELS (INFORMATION THEORY); COMPUTER NETWORKS; COMPUTER SIMULATION; ELECTRONIC DOCUMENT IDENTIFICATION SYSTEMS; NETWORK PROTOCOLS; POLYNOMIAL APPROXIMATION; PROBLEM SOLVING; PUBLIC KEY CRYPTOGRAPHY;

DISTRIBUTED COMPUTER SYSTEMS;

EID: 33847139020     PISSN: 00045411     EISSN: 1557735X     Source Type: Journal    
DOI: 10.1145/1217856.1217857     Document Type: Article

References (32)

1. BARAK, B. 2001. How to go beyond the black-box simulation barrier. In Proceedings of the 42nd Annual Symposium on Fundations of Computer Science. IEEE Computer Society Press, Los Alamitos, CA. pp. 106-115.
2. BARAK, B., LINDELL, Y., AND RABIN, T. 2004. A note on secure protocol initialization and setup in concurrent settings. Cryptology ePrint Archive, Report 2004/006.
3. BEAVER, D. 1991. Secure multi-party protocols and zero-knowledge proof systems tolerating a faulty minority. J. Crypt. 4, 2, 75-122.
4. BEN-OR, M., GOLDWASSER, S., AND WIGDERSON, A. 1988. Completeness theorems for noncryptographic fault-tolerant distributed computations. In Proceedings of the 20th Annual Symposium on Theory of Computing. ACM, New York, pp. 1-10.
5. CANETTI, R. 2000. Security and composition of multiparty cryptographic protocols. J. Crypt. 13, 1, 143-202.
6. CANETTI, R. 2001. Universally composable security: A new paradigm for cryptographic protocols. In Proceedings of the 42nd Annual Symposium on Fundations of Computer Science. IEEE Computer Society Press, Los Alamitos, CA. pp. 136-145.
7. CANETTI, R., KILIAN, J., PETRANK, E., AND ROSEN, A. 2001. Black-box concurrent zero-knowledge requires Ω̃(log n) rounds. In Proceedings of the 33rd Annual Symposium on Theory of Computing. ACM, New York, pp. 570-579.
8. CANETTI, R. AND RABIN, T. 2003. Universal composition with joint state. In Proceedings of CRYPTO 2003. Lecture Notes in Computer Science, vol. 2729. Springer Verlag, New York, pp. 265-281.
9. CHAUM, D., CREPEAU, C., AND DAMGARD, I. 1988. Multiparty unconditionally secure protocols. In Proceedings of the 20th Annual Symposium on Theory of Computing. ACM, New York, pp. 11-19.
10. CONSIDINE, J., FITZI, M., FRANKLIN, M., LEVIN, L. A., MAURER, U., AND METCALF, D. 2005. Byzantine agreement given partial broadcast. J. Crypt. 18, 3, 191-217.
11. DODIS, Y., AND MICALI, S. 2000. Parallel reducibility for information-theoretically secure computation. In Proceedings of CRYPTO'00. Lecture Notes in Computer Science, vol. 1880. Springer-Verlag, New York, pp. 74-92.
12. DWORK, C., NAOR, M., AND SAHAI, A. 1998. Concurrent zero-knowledge. In Proceedings of the 30th Annual Symposium on Theory of Computing. ACM, New York, pp. 409-418.
13. DOLEV, D., AND STRONG, H. R. 1983. Authenticated algorithms for byzantine agreement. SIAM J. Comput. 12, 4, 656-665.
14. FISCHER, M., LYNCH, N., AND MERRITT, M. 1986. Easy impossibility proofs for distributed consensus problems. Distrib. Comput. 1, 1, 26-39.
15. FITZI, M., GISIN, N., MAURER, U., AND VON ROTZ, O. 2002a. Unconditional Byzantine agreement and multi-party computation secure against dishonest minorities from scratch. In Proceedings of EUROCRYPT 2002. Lecture Notes in Computer Science, vol. 2332. Springer-Verlag, New York, pp. 482-501.
16. FITZI, M., GOTTESMAN, D., HIRT, M., HOLENSTEIN, T., AND SMITH, A. 2002b. Byzantine agreement secure against faulty majorities from scratch. In Proceedings of 21st Principles of Vatabase System, ACM, New York, pp. 118-126.
17. FITZI, M., AND MAURER, U. 2000. From partial consistency to global broadcast. In Proceedings of the 32nd Annual Symposium on Theory of Computing. ACM, New York, pp. 494-503.
18. GARAY, J., AND MACKENZIE, P. 2000. Concurrent oblivious transfer. In Proceedings of the 41st Annual Symposium on Foundations of Computer Science. IEEE Computer Society Press, Los Alamitos, CA, pp. 314-324.
19. GOLDREICH, O. 2002. Concurrent zero-knowledge with timing revisited. In Proceedings of the 34th Annual Symposium on Theory of Computing. ACM, New York, pp. 332-340.
20. GOLDREICH, O. 2003. Cryptography and cryptographic protocols. In Dist. Comput. 16, 2, 177-199.
21. GOLDREICH, O. 2004. Foundations of cryptography: Volume 2 - Basic Applications. Cambridge University Press, Combridge, MA.
22. GOLDREICH, O., AND KRAWCZYK, H. 1996. On the composition of zero-knowledge proof systems. SIAM J. Comput. 25, 1, 169-192.
23. GOLDREICH, O., MICALI, S., AND WIGDERSON, A. 1987. How to play any mental game. In Proceedings of the 19th Annual Symposium on Theory of Computing. ACM, New York, pp. 218-229.
24. GOLDWASSER, S., AND LINDELL, Y. 2005. Secure computation without agreement. J. Crypt. 18, 3, 247-287.
25. GOLDWASSER, S., MICALI, S., AND RIVEST, R. L. 1988. A digital signature scheme secure against adaptive chosen-message attacks. SIAM J. Comput. 17, 2, 281-308.
26. GONG, L., LINCOLN, P., AND RUSHBY, J. 1995. Byzantine agreement with authentication: Observations and applications in tolerating hybrid and link faults. In Dependable Computing for Critical Applications, pp. 139-157.
27. LAMPORT, L., SHOSTACK, R., AND PEASE, M. 1982. The byzantine generals problem. ACM Trans. Prog. Lang. Syst. 4, 3, 382-401.
28. MICALI, S., AND ROGAWAY, P. 1991. Secure computation. Unpublished manuscript, 1992. (Preliminary version in Proceedings of CRYPTO'91. Lecture Notes in Computer Science, vol. 576. Springer-Verlag, New York, pp. 392-404.
29. PEASE, M., SHOSTAK, R., AND LAMPORT, L. 1980. Reaching agreement in the presence of faults. J. ACM 27, 2, 228-234.
30. PFITZMANN, B., AND WAIDNER, M. 1996. Information-theoretic pseudosignatures and Byzantine agreement for t ≥ n/3. Tech. Rep. RZ 2882 (#90830). IBM Research.
31. RICHARDSON, R., AND KILIAN, J. 1999. On the concurrent composition of zero-knowledge proofs. In Proceedings of EUROCRYPT'99. Lecture Notes in Computer Science, vol. 1592. Springer-Verlag, New York, pp. 415-431.
32. RIVEST, R. L., SHAMIR, A., AND ADLEMAN, L. M. 1978. A method for obtaining digital signatures and public-key cryptosystems. Commun. ACM 21, 2, 120-126.