Provable-Security Analysis of Authenticated Encryption in Kerberos

Alexandra Boldyreva; Virendra Kumar

Paper 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.

Metadata

Available format(s): PDF
Publication info: Published elsewhere. Preliminary versions have appeared in 2007 IEEE Symposium on Security & Privacy Proceedings, and in IET Information Security Journal.
Keywords: Kerberos authenticated encryption provable security.
Contact author(s): sasha @ gatech edu
virendra @ gatech edu
History: 2012-02-05: revised; 2007-06-19: received; See all versions
Short URL: https://ia.cr/2007/234
License: CC BY

BibTeX

@misc{cryptoeprint:2007/234,
      author = {Alexandra Boldyreva and Virendra Kumar},
      title = {Provable-Security Analysis of Authenticated Encryption in Kerberos},
      howpublished = {Cryptology {ePrint} Archive, Paper 2007/234},
      year = {2007},
      url = {https://eprint.iacr.org/2007/234}
}