Breaking and fixing public-key Kerberos

DOI10.1016/J.IC.2007.05.005MaRDI QIDQ2482453zbMATH OpenOpenAlexFDO

Authors Iliano Cervesato, Aaron D. Jaggard, Joe-Kai Tsay, Christopher Walstad, Andre Scedrov

Publication date 16 April 2008

Published in Information and Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ic.2007.05.005

zbMATH Keywords

man-in-the-middle attackauthentication protocolscomputer securityprotocol verificationKerberosPKINIT

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Network design and communication in computer systems (68M10) Network protocols (68M12)

Recommendations

• Cryptographically sound security proofs for basic and public-key Kerberos
• Formal analysis of Kerberos 5
• On strengthening authentication protocols to foil cryptanalysis
• scientific article; zbMATH DE number 1543079
• A reduction-based proof for authentication and session key security in three-party Kerberos

Cites work

• scientific article; zbMATH DE number 1942418 (Why is no real title available?)
• scientific article; zbMATH DE number 1948406 (Why is no real title available?)
• scientific article; zbMATH DE number 1746674 (Why is no real title available?)
• A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks
• Analyzing security protocols with secrecy types and logic programs
• Breaking and fixing public-key Kerberos
• Computer Aided Verification
• Cryptographically sound security proofs for basic and public-key Kerberos
• Formal analysis of Kerberos 5
• On the security of SPLICE/AS -- The authentication system in WIDE Internet
• On the security of public key protocols
• On the security of recent protocols
• Searching for Shapes in Cryptographic Protocols
• Three systems for cryptographic protocol analysis
• Using encryption for authentication in large networks of computers

Cited in

(8)

• scientific article; zbMATH DE number 1543079 (Why is no real title available?)
• Cryptographically sound security proofs for basic and public-key Kerberos
• Cryptographic Verification by Typing for a Sample Protocol Implementation
• Rule-based static analysis of network protocol implementations
• Bounded memory Dolev-Yao adversaries in collaborative systems
• Formal analysis of Kerberos 5
• Protocol composition logic (PCL)
• Breaking and fixing public-key Kerberos

Describes a project that uses

Uses Software

• AVISPA

This page was built for publication: Breaking and fixing public-key Kerberos

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2482453)