Cryptographically Sound Security Proofs for Basic and Public-Key Kerberos

14 years 2 months ago

Download eprint.iacr.org

Abstract We present a computational analysis of basic Kerberos with and without its public-key extension PKINIT in which we consider authentication and key secrecy properties. Our proofs rely on the Dolev

Michael Backes, Iliano Cervesato, Aaron D. Jaggard

Real-time Traffic

Dolev Yao Model | ESORICS 2006 | Key Secrecy Properties | Public-key Extension Pkinit | Security Privacy |

claim paper

» Computationally sound mechanized proofs for basic and publickey Kerberos

» Public Key Cryptography in Sensor Networks Revisited

» A Cryptographically Sound DolevYao Style Security Proof of an Electronic Payment System

» Formal Proofs for the Security of Signcryption

» Secrecy Analysis in Protocol Composition Logic

» Computational Semantics for Basic Protocol Logic A Stochastic Approach

» Formal Methods and Cryptography

» Automatic Generation of SigmaProtocols

Post Info
More Details (n/a)

Added	22 Aug 2010
Updated	22 Aug 2010
Type	Conference
Year	2006
Where	ESORICS
Authors	Michael Backes, Iliano Cervesato, Aaron D. Jaggard, Andre Scedrov, Joe-Kai Tsay

Comments (0)

Sciweavers

Cryptographically Sound Security Proofs for Basic and Public-Key Kerberos

Dolev Yao Model | ESORICS 2006 | Key Secrecy Properties | Public-key Extension Pkinit | Security Privacy |

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers

Sciweavers

Cryptographically Sound Security Proofs for Basic and Public-Key Kerberos

Dolev­ Yao Model | ESORICS 2006 | Key Secrecy Properties | Public-key Extension Pkinit | Security Privacy |

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers

Dolev Yao Model | ESORICS 2006 | Key Secrecy Properties | Public-key Extension Pkinit | Security Privacy |