Security protocol verification: Symbolic and computational models

B Blanchet - International conference on principles of security and …, 2012 - Springer
Security protocol verification has been a very active research area since the 1990s. This
paper surveys various approaches in this area, considering the verification in the symbolic …

Modeling and verifying security protocols with the applied pi calculus and ProVerif

B Blanchet - Foundations and Trends® in Privacy and …, 2016 - nowpublishers.com
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 …

SoK: Computer-aided cryptography

M Barbosa, G Barthe, K Bhargavan… - … IEEE symposium on …, 2021 - ieeexplore.ieee.org
Computer-aided cryptography is an active area of research that develops and applies
formal, machine-checkable approaches to the design, analysis, and implementation of …

Formal verification of security protocol implementations: a survey

M Avalle, A Pironti, R Sisto - Formal Aspects of Computing, 2014 - Springer
Automated formal verification of security protocols has been mostly focused on analyzing
high-level abstract models which, however, are significantly different from real protocol …

Provably secure fine-grained data access control over multiple cloud servers in mobile cloud computing based healthcare applications

S Roy, AK Das, S Chatterjee, N Kumar… - IEEE Transactions …, 2018 - ieeexplore.ieee.org
Mobile cloud computing (MCC) allows mobile users to have on-demand access to cloud
services. A mobile cloud model helps in analyzing the information regarding the patients' …

Automated analysis of Diffie-Hellman protocols and advanced security properties

B Schmidt, S Meier, C Cremers… - 2012 IEEE 25th …, 2012 - ieeexplore.ieee.org
We present a general approach for the symbolic analysis of security protocols that use Diffie-
Hellman exponentiation to achieve advanced security properties. We model protocols as …

The applied pi calculus: Mobile values, new names, and secure communication

M Abadi, B Blanchet, C Fournet - Journal of the ACM (JACM), 2017 - dl.acm.org
We study the interaction of the programming construct “new,” which generates statically
scoped names, with communication via messages on channels. This interaction is crucial in …

Verifying privacy-type properties of electronic voting protocols

S Delaune, S Kremer, M Ryan - Journal of Computer Security, 2009 - content.iospress.com
Electronic voting promises the possibility of a convenient, efficient and secure facility for
recording and tallying votes in an election. Recently highlighted inadequacies of …

[PDF][PDF] ProVerif 2.00: automatic cryptographic protocol verifier, user manual and tutorial

B Blanchet, B Smyth, V Cheval… - Version from, 2018 - bblanche.gitlabpages.inria.fr
This manual describes the ProVerif software package version 2.05. ProVerif is a tool for
automatically analyzing the security of cryptographic protocols. Support is provided for, but …

Proverif with lemmas, induction, fast subsumption, and much more

B Blanchet, V Cheval, V Cortier - 2022 IEEE Symposium on …, 2022 - ieeexplore.ieee.org
This paper presents a major overhaul of one the most widely used symbolic security protocol
verifiers, ProVerif. We provide two main contributions. First, we extend ProVerif with lemmas …