Modeling and Verifying Security Protocols with the Applied Pi Calculus and ProVerif - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles Foundations and Trends® in Privacy and Security Year : 2016

Modeling and Verifying Security Protocols with the Applied Pi Calculus and ProVerif

Bruno Blanchet

Abstract

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: secrecy, authentication, and process equivalences, for an unbounded message space and an unbounded number of sessions. It takes as input a description of the protocol to verify in a dialect of the applied pi calculus, an extension of the pi calculus with cryptography. It automatically translates this protocol description into Horn clauses and determines whether the desired security properties hold by resolution on these clauses. This survey presents an overview of the research on ProVerif.
Fichier principal
Vignette du fichier
proverif.pdf (1.08 Mo) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-01423760 , version 1 (31-12-2016)

Identifiers

Cite

Bruno Blanchet. Modeling and Verifying Security Protocols with the Applied Pi Calculus and ProVerif. Foundations and Trends® in Privacy and Security , 2016, 1 (1-2), pp.1 - 135. ⟨10.1561/3300000004⟩. ⟨hal-01423760⟩

Collections

INRIA INRIA2
580 View
1353 Download

Altmetric

Share

Gmail Facebook X LinkedIn More