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

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.
Liste complète des métadonnées

https://hal.inria.fr/hal-01423760
Contributor : Bruno Blanchet <>
Submitted on : Saturday, December 31, 2016 - 1:56:49 PM
Last modification on : Wednesday, May 2, 2018 - 8:46:07 AM
Document(s) archivé(s) le : Saturday, April 1, 2017 - 12:06:17 PM

File

proverif.pdf
Files produced by the author(s)

Identifiers

Collections

Citation

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

Share

Metrics

Record views

122

Files downloads

315