See this document in CiteSeerX!

Cryptographically Sound Security Proofs for  (Make Corrections)  
Basic and Public-Key Kerberos M. Backes, I. Cervesato, A.D. Jaggard, A....



  Home/Search   Context   Related

 
View or download:
stanford.edu/~iliano/...esorics06.ps.gz
Cached:  PS.gz  PS  PDF   Image  Update  Help

From:  stanford.edu/~iliano/papers/ (more)
(Enter author homepages)

Rate this article: (best)
  Comment on this article  
(Enter summary)

Abstract: We present a computational analysis of basic Kerberos and Kerberos with public-key authentication (PKINIT) in which we consider authentication and key secrecy properties. Our proofs rely on the Dolev-Yao style model of Backes, Pfitzmann and Waidner, which allows for mapping results obtained symbolically within this model to cryptographically sound proofs if certain assumptions are met. This is the most complex fragment of an industrial protocol that has yet been verified at the... (Update)

Active bibliography (related documents):   More   All
1.4:   Cryptographically Sound Theorem Proving - Sprenger, Backes, Basin.. (2006)   (Correct)
1.1:   Limits of the Reactive Simulatability/UC of Dolev-Yao.. - Backes, Pfitzmann.. (2006)   (Correct)
1.0:   Automated Security Proofs with Sequences of Games - Blanchet, Pointcheval (2006)   (Correct)

Similar documents based on text:
0.0:   Unknown -   (Correct)

BibTeX entry:   (Update)

@misc{ basic-cryptographically,
  author = "Basic And Public-Key",
  title = "Cryptographically Sound Security Proofs for",
  url = "citeseer.ist.psu.edu/765479.html" }
Citations (may not include all citations):
404   Journal of Computer and System Sciences (context) - Goldwasser, Micali - 1984
188   Entity authentication and key distribution (context) - Bellare, Rogaway - 1994  ACM   DBLP
178   Kerberos: An Authentication Service for Computer Networks (context) - Neuman, Ts'o - 1994
140   How to play any mental game -- or -- a completeness theorem .. (context) - Goldreich, Micali et al. - 1987
97   the security of public-key protocols (context) - Dolev, Yao - 1983
74   A model for asynchronous reactive systems and its applicatio.. - Pfitzmann, Waidner - 2001  ACM   DBLP
56   Formal eavesdropping and its computational interpretation - Abadi, Jurjens - 2001
39   Kerberos Version IV: Inductive Analysis of the Secrecy Goals - Bella, Paulson - 1998
35   Analysis of the internet key exchange protocol using the NRL.. - Meadows - 1999  DBLP
34   A composable cryptographic library with nested operations - Backes, Pfitzmann et al. - 2003
33   Reconciling two views of cryptography: The computational sou.. - Abadi, Rogaway - 2000
28   A universally composable cryptographic library - Backes, Pfitzmann et al. - 2003
28   The faithfulness of abstract protocol analysis: Message auth.. (context) - Guttman, Fabrega et al. - 2001  DBLP
23   Cryptographically sound and machine-assisted verification of.. - Backes, Jacobi - 2003
22   Symmetric encryption in a simulatable Dolev-Yao style crypto.. - Backes, Pfitzmann - 2004  ACM
21   Soundness of formal encryption in the presence of active adv.. (context) - Micciancio, Warinschi - 2004  DBLP
21   Symmetric encryption in automatic analyses for confidentiali.. - Laud - 2004
19   A cryptographically sound security proof of the Needham-Schr.. - Backes, Pfitzmann - 2004  DBLP
18   Symmetric authentication within a simulatable cryptographic .. - Backes, Pfitzmann et al. - 2003  DBLP
12   Plaintext awareness via key registration - Herzog, Liskov et al. - 2003  DBLP
11   automated proofs for security protocols (context) - Cortier, Warinschi - 2005
11   The Kerberos Network Authentication Service (context) - Neuman, Yu et al. - 2005
10   Logics for reasoning about cryptographic constructions - Impagliazzo, Kapron - 2003  ACM   DBLP
10   Probabilistic polynomial-time semantics for a protocol secur.. (context) - Datta, Derek et al. - 2005
9   Universally composable symbolic analysis of cryptographic pr.. - Canetti, Herzog - 2006
8   A cryptographically sound Dolev-Yao style security proof of .. - Backes - 2004
7   A probabilistic polynominaltime process calculus for analysi.. (context) - Mitchell, Mitchell et al. - 2001
6   A computationally sound mechanized prover for security proto.. - Blanchet - 2006
6   Relating symbolic and cryptographic secrecy - Backes, Pfitzmann - 2004
5   An Analysis of Some Properties of Kerberos 5 Using MSR (context) - Butler, Cervesato et al. - 2002
3   Specifying Kerberos 5 Cross-Realm Authentication - Cervesato, Jaggard et al. - 2005
2   security/bulletin/MS (context) - Bulletin, http et al. - 2005
1   Sequence of Internet drafts available from http://tools (context) - Key, Initial et al. - 2006
1   Dependable Secure Comp (context) - Backes, Pfitzmann et al. - 2005
1   Key exchange protocols: Security definition (context) - Datta, Derek et al. - 2006
1   Security Analysis and Improvements for IEEE (context) - He, Mitchell - 2005
1   Breaking and fixing public-key Kerberos - Cervesato, Jaggard et al. - 2006
1   Cryptographically sound security proofs for basic and public.. (context) - Backes, Cervesato et al. - 2006
1   the cryptographic key secrecy of the stregthened Yahalom pro.. (context) - Backes, Pfitzmann

Documents on the same site (http://theory.stanford.edu/~iliano/papers/):   More
The Logical Meeting Point of Multiset Rewriting and Process.. - Cervesato (2004)   (Correct)
Towards a Notion of Quantitative Security Analysis - Cervesato   (Correct)
Representing the MSR Cryptoprotocol Specification Language in .. - Cervesato, al. (2004)   (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