Automated verification of selected equivalences for security protocols
By Bruno Blanchet, Martín Abadi, Cédric Fournet. 20th Annual IEEE Symposium on Logic in Computer Science (LICS' 05), 2005
400 citations recorded by the source corpus.
Subfields: Computer Networks and Communications, Information Systems
View Paper: https://www.semanticscholar.org/paper/4f70dc25296dfa5a17ace1e986b175d2dac888ac
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In Computer Networks and Communications
- Bruno Blanchet
- Cédric Fournet
- Karthikeyan Bhargavan
- A. Gordon
- Stéphanie Delaune
- Mark Dermot Ryan
- Steve Kremer
- Cas J. F. Cremers
In Information Systems
- Cédric Fournet
- A. Gordon
- Mark Dermot Ryan
- Stéphanie Delaune
- Steve Kremer
- Karthikeyan Bhargavan
- Bruno Blanchet
- Cas J. F. Cremers
Citations in the corpus
- Verifying privacy-type properties of electronic voting protocols (2009, methodology): “The ProVerif tool goes some way in this direction, but the tec hnique it uses is focused on process which have the same structure and differ onl y in the choice of terms [10].”
- Verified Reference Implementations of WS-Security Protocols (2006, methodology): “For instance, the ProVerif [9,8] theorem prover takes a protocol model written in a variant of the pi calculus [23,2] plus target authentication and secrecy goals, and attempts to prove that the model satisfies these goals.”
- Modeling and Verifying Security Protocols with the Applied Pi Calculus and ProVerif (2016, methodology): “Our presentation is based on earlier ones (Abadi and Blanchet, 2005a; Blanchet, 2009; Blanchet, 2014), with some features added: extended destructors (Cheval and Blanchet, 2013), support for equations and phases (Blanchet et al., 2008), enriched terms, pattern-matching, and table of keys (Blanchet e”