(Enter summary)
Abstract: We present a cryptographically sound formal method for proving correctness of key exchange
protocols. Our main tool is a fragment of a symbolic protocol logic. We demonstrate
that proofs of key agreement and key secrecy in this logic imply simulatability in Shoup's secure
multi-party framework for key exchange. As part of the logic, we present cryptographically
sound abstractions of CMA-secure digital signatures and Diffie-Hellman exponentiation, which
is a technical result of independent... (Update)
Cited by: More
Computationally Sound Symbolic Secrecy in the - Presence Of Hash (2006)
(Correct)
Key Confirmation and Adaptive Corruptions - In The Protocol (2006)
(Correct)
Key Exchange Protocols: Security Definition, Proof.. - Datta, Derek.. (2006)
(Correct)
Active bibliography (related documents): More All
0.6: Automated Security Proofs with Sequences of Games - Blanchet, Pointcheval (2006)
(Correct)
0.6: Cryptographically Sound Security Proofs for - Basic And Public-Key
(Correct)
0.6: A Computationally Sound Mechanized Prover for Security Protocols - Blanchet (2005)
(Correct)
Similar documents based on text: More All
0.2: Analysis of a Fair Exchange Protocol - Shmatikov, Mitchell (1999)
(Correct)
0.2: A Core Calculus of Classes and Objects - Bono, Patel, Shmatikov, Mitchell (1999)
(Correct)
0.2: Analysis of Abuse-Free Contract Signing - Shmatikov, Mitchell (2000)
(Correct)
Related documents from co-citation: More All
4: Entity authentication and key distribution (context) - Bellare, Rogaway - 1993
4: Soundness of formal encryption in the presence of active adversaries (context) - Micciancio, Warinschi - 2004
3: Universally composable security: A new paradigm for cryptographic protocols
- Canetti - 2001
BibTeX entry: (Update)
Gupta, P., Shmatikov, V.: Towards computationally sound symbolic analysis of key exchange protocols. In: Proceedings of ACM Workshop on Formal Methods in Security Engineering. (2005) to appear. http://citeseer.ist.psu.edu/gupta05towards.html More
@misc{ gupta05towards,
author = "P. Gupta and V. Shmatikov",
title = "Towards computationally sound symbolic analysis of key exchange protocols",
text = "Gupta, P., Shmatikov, V.: Towards computationally sound symbolic analysis
of key exchange protocols. In: Proceedings of ACM Workshop on Formal Methods
in Security Engineering. (2005) to appear.",
year = "2005",
url = "citeseer.ist.psu.edu/gupta05towards.html" }
Citations (may not include all citations):
501
A digital signature scheme secure against adaptive chosenmes..
- Goldwasser, Micali et al. - 1988
189
Universally composable security: a new paradigm for cryptogr..
- Canetti - 2001
188
Entity authentication and key distribution (context) - Bellare, Rogaway - 1993
179
Security and composition of multiparty cryptographic protoco..
- Canetti - 2000
167
Pseudorandom generation from one-way functions (context) - Impagliazzo, Levin et al. - 1989
136
The Kerberos network authentication service
- Kohl, Neuman - 1993
120
A modular approach to the design and analysis of authenticat.. (context) - Bellare, Canetti et al. - 1998
90
Secure multiparty protocols and zero-knowledge proof systems.. (context) - Beaver - 1991
87
Authentication and authenticated key exchange
- Diffie, van Oorschot et al. - 1992
82
On formal models for secure key exchange
- Shoup - 1999
80
Studies in secure multiparty computation and applications
- Canetti - 1995
76
the computational soundness of formal encryption (context) - Abadi, Rogaway et al. - 2002
74
A model for asynchronous reactive systems and its applicatio..
- Pfitzmann, Waidner - 2001
56
Systematic design of two-party authentication protocols
- Bird, Gopal et al. - 1991
51
Analysis of key-exchange protocols and their use for buildin..
- Canetti, Krawczyk - 2001
36
Universally composable notions of key exchange and secure ch..
- Canetti, Krawczyk - 2002
35
Key agreement protocols and their security analysis (context) - Blake-Wilson, Johnson et al. - 1997
34
A composable cryptographic library with nested operations
- Backes, Pfitzmann et al. - 2003
30
A general composition theorem for secure reactive systems
- Backes, Pfitzmann et al. - 2004
26
Universal composition with joint state
- Canetti, Rabin - 2003
21
Soundness of formal encryption in the presence of active adv.. (context) - Micciancio, Warinschi - 2004
21
Symmetric encryption in automatic analyses for confidentiali..
- Laud - 2004
13
A compositional logic for proving security properties of pro..
- Durgin, Mitchell et al. - 2003
11
automated proofs for security protocols (context) - Cortier, Warinschi - 2005
10
Probabilistic polynomial-time semantics for a protocol secur.. (context) - Datta, Derek et al. - 2005
10
Completeness theorems for the Abadi-Rogaway language of encr..
- Micciancio, Warinschi - 2004
9
Universally composable symbolic analysis of cryptographic pr..
- Canetti, Herzog - 2004
9
Universally composable signature (context) - Canetti - 2004
6
A derivation system for security protocols and its logical f..
- Datta, Derek et al. - 2003
6
Relating symbolic and cryptographic secrecy
- Backes, Pfitzmann - 2005
4
orginternet draftdraft ietf ipsec ikev (context) - Internet, IKEv et al. - 2004
3
Foundations of Cryptography: Volume II (context) - Goldreich - 2004
2
Internet RFC httpwww (context) - Allen, protocol et al. - 1999
Documents on the same site (http://eprint.iacr.org/complete/): More
A Tool for Obtaining Tighter Security Analyses of.. - Bellare, Impagliazzo (1999)
(Correct)
Chameleon Hashing and Signatures - Krawczyk, Rabin (1997)
(Correct)
Verifiable Encryption and Applications to Group.. - Camenisch, Damgård (1999)
(Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC