Download now Free registration required
The authors present a computationally sound mechanized analysis of Kerberos 5, both with and without its public-key extension PKINIT. They prove authentication and key secrecy properties using the prover CryptoVerif, which works directly in the computational model; these are the first mechanical proofs of a full industrial protocol at the computational level. They also generalize the notion of key usability and use CryptoVerif to prove that this definition is satisfied by keys in Kerberos. There are two main approaches to the verification of cryptographic protocols. One approach, known as the cryptographic or computational model, is based on probability and complexity theory and retains the view of messages as bit-strings and encryption/decryption as probabilistic algorithms.
- Format: PDF
- Size: 272.32 KB