file.pdf (558.59 kB)
Download file

Cryptographically Sound Security Proofs forBasic and Public-Key Kerberos

Download (558.59 kB)
journal contribution
posted on 01.01.2008, 00:00 by M Backes, Iliano CervesatoIliano Cervesato, A D Jaggard, A Scedrov, J-K Tsay
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 computational level. Considering a recently fixed version of PKINIT, we extend symbolic correctness results we previously attained in the Dolev-Yao model to cryptographically sound results in the computational model.


Publisher Statement

All Rights Reserved



Usage metrics