Universally composable signature, certification, and authentication

Proceedings of the Computer Security Foundations Workshop

Volumn 17, Issue , 2004, Pages 219-233

  Canetti, Ran ^a  

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

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATED ANALYSIS; EXCHANGE PROTOCOLS; MINIMAL FORMALIZATIONS; SIGNATURE SCHEMES;

CRYPTOGRAPHY; ERROR ANALYSIS; LARGE SCALE SYSTEMS; MATHEMATICAL MODELS; NETWORK PROTOCOLS; SECURITY OF DATA;

ELECTRONIC DOCUMENT IDENTIFICATION SYSTEMS;

EID: 4944266340     PISSN: 10636900     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (34)

1. [ISO93] ISO/IEC IS 9798-3, Entity authentication mechanisms - Part 3: Entity authentication using asymmetric techniques, 1993.
2. [AR00] M. Abadi and P. Rogaway, Reconciling Two Views of Cryptography (The Computational Soundness of Formal Encryption), International Conference on Theoretical Computer Science IFIP TCS 2000, LNCS, 2000. On-line version at http://pa.bell-labs.com/abadi/.
3. [BH03] M. Backes and D. Hofheinz. How to break and repair a universally composable signature functionality. Cryptology ePrint Archive, Report 2003/240, 2003, http://eprint.iacr.org/.
4. [BPW03a] M. Backes, B. Pfitzmann and M. Waidner, A Universally Composable Cryptographic Library, 10th ACM ACS, 2003. Full version in http://eprint.iacr. org/2003/015.
5. [BPW0Sb] M. Backes, B. Pfitzmann, M. Waidner. Reactively Secure Signature Schemes. ISC 2003: 84-95.
6. [BPW04] M. Backes, B. Pfitzmann and M. Waidner, A General Composition Theorem for Secure Reactive Systems, 1st TCC, 2004.
7. [BLR04] B. Barak, Y. Lindell and T. Rabin, A Note on Secure Protocol Initialization and Setup in Concurrent Settings, Cryptology ePrint Archive, http://eprint.iacr.org/2004/006.
8. [BCK98] M. Bellare, R. Canetti and H. Krawczyk, A modular approach to the design and analysis of authentication and key-exchange protocols, 30th Symposium on Theory of Computing (STOC), ACM, 1998.
9. [C01] R. Canetti. A unified framework for analyzing cryptographic protocols. ECCC TR 01-16. Also available at http://eprint.iacr.org/2000/067.
10. [C03] R. Canetti. Universally Composable Signatures, Certification, and Authentication. Cryptology ePrint Archive, http://eprint.iacr.org/2003/239.
11. [CHH00] R. Canetti, S. Halevi and A. Herzberg, How to Maintain Authenticated Communication, Journal of Cryptology, Vol. 13, No. 1, winter 2000. Preliminary version at 16th Symp. on Principles of Distributed Computing (PODC), ACM, 1997, pp. 15-25.
12. [CHH00] R. Canetti, S. Halevi and A. Herzberg, How to Maintain Authenticated Communication, Journal of Cryptology, Vol. 13, No. 1, winter 2000. Preliminary version at 16th Symp. on Principles of Distributed Computing (PODC), ACM, 1997, pp. 15-25.
13. [CHK04] R. Canetti, S. Halevi, and J. Katz. Chosen-Ciphertext Security from Identity-Based Encryption. Eurocrypt '04, 2004. Also available at http://eprint.iacr.org/2003/182.
14. [CK02] R. Canetti and H. Krawczyk. Universally Composable Key Exchange and Secure Channels. In Eurocrypt '02, pages 337-351, 2002. LNCS No. 2332.
15. [CR03] R. Canetti and T. Rabin, Universal Composition with Joint State, Crypto'03, 2003. Also available at http://eprint.iacr.org/2002.
16. [TLS] T. Dierks and C. Allen. The Transport Layer Security (TLS) protocol. IETF RFC 2246, http://www.ietf.org/rfc/rfc2246.txt, 1999.
17. [DH76] W. Diffie and M. Hellman, New directions in cryptography, IEEE Trans. Info. Theory IT-22, November 1976, pp. 644-654.
18. [DDN00] D. Dolev, C. Dwork and M. Naor, Non-malleable cryptography, SIAM. J. Computing, Vol. 30, No. 2, 2000, pp. 391-437. Preliminary version in 23rd STOC, ACM, 1991.
19. [DDN00] D. Dolev, C. Dwork and M. Naor, Non-malleable cryptography, SIAM. J. Computing, Vol. 30, No. 2, 2000, pp. 391-437. Preliminary version in 23rd STOC, ACM, 1991.
20. [DY83] D. Dolev and A. Yao, On the security of public-key protocols, IEEE Transactions on Information Theory, 2(29), 1983.
21. [G01] O. Goldreich. Foundations of Cryptography. Cambridge University Press, 2001. Preliminary version http://philby.ucsd.edu/cryptolib.html/.
22. [GMRa89] S. Goldwasser, S. Micali and C. Rackoff. The Knowledge Complexity of Interactive Proof Systems. SIAM J. Comput., Vol. 18, No. 1, 1989, pp. 186-208.
23. [GMRi88] S. Goldwasser, S. Micali, and R.L. Rivest. A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks. SIAM J. Comput., April 1988, pages 281-308.
24. [GO92] S. Goldwasser and R. Ostrovsky, Invariant Signatures and Non-Interactive Zero-Knowledge Proofs Are Equivalent, Crypto '92, 1992, pp. 228-245.
25. [HMS03] Dennis Hofheinz, Joern Mueller-Quade, and Rainer Steinwandt, personal communication, March 2003.
26. [IPSEC] D. Harkins and D. Carrel, ed., The Internet Key Exchange (IKE), RFC 2409, Nov. 1998.
27. [LMMS99] P. Lincoln, J. C. Mitchell, M. Mitchell and A. Scedrov. Probabilistic Polynomial-Time Equivalence and Security Analysis. In World Congress on Formal Methods 1999: 776-793.
28. [MW04] D. Micciancio and B. Warinschi. Soundness of formal encryption ins the presence of active adversaries. Theory of Cryptography Conference (TCC) '04, 2004.
29. [MS03] A. Menezes and N. Smart, Security of signature schemes in a multi-user setting, Designs, Codes and Cryptography, to appear.
30. [MRV99] S. Micali, M. Rabin, and S. Vadhan, Verifiable Random Functions, 40th Annual Symposium on Foundations of Computer Science, 1999.
31. [p95] B. Pfitzmann. Sorting Out Signature Schemes. CWI Quarterly 8/2 (1995) 147-172.
32. [psw00] B. Pfitzmann, M. Schunter and M. Waidner. Provably Secure Certified Mail. IBM Research Report RZ 3207 (#93253), IBM Research, Zurich, August 2000.
33. [PW00] B. Pfitzmann and M. Waidner, Composition and integrity preservation of secure reactive systems, 7th ACM CCS, 2000, pp. 245-254.
34. [SM93] P. Syverson and C. Meadows, A Logical Language for Specifying Cryptographic Protocol Requirements, 14th IEEE Symp. Sec. Priv., 1993.