Mechanizing Game-Based Proofs of Security Protocols

After a short introduction to the field of security protocol verification, the authors present the automatic protocol verifier CryptoVerif. In contrast to most previous protocol verifiers, CryptoVerif does not rely on the Dolev-Yao model, but on the computational model. It produces proofs presented as sequences of games, like those manually done by cryptographers; these games are formalized in a probabilistic process calculus. CryptoVerif provides a generic method for specifying security properties of the cryptographic primitives. It can prove secrecy and correspondence properties (including authentication). It produces proofs valid for any number of sessions, in the presence of an active adversary.

Provided by: INRIA Topic: Security Date Added: Sep 2011 Format: PDF

Find By Topic