ProVerif is an automatic symbolic protocol verifier. It supports a wide range of cryptographic
primitives, defined by rewrite rules or by equations. It can prove various security properties …

In the analysis of security protocols, methods and tools for reasoning about protocol
behaviors have been quite effective. We aim to expand the scope of those methods and …

We present a new automatic technique for proving strong secrecy for security protocols.
Strong secrecy means that an adversary cannot see any difference when the value of the …

We provide an effective procedure for deciding the existence of off-line guessing attacks on
security protocols, for a bounded number of sessions. The procedure consists of a constraint …

We study the security of password protocols against off-line dictionary attacks. In addition to
the standard adversary abilities, we also consider further cryptographic advantages given to …

Tracking the articulated hand motion in a video sequence is a challenging problem in which
the main difficulty arises from the complexity of searching for an optimal motion estimate in a …

We consider the problem of automating proofs of cryptographic protocols when some data,
like poorly chosen passwords, can be guessed by dictionary attacks. First, we define a …

The use of passwords in security protocols is particularly delicate because of the possibility
of off-line guessing attacks. We study password-based protocols in the context of a recent …

The indistinguishability of two pieces of data (or two lists of pieces of data) can be
represented formally in terms of a relation called static equivalence. Static equivalence …

Cette thèse est consacrée au problème de la vérification automatique des protocoles
cryptographiques d'un point de vue logique et calculatoire. Dans une première partie, nous …