Breaking and Fixing the Needham-Schroeder Public-Key Protocol Using FDR, Software -Concepts and Tools, vol.17, pp.93-102, 1996. ,
Formal analysis of saml 2.0 web browser single sign-on: breaking the saml-based single sign-on for Google Apps, pp.1-10, 2008. ,
The TAMARIN prover for the symbolic analysis of security protocols, Computer Aided Verification -25th International Conference, CAV 2013, pp.696-701, 2013. ,
Automatic verification of security protocols in the symbolic model: The verifier proverif, Foundations of Security Analysis and Design VII -FOSAD 2012/2013 Tutorial Lectures, ser. Lecture Notes in Computer Science, vol.8604, pp.54-87, 2013. ,
URL : https://hal.archives-ouvertes.fr/hal-01102136
,
On the reachability problem in cryptographic protocols, CONCUR, ser. Lecture Notes in Computer Science, vol.1877, pp.380-394, 2000. ,
URL : https://hal.archives-ouvertes.fr/inria-00072738
Constraint solving for bounded-process cryptographic protocol analysis, ACM Conference on Computer and Communications Security, pp.166-175, 2001. ,
Protocol insecurity with finite number of sessions is NP-complete, p.174, 2001. ,
URL : https://hal.archives-ouvertes.fr/inria-00100411
Automated verification of equivalence properties of cryptographic protocols, ACM Trans. Comput. Log, vol.17, issue.4, pp.1-23, 2016. ,
URL : https://hal.archives-ouvertes.fr/hal-00732905
A calculus for cryptographic protocols: The spi calculus, ACM Conference on Computer and Communications Security, pp.36-47, 1997. ,
Deciding knowledge in security protocols under equational theories, ICALP, ser, vol.3142, pp.46-58, 2004. ,
URL : https://hal.archives-ouvertes.fr/inria-00099982
Towards an automatic analysis of web service security, Frontiers of Combining Systems, 6th International Symposium, vol.4720, pp.133-147, 2007. ,
URL : https://hal.archives-ouvertes.fr/inria-00557707
The cl-atse protocol analyser, Proceedings, ser. Lecture Notes in Computer Science, F. Pfenning, vol.4098, pp.277-286, 2006. ,
URL : https://hal.archives-ouvertes.fr/inria-00103573
Deciding framed bisimilarity, 2002. ,
Deciding security of protocols against off-line guessing attacks, ACM Conference on Computer and Communications Security, pp.16-25, 2005. ,
Symbolic bisimulation for the applied pi calculus, Journal of Computer Security, vol.18, issue.2, pp.317-377, 2010. ,
Automatic testing equivalence verification of spi calculus specifications, ACM Trans. Softw. Eng. Methodol, vol.12, issue.2, pp.222-284, 2003. ,
A complete symbolic bisimilarity for an extended spi calculus, Electr. Notes Theor. Comput. Sci, vol.242, issue.3, pp.3-20, 2009. ,
Deciding equivalence-based properties using constraint solving, Theor. Comput. Sci, vol.492, pp.1-39, 2013. ,
URL : https://hal.archives-ouvertes.fr/hal-00881060
A procedure for deciding symbolic equivalence between sets of constraint systems, Inf. Comput, vol.255, pp.94-125, 2017. ,
URL : https://hal.archives-ouvertes.fr/hal-01584242
Logical Analysis and Verification of Cryptographic Protocols, 2009. ,
On the Security of Public-Key Protocols, IEEE Transactions on Information Theory, vol.2, issue.29, 1983. ,
Verifying cryptographic protocols with subterms constraints, LPAR, ser. Lecture Notes in Computer Science, vol.4790, pp.181-195, 2007. ,
URL : https://hal.archives-ouvertes.fr/inria-00557710
Decidability of Deterministic Process Equivalence for Finitary Deduction Systems (short paper), Euromicro International Conference on Parallel, Distributed and network-based Processing, vol.2020 ,
Finitary deduction systems, 2011. ,
URL : https://hal.archives-ouvertes.fr/hal-00585559
Decidability of the equivalence of symbolic derivations, Journal of Automated Reasoning, 2010. ,