Composition theorems without pre-established session identifiers

Proceedings of the ACM Conference on Computer and Communications Security

Volumn , Issue , 2011, Pages 41-50

  Küsters, Ralf ^a   Tuengerthal, Max ^a  

^a UNIVERSITY OF TRIER   (Germany)

Author keywords

Security; Verification

Indexed keywords

COMPOSITION THEOREM; CRYPTOGRAPHIC ASSUMPTIONS; CRYPTOGRAPHIC OPERATIONS; CRYPTOGRAPHIC PROTOCOLS; DESIGN PRINCIPLES; IEEE802.11I; MODULAR DESIGNS; PUBLIC-KEY ENCRYPTION; SECURITY; SECURITY PROTOCOLS; SESSION IDENTIFIERS; SSL/TLS; SYMMETRIC ENCRYPTION;

AUTHENTICATION; ELECTRONIC DOCUMENT IDENTIFICATION SYSTEMS; PUBLIC KEY CRYPTOGRAPHY; STANDARDS;

NETWORK SECURITY;

EID: 80755168374     PISSN: 15437221     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2046707.2046715     Document Type: Conference Paper

References (27)

1. M. R. Albrecht, K. G. Paterson, and G. J. Watson. Plaintext Recovery Attacks against SSH. In S&P 2009, pages 16-26. IEEE Computer Society, 2009.
2. B. Barak, Y. Lindell, and T. Rabin. Protocol Initialization for the Framework of Universal Composability. Technical Report 2004/006, Cryptology ePrint Archive, 2004. http://eprint.iacr.org.
3. M. Bellare, D. Pointcheval, and P. Rogaway. Authenticated Key Exchange Secure against Dictionary Attacks. In B. Preneel, editor, EUROCRYPT 2000, volume 1807 of LNCS, pages 139-155. Springer, 2000.
4. M. Bellare and P. Rogaway. Entity Authentication and Key Distribution. In D. Stinson, editor, CRYPTO'93, volume 773 of LNCS, pages 232-249. Springer, 1993.
5. M. Bellare and P. Rogaway. Provably Secure Session Key Distribution: The Three Party Case. In STOC'95, pages 57-66. ACM, 1995.
6. B. Blanchet. Computationally Sound Mechanized Proofs of Correspondence Assertions. In CSF 2007, pages 97-111. IEEE Computer Society, 2007. (Pubitemid 47554208)
7. R. Canetti. Universally Composable Security: A New Paradigm for Cryptographic Protocols. In FOCS 2001, pages 136-145. IEEE Computer Society, 2001. (Pubitemid 33068374)
8. R. Canetti. Universally Composable Security: A New Paradigm for Cryptographic Protocols. Technical Report 2000/067, Cryptology ePrint Archive, December 2005. http://eprint.iacr.org.
9. R. Canetti and H. Krawczyk. Analysis of Key-Exchange Protocols and Their Use for Building Secure Channels. In B. Pfitzmann, editor, EUROCRYPT 2001, volume 2045 of LNCS, pages 453-474. Springer, 2001. (Pubitemid 33275848)
10. R. Canetti and H. Krawczyk. Security Analysis of IKE's Signature-Based Key-Exchange Protocol. In M. Yung, editor, CRYPTO 2002, volume 2442 of LNCS, pages 143-161. Springer, 2002.
11. R. Canetti and T. Rabin. Universal Composition with Joint State. In CRYPTO 2003, volume 2729 of LNCS, pages 265-281. Springer, 2003. (Pubitemid 137636947)
12. I. Cervesato, A. D. Jaggard, A. Scedrov, J.-K. Tsay, and C. Walstad. Breaking and Fixing Public-key Kerberos. Inf. Comput., 206(2-4):402-424, 2008.
13. K.-K. R. Choo and Y. Hitchcock. Security Requirements for Key Establishment Proof Models: Revisiting Bellare-Rogaway and Jeong-Katz-Lee Protocols. In C. Boyd and J. M. G. Nieto, editors, ACISP 2005, volume 3574 of LNCS, pages 429-442. Springer, 2005. (Pubitemid 41431800)
14. A. Datta, A. Derek, J. C. Mitchell, and B. Warinschi. Computationally Sound Compositional Logic for Key Exchange Protocols. In CSFW 2006, pages 321-334. IEEE Computer Society, 2006. (Pubitemid 46499737)
15. J. P. Degabriele and K. G. Paterson. On the (In)Security of IPsec in MAC-then-Encrypt Configurations. In CCS 2010. ACM, 2010.
16. S. Gajek, M. Manulis, O. Pereira, A. Sadeghi, and J. Schwenk. Universally Composable Security Analysis of TLS. In J. Baek, F. Bao, K. Chen, and X. Lai, editors, ProvSec 2008, volume 5324 of LNCS, pages 313-327. Springer, 2008.
17. K. Kobara, S. Shin, and M. Strefler. Partnership in key exchange protocols. In W. Li, W. Susilo, U. K. Tupakula, R. Safavi-Naini, and V. Varadharajan, editors, ASIACCS 2009, pages 161-170. ACM, 2009.
18. H. Krawczyk. SIGMA: The 'SIGn-and-MAc' Approach to Authenticated Diffie-Hellman and Its Use in the IKE-Protocols. In D. Boneh, editor, CRYPTO 2003, volume 2729 of LNCS, pages 400-425. Springer, 2003. (Pubitemid 137636955)
19. R. KÜsters. Simulation-Based Security with Inexhaustible Interactive Turing Machines. In CSFW 2006, pages 309-320. IEEE Computer Society, 2006. (Pubitemid 46499736)
20. R. Küsters and M. Tuengerthal. Joint State Theorems for Public-Key Encryption and Digitial Signature Functionalities with Local Computation. In CSF 2008, pages 270-284. IEEE Computer Society, 2008.
21. R. Küsters and M. Tuengerthal. Universally Composable Symmetric Encryption. In CSF 2009, pages 293-307. IEEE Computer Society, 2009.
22. R. Küsters and M. Tuengerthal. Composition Theorems Without Pre-Established Session Identifiers. Technical Report 2011/406, Cryptology ePrint Archive, 2011. http://eprint.iacr.org.
23. R. Küsters and M. Tuengerthal. Ideal Key Derivation and Encryption in Simulation-based Security. In A. Kiayias, editor, CT-RSA 2011, volume 6558 of LNCS, pages 161-179. Springer, 2011.
24. G. Lowe. An attack on the Needham-Schroeder public-key authentication protocol. Information Processing Letters, 56:131-133, 1995.
25. M. Ray and S. Dispensa. Renegotiating TLS. November 2009. Available at http: //extendedsubset.com/Renegotiating-TLS.pdf.
26. P. Rogaway and T. Stegers. Authentication without Elision: Partially Specified Protocols, Associated Data, and Cryptographic Models Described by Code. In CSF 2009, pages 26-39. IEEE Computer Society, 2009.
27. E. Tews and M. Beck. Practical Attacks against WEP and WPA. In D. A. Basin, S. Capkun, and W. Lee, editors, WISEC 2009, pages 79-86. ACM, 2009.