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 …
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 …
primitives, defined by rewrite rules or by equations. It can prove various security properties …
Privacy and verifiability in voting systems: Methods, developments and trends
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 …
apparently conflicting requirements of privacy and verifiability. On the one hand, privacy …
Verifying privacy-type properties of electronic voting protocols
Electronic voting promises the possibility of a convenient, efficient and secure facility for
recording and tallying votes in an election. Recently highlighted inadequacies of …
recording and tallying votes in an election. Recently highlighted inadequacies of …
[PDF][PDF] ProVerif 2.00: automatic cryptographic protocol verifier, user manual and tutorial
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 …
automatically analyzing the security of cryptographic protocols. Support is provided for, but …
Attacking and fixing Helios: An analysis of ballot secrecy
Abstract 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 …
system, suitable for use in low-coercion environments. In this article, we analyse ballot …
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 …
automatic symbolic protocol verifier ProVerif. This verifier can prove secrecy, authentication …
Election verifiability in electronic voting protocols
We present a formal, symbolic definition of election verifiability for electronic voting protocols
in the context of the applied pi calculus. Our definition is given in terms of boolean tests …
in the context of the applied pi calculus. Our definition is given in terms of boolean tests …
Automated verification of equivalence properties of cryptographic protocols
Indistinguishability properties are essential in formal verification of cryptographic protocols.
They are needed to model anonymity properties, strong versions of confidentiality, and …
They are needed to model anonymity properties, strong versions of confidentiality, and …
Kokkos: Enabling performance portability across manycore architectures
HC Edwards, CR Trott - 2013 Extreme Scaling Workshop (xsw …, 2013 - ieeexplore.ieee.org
The manycore revolution in computational hardware can be characterized by increasing
thread counts, decreasing memory per thread, and architecture specific performance …
thread counts, decreasing memory per thread, and architecture specific performance …