opam-version: "2.0"
synopsis: "CryptoVerif: Cryptographic protocol verifier in the computational model"
description: """
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. 
"""
maintainer: "Bruno Blanchet <Bruno.Blanchet@inria.fr>"
authors: "Bruno Blanchet <Bruno.Blanchet@inria.fr> and David Cadé <David.Cade@normalesup.org>"
license: "CeCILL-B"
homepage: "https://cryptoverif.inria.fr"
bug-reports: "Bruno.Blanchet@inria.fr"
depends: [ "ocaml" { >= "4.03" } "ocamlfind" "cryptokit" "conf-m4" ]
build: [
       [ "./build" "byte" ] { !ocaml:native }
       [ "./build" ] { ocaml:native }
]
install: [ "./build" "install" "%{prefix}%" ]
url {
  src: "https://cryptoverif.inria.fr/cryptoverif2.02.tar.gz"
  checksum: [
    "md5=d8fc3009b4de37f09ab769a323198c0c"
    "sha512=1fcc9a991211d13b0fa2b4ebe864a4595cd90a85bb71bed3e82a8fbf5f9304567b42875adebae9b78f2df9fcee56c7659f02fe83f15bca57ab854b607cba2058"
  ]
}
