Formal analysis of Kerberos 5
From MaRDI portal
Publication:860899
DOI10.1016/J.TCS.2006.08.040zbMATH Open1153.94448OpenAlexW2118377274MaRDI QIDQ860899FDOQ860899
Authors: Frederick Butler, Iliano Cervesato, Aaron D. Jaggard, Christopher Walstad, Andre 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
Recommendations
Cites Work
- Using encryption for authentication in large networks of computers
- Conditional rewriting logic as a unified model of concurrency
- Title not available (Why is that?)
- On the security of public key protocols
- Formal analysis of Kerberos 5
- Title not available (Why is that?)
- Title not available (Why is that?)
- Representing the MSR cryptoprotocol specification language in an extension of rewriting logic with dependent types
Cited In (10)
- Title not available (Why is that?)
- Cryptographically sound security proofs for basic and public-key Kerberos
- Emerging issues and trends in formal methods in cryptographic protocol analysis: twelve years later
- Rule-based static analysis of network protocol implementations
- Bounded memory Dolev-Yao adversaries in collaborative systems
- Formal analysis of Kerberos 5
- Soft constraint programming to analysing security protocols
- Protocol composition logic (PCL)
- Formal correctness of security protocols.
- Breaking and fixing public-key Kerberos
Uses Software
This page was built for publication: Formal analysis of Kerberos 5
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q860899)
