Cryptology ePrint Archive: Report 2007/234
Provable-Security Analysis of Authenticated Encryption in Kerberos
Alexandra Boldyreva and Virendra Kumar
Abstract: Kerberos is a widely deployed network authentication protocol currently being considered for standardization. Many works have analyzed its security, identifying flaws and often suggesting fixes, thus promoting the protocol's evolution. Several recent results present successful, formal methods-based verifications of a significant portion of the current version, v.5, and some even imply security in the computational setting. For these results to hold, encryption in Kerberos should satisfy strong cryptographic security notions. However, prior to our work, none of the encryption schemes currently deployed as part of Kerberos, nor their proposed revisions, were known to provably satisfy such notions. We take a close look at Kerberos' encryption, and we confirm that most of the options in the current version provably provide privacy and authenticity, though some require slight modifications which we suggest. Our results complement the formal methods-based analysis of Kerberos that justifies its current design.
Category / Keywords: Kerberos, authenticated encryption, provable security.
Publication Info: Preliminary versions have appeared in 2007 IEEE Symposium on Security & Privacy Proceedings, and in IET Information Security Journal.
Date: received 14 Jun 2007, last revised 4 Feb 2012
Contact author: sasha at gatech edu, virendra@gatech edu
Available format(s): PDF | BibTeX Citation
Version: 20120205:035021 (All versions of this report)
Short URL: ia.cr/2007/234
Discussion forum: Show discussion | Start new discussion
[ Cryptology ePrint archive ]