Universal composition with joint state

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2729, Issue , 2003, Pages 265-281

  Canetti, Ran ^a   Rabin, Tal ^a  

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

Author keywords

Cryptographic protocols; Protocol composition; Security analysis

Indexed keywords

DISTRIBUTED COMPUTER SYSTEMS; PUBLIC KEY CRYPTOGRAPHY; RANDOM PROCESSES;

COMMON REFERENCE STRING; COMPOSITION THEOREM; CRYPTOGRAPHIC PROTOCOLS; CRYPTOGRAPHIC SYSTEMS; INTERNAL STATE; PROTOCOL COMPOSITION; PUBLIC KEY INFRASTRUCTURE; SECURITY ANALYSIS;

CRYPTOGRAPHY;

EID: 35248819315     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-45146-4_16     Document Type: Article

References (25)

1. D. Beaver. Secure Multiparty Protocols and Zero-Knowledge Proof Systems Tolerating a Faulty Minority. Journal of Cryptology, 4:75-122, 1991.
2. M. Ben-Or, S. Goldwasser, and A. Wigderson. Completeness Theorems for Noncryptographic Fault-Tolerant Distributed Computations. In Proc. 20th STOC, pages 1-10. ACM, 1988.
3. M. Blum. Coin Flipping by Telephone. In IEEE Spring COMPCOM, pages 133-137, 1982.
4. M. Bellare and P. Rogaway. Entity Authentication and Key Distribution. In Crypto '93, pages 232-249, 1993. LNCS No. 773.
5. R. Canetti. Security and Composition of Multiparty Cryptographic Protocols. Journal of Cryptology, 13(1):143-202, 2000.
6. R. Canetti. Universally Composable Security: A New Paradigm for Cryptographic Protocols. In Proc. 42st FOCS, pages 136-145. IEEE, 2001. http://eprint.iacr.org/2000/067.
7. R. Canetti and M. Fischlin. Universally Composable Commitments. In Crypto '01, pages 19-40. LNCS No. 2139.
8. R. Canetti and H. Krawczyk. Analysis of Key-Exchange Protocols and Their Use for Building Secure Channels . In Eurocrypt '01, pages 453-474, 2001. LNCS No. 2045.
9. R. Canetti and H. Krawczyk. Universally Composable Key Exchange and Secure Channels. In Eurocrypt '02, pages 337-351, 2002. LNCS No. 2332.
10. R. Canetti, Y. Lindell, R. Ostrovsky, and A. Sahai. Universally Composable Two-Party and Multi-Party Secure Computation. In Proc. 34th STOC, pages 494-503.
11. R. Canetti and T. Rabin. Universal Composition with Joint State. Available online, http://eprint.iacr.org.
12. A. De Santis, G. Di Crescenzo, R. Ostrovsky, G. Persiano, and A. Sahai. Robust Non-interactive Zero-Knowledge. In Crypto '01 LNCS No. 2139.
13. D. Dolev, C. Dwork, and M. Naor. Non-malleable Cryptography. SIAM J. Comput., 30(2):391-437, 2000.
14. Y. Dodis and S. Micali. Parallel Reducibility for Information-Theoretically Secure Computation. In Crypto '00, pages 74-92, 2000. LNCS No. 1880.
15. I. Damgard and J. Nielsen. Universally Composable Commitment Schemes with Constant Expansion Factor. In Crypto '02 LNCS No. 2442.
16. C. Dwork, M. Naor, and A. Sahai. Concurrent zero-knowledge. In Proc. 30th STOC, pages 409-418.
17. O. Goldreich and H. Krawczyk. On the composition of zero-knowledge proof systems. SIAM. J. Computing, 25(1):169-192, 1996.
18. S. Goldwasser and L. Levin. Fair computation of general functions in presence of immoral majority. In Crypto '90, 1990. LNCS No. 537.
19. O. Goldreich, S. Micali, and A. Wigderson. How to Play Any Mental Game. In Proc. 19th STOC, pages 218-229. ACM, 1987.
20. O. Goldreich and Y. Oren. Definitions and Properties of Zero-Knowledge Proof Systems. Journal of Cryptology, 7(1):1-32, 1994. Preliminary version by Y. Oren in FOCS87.
21. O. Goldreich. Concurrent Zero-Knowledge With Timing Revisited. In Proc. 34th STOC.
22. Y. Lindell, A. Lysyanskya, and T. Rabin. On the Composition of Authenticated Byzantine Agreement. In Proc. 34th STOC, pages 514-523.
23. S. Micali and P. Rogaway. Secure Computation. In Crypto '91, pages 392-404, 1991. Manuscript available.
24. B. Pfitzmann, M. Schunter, and M. Waidner. Secure Reactive Systems. IBM Research Report RZ 3206 (#93252), IBM Research, Zurich, May 2000.
25. V. Shoup. On Formal Models for Secure Key Exchange. Available at: http://www.shoup.org, 1999.