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 …

Privacy and verifiability in voting systems: Methods, developments and trends

H Jonker, S Mauw, J Pang - Computer Science Review, 2013 - Elsevier
One of the most challenging aspects in computer-supported voting is to combine the
apparently conflicting requirements of privacy and verifiability. On the one hand, privacy …

[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 …

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 …

[PDF][PDF] Modelling and automatically analysing privacy properties for honest-but-curious adversaries

A Paverd, A Martin, I Brown - Tech. Rep, 2014 - ajpaverd.org
For certain communication protocols, undetectability and unlinkability of messages or
information items are desirable properties, and are used to reason about anonymity and …

Verifying privacy-type properties of electronic voting protocols

S Delaune, S Kremer, M Ryan - Journal of Computer …, 2009 - journals.sagepub.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 …

Automatic verification of security protocols in the symbolic model: The verifier proverif

B Blanchet - International School on Foundations of Security …, 2012 - Springer
After giving general context on the verification of security protocols, we focus on the
automatic symbolic protocol verifier ProVerif. This verifier can prove secrecy, authentication …

PrÊt À Voter: a Voter-Verifiable Voting System

PYA Ryan, D Bismark, J Heather… - IEEE transactions on …, 2009 - ieeexplore.ieee.org
¿¿¿¿¿¿ Pre¿ ta¿ Voter provides a practical approach to end-to-end verifiable elections with
a simple, familiar voter-experience. It assures a high degree of transparency while …

Attacking and fixing Helios: An analysis of ballot secrecy

V Cortier, B Smyth - Journal of Computer Security, 2013 - journals.sagepub.com
Helios 2.0 is an open-source web-based end-to-end verifiable electronic voting system,
suitable for use in low-coercion environments. In this article, we analyse ballot secrecy in …