Formal analysis of Kerberos 5
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 1588477 (Why is no real title available?)
- scientific article; zbMATH DE number 1024060 (Why is no real title available?)
- scientific article; zbMATH DE number 1746674 (Why is no real title available?)
- Conditional rewriting logic as a unified model of concurrency
- Formal analysis of Kerberos 5
- On the security of public key protocols
- Representing the MSR cryptoprotocol specification language in an extension of rewriting logic with dependent types
- Using encryption for authentication in large networks of computers
Cited in
(10)- scientific article; zbMATH DE number 1543079 (Why is no real title available?)
- 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
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)