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 …
Automated verification of selected equivalences for security protocols
In the analysis of security protocols, methods and tools for reasoning about protocol
behaviors have been quite effective. We aim to expand the scope of those methods and …
behaviors have been quite effective. We aim to expand the scope of those methods and …
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 …
Proving more observational equivalences with ProVerif
V Cheval, B Blanchet - International conference on principles of security …, 2013 - Springer
This paper presents an extension of the automatic protocol verifier ProVerif in order to prove
more observational equivalences. ProVerif can prove observational equivalence between …
more observational equivalences. ProVerif can prove observational equivalence between …
Models and proofs of protocol security: A progress report
Models and Proofs of Protocol Security: A Progress Report Page 1 Models and Proofs of
Protocol Security: A Progress Report Martın Abadi1,2, Bruno Blanchet3,4,5, and Hubert …
Protocol Security: A Progress Report Martın Abadi1,2, Bruno Blanchet3,4,5, and Hubert …
Automating open bisimulation checking for the spi calculus
A Tiu, J Dawson - 2010 23rd IEEE Computer Security …, 2010 - ieeexplore.ieee.org
We consider the problem of automating open bisimulation checking for the spi calculus, an
extension of the pi-calculus with cryptographic primitives. The notion of open bisimulation …
extension of the pi-calculus with cryptographic primitives. The notion of open bisimulation …
Deciding equivalence-based properties using constraint solving
Formal methods have proved their usefulness for analyzing the security of protocols. Most
existing results focus on trace properties like secrecy or authentication. There are however …
existing results focus on trace properties like secrecy or authentication. There are however …
Trace equivalence decision: Negative tests and non-determinism
We consider security properties of cryptographic protocols that can be modeled using the
notion of trace equivalence. The notion of equivalence is crucial when specifying privacy …
notion of trace equivalence. The notion of equivalence is crucial when specifying privacy …
A method for proving observational equivalence
Formal methods have proved their usefulness for analyzing the security of protocols. Most
existing results focus on trace properties like secrecy (expressed as a reachability property) …
existing results focus on trace properties like secrecy (expressed as a reachability property) …
Automated reasoning for equivalences in the applied pi calculus with barriers
B Blanchet, B Smyth - Journal of Computer Security, 2018 - content.iospress.com
Observational equivalence allows us to study important security properties such as
anonymity. Unfortunately, the difficulty of proving observational equivalence hinders …
anonymity. Unfortunately, the difficulty of proving observational equivalence hinders …