• Publications
  • Influence
An efficient cryptographic protocol verifier based on prolog rules
  • B. Blanchet
  • Computer Science
  • Proceedings. 14th IEEE Computer Security…
  • 11 June 2001
TLDR
A new automatic cryptographic protocol verifier based on a simple representation of the protocol by Prolog rules, and on a new efficient algorithm that determines whether a fact can be proved from these rules or not, which proves secrecy properties of the protocols. Expand
A static analyzer for large safety-critical software
We show that abstract interpretation-based static program analysis can be made efficient and precise enough to formally verify a class of properties for a family of large programs with few or noExpand
Modeling and Verifying Security Protocols with the Applied Pi Calculus and ProVerif
  • B. Blanchet
  • Mathematics, Computer Science
  • Found. Trends Priv. Secur.
  • 31 October 2016
TLDR
This survey presents an overview of the research on ProVerif, an automatic symbolic protocol verifier that automatically translates this protocol description into Horn clauses and determines whether the desired security properties hold by resolution on these clauses. Expand
Automatic verification of correspondences for security protocols
  • B. Blanchet
  • Computer Science
  • J. Comput. Secur.
  • 23 February 2008
TLDR
A new technique for verifying correspondences in security protocols that can handle an unbounded number of sessions of the protocol, and it significantly extends a previous technique for the verification of secrecy. Expand
Automated verification of selected equivalences for security protocols
TLDR
This work focuses on proving equivalences P/spl ap/Q in which P and Q are two processes that differ only in the choice of some terms, and shows how to treat them as predicates on the behaviors of a process that represents P andQ at the same time. Expand
Escape analysis for object-oriented languages: application to Java
TLDR
The main originality of the escape analysis is that it determines precisely the effect of assignments, which is necessary to apply it to object oriented languages with promising results, whereas previous work applied it to functional languages and were very imprecise on assignments. Expand
ProVerif 1.85: Automatic Cryptographic Protocol Verifier, User Manual and Tutorial
TLDR
The aim of this beta is to extend the class of equivalences that ProVerif handles, so this beta can only take input file with an equivalence query, and any other query has been disabled. Expand
Automatic proof of strong secrecy for security protocols
  • B. Blanchet
  • Computer Science
  • IEEE Symposium on Security and Privacy…
  • 9 May 2004
TLDR
A new automatic technique for proving strong secrecy for security protocols that relies on an automatic translation of the protocol into Horn clauses, and a resolution algorithm on the clauses. Expand
From Secrecy to Authenticity in Security Protocols
TLDR
A new technique for verifying authenticity in cryptographic protocols that is fully automatic, it can handle an unbounded number of sessions of the protocol, and it is efficient in practice is presented. Expand
Analyzing security protocols with secrecy types and logic programs
TLDR
Two language-based techniques for analyzing security protocols based on a typed process calculus and on untyped logic programs are studied and further developed, and an equivalence is established between the two techniques. Expand
...
1
2
3
4
5
...