This document presents the security protocol verifier CryptoVerif.CryptoVerif does not rely on the symbolic, Dolev-Yao model, but on the computational model. It can verify secrecy, correspondence (which include authentication), and indistinguishability properties. It produces proofs presented as sequences of games, like those manually written by cryptographers; these games are formalized in aprobabilistic process calculus. CryptoVerif provides a generic method for specifying security properties of the cryptographic primitives.It produces proofs valid for any number of sessions of the protocol, and provides an upper bound on the probability of success of an attack against the protocol as a function of the probability of breaking each primitive and of the number of sessions. It can work automatically, or the user can guide it with manual proof indications.

翻译：本文介绍安全协议验证工具CryptoVerif。CryptoVerif不依赖符号化的Dolev-Yao模型，而是基于计算模型，能够验证保密性、一致性（包括认证性）及不可区分性等安全属性。其以密码学家手写证明的游戏序列形式呈现验证结果，这些游戏通过概率进程演算形式化定义。CryptoVerif提供通用的密码原语安全属性规约方法，其证明适用于协议的任意会话次数，并可给出攻击成功概率的上界（该概率取决于各密码原语被攻破的概率与会话次数）。该工具支持全自动运行，亦可由用户通过手动证明指示进行引导。