Formal analysis of Kerberos 5

DOI10.1016/j.tcs.2006.08.040zbMath1153.94448OpenAlexW2118377274MaRDI QIDQ860899

Aaron D. Jaggard, Frederick Butler, Iliano Cervesato, Christopher Walstad, Andrej Scedrov

Publication date: 9 January 2007

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2006.08.040

zbMATH Keywords

formal methodssecurity protocol analysisKerberos protocol

Mathematics Subject Classification ID

Authentication, digital signatures and secret sharing (94A62)

Related Items

Formal analysis of Kerberos 5, Emerging Issues and Trends in Formal Methods in Cryptographic Protocol Analysis: Twelve Years Later, Bounded memory Dolev-Yao adversaries in collaborative systems, Rule-based static analysis of network protocol implementations, Breaking and fixing public-key Kerberos, Protocol Composition Logic (PCL), Cryptographically Sound Security Proofs for Basic and Public-Key Kerberos

Uses Software

• Maude

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Formal analysis of Kerberos 5
• Conditional rewriting logic as a unified model of concurrency
• On the security of public key protocols
• Using encryption for authentication in large networks of computers