cryptoverifversion
CryptoVerif: Cryptographic protocol verifier in the computational model
CryptoVerif is an automatic protocol prover sound in the computational model. It can prove
- secrecy;
- correspondences, which include in particular authentication;
- indistinguishability between two games.
It provides a generic mechanism for specifying the security assumptions on cryptographic primitives, which can handle in particular symmetric encryption, message authentication codes, public-key encryption, signatures, hash functions.
The generated proofs are proofs by sequences of games, as used by cryptographers. These proofs are valid for a number of sessions polynomial in the security parameter, in the presence of an active adversary. CryptoVerif can also evaluate the probability of success of an attack against the protocol as a function of the probability of breaking each cryptographic primitive and of the number of sessions (exact security).
This software is under development; please use it at your own risk. Comments and bug reports welcome.
Author | Bruno Blanchet <Bruno.Blanchet@inria.fr>, Pierre Boutry <boutry.pierre@gmail.com>, David Cadé <David.Cade@normalesup.org>, Christian Doczkal <christian.doczkal@mpi-sp.org>, Aymeric Fromherz <Aymeric.Fromherz@inria.fr>, Charlie Jacomme <Charlie.Jacomme@inria.fr>, Benjamin Lipp <Benjamin.Lipp@mpi-sp.org>, and Pierre-Yves Strub <pierre-yves@strub.nu> |
---|---|
License | CECILL-B |
Published | |
Homepage | https://cryptoverif.inria.fr |
Issue Tracker | Bruno.Blanchet@inria.fr |
Maintainer | Bruno Blanchet <Bruno.Blanchet@inria.fr> |
Dependencies | |
Source [http] | https://cryptoverif.inria.fr/cryptoverif2.11.tar.gz md5=b3b6aecc359e333ee14c66aca0f39b73 sha512=b461dacddfc4b72b5967246c5b47ceceb9d80c3afdebb82e498a0f53a87bb96431c49038f1eff2a1e74ec61cf2c04ab241b2353289880e25247c19010f470f6a |
Edit | https://github.com/ocaml/opam-repository/tree/master/packages/cryptoverif/cryptoverif.2.11/opam |