Sequential composition of protocols without simultaneous termination

Proceedings of the Annual ACM Symposium on Principles of Distributed Computing

Volumn , Issue , 2002, Pages 203-212

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

^a WEIZMANN INSTITUTE OF SCIENCE   (Israel)

^b MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

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

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; PARALLEL PROCESSING SYSTEMS; RANDOM PROCESSES; SEQUENTIAL MACHINES; TIME SHARING SYSTEMS;

PROTOCOL SEQUENTIAL COMPOSITION; RANDOMIZED BYZANTINE AGREEMENT;

NETWORK PROTOCOLS;

EID: 0036957660     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/571825.571859     Document Type: Conference Paper

References (15)

1. M. Ben-Or and R. El-Yaniv. Interactive Consistency in Constant Time. Submitted for publication, 1991.
2. M. Ben-Or. Another Advantage of Free Choice: Completely Asynchronous Agreement Protocols. In Proceeding 2nd Annual Symposium on Principals of Distributed Computing, pages 27-30. ACM, 1983.
3. R. Canetti. Security and composition of multiparty cryptographic protocols. Journal of Cryptology, 13(1):143-202, 2000.
4. R. Canetti. Universally Composable Security: A New Paradigm for Cryptographic Protocols. In Proc. 42st FOCS, pages 136-145, IEEE, 2001.
5. C. Cachin, K. Kursawe, and V. Shoup. Random Oracles in Constantipole: Practical Asynchronous Byzantine Agreement Using Cryptography. In Proc. 19th ACM PODC, pages 123-132. ACM, 2000.
6. R. Canetti and T. Rabin. Optimal Asynchronous Byzantine Agreement. In Proc. 25th STOC, pages 42-51. ACM, 1993.
7. C. Dwork and Y. Moses. Knowledge and Common Knowledge in a Byzantine Environment: The Case of Crash Failures. In Proceedings of the Conference on Theoretical Aspects of Reasoning About Knowledge, pages 149-170. Morgan Kaufman, 1986.
8. C. Dwork, M. Naor, and A. Sahai. Concurrent zero-knowledge. In Proc. 30th STOC, pages 409-418. ACM, 1998.
9. M. Fischer and N. Lynch. A Lower Bound for the Time to Assure Interactive Consistency. Information Processing Letters, 14(4):183-186, 1982.
10. P. Feldman and S. Micali. An Optimal Algorithm for Synchronous Byzantine Agreement. SIAM. J. Computing, 26(4):873-933, 1997.
11. O. Goldreich and H. Krawczyk. On the composition of zero-knowledge proof systems. SIAM. J. Computing, 25(1):169-192, 1996.
12. Y. Lindell, A. Lysyanskya, and T. Rabin. On the Composition of Authenticated Byzantine Agreement. To appear in STOC 2002, 2002.
13. Y. Moses and M. R. Tuttle. Programming Simultaneous Actions Using Common Knowledge. In Proc. 27th FOCS, pages 208-221. IEEE, 1986.
14. M. Rabin. Randomized Byzantine Generals. In Proceeding 24th Annual Symposium on the Foundations of Computer Science, pages 403-409. IEEE, 1983.
15. R. Richardson and J. Kilian. On the concurrent composition of zero-knowledge proofs. In Eurocrypt '99, pages 311-326, 1999. LNCS No. 1592.