Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
438549 | Theoretical Computer Science | 2006 | 31 Pages |
Abstract
We report on the detailed verification of a substantial portion of the Kerberos 5 protocol specification. Because it targeted a deployed protocol rather than an academic abstraction, this multiyear effort led to the development of new analysis methods in order to manage the inherent complexity. This enabled proving that Kerberos supports the expected authentication and confidentiality properties, and that it is structurally sound; these results rely on a pair of intertwined inductions. Our work also detected a number of innocuous but nonetheless unexpected behaviors, and it clearly described how vulnerable the cross-realm authentication support of Kerberos is to the compromise of remote administrative domains.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics