Mobile values, new names, and secure communication, 28th Symposium on Principles of Programming Languages (POPL'01, 2001. ,
URL : https://hal.archives-ouvertes.fr/hal-01423924
Bounding messages for free in security protocols ??? extension to various security properties, Information and Computation, vol.239, pp.182-215, 2014. ,
DOI : 10.1016/j.ic.2014.09.003
URL : https://hal.archives-ouvertes.fr/hal-01083657
Automated Verification of Remote Electronic Voting Protocols in the Applied Pi-Calculus, 2008 21st IEEE Computer Security Foundations Symposium, pp.195-209, 2008. ,
DOI : 10.1109/CSF.2008.26
Partial order reduction for security protocols, Proc. 26th International Conference on Concurrency Theory (CONCUR'15), volume 42 of LIPIcs Leibniz-Zentrum für Informatik, pp.497-510, 2015. ,
Deciding security of protocols against off-line guessing attacks, Proceedings of the 12th ACM conference on Computer and communications security , CCS '05, 2005. ,
DOI : 10.1145/1102120.1102125
Formal Verification of Privacy for RFID Systems, 2010 23rd IEEE Computer Security Foundations Symposium, 2010. ,
DOI : 10.1109/CSF.2010.13
Automated verification of equivalence properties of cryptographic protocol, ACM Transactions on Computational Logic, 2016. ,
Trace equivalence decision, Proceedings of the 18th ACM conference on Computer and communications security, CCS '11 ,
DOI : 10.1145/2046707.2046744
URL : http://kar.kent.ac.uk/46878/1/CCD-ccs11.pdf
Deciding equivalence-based properties using constraint solving, Theoretical Computer Science, vol.492, pp.1-39, 2013. ,
DOI : 10.1016/j.tcs.2013.04.016
URL : https://hal.archives-ouvertes.fr/hal-00881060
Typing Messages for Free in Security Protocols: The Case of Equivalence Properties, Proceedings of the 25th International Conference on Concurrency Theory (CONCUR'14), pp.372-386, 2014. ,
DOI : 10.1007/978-3-662-44584-6_26
A survey of authentication protocol literature: Version 1.0, 1997. ,
Deciding security properties for cryptographic protocols. application to key cycles, ACM Transactions on Computational Logic, vol.11, issue.2, 2010. ,
DOI : 10.1145/1656242.1656244
URL : https://hal.archives-ouvertes.fr/inria-00525775
SAT-Equiv: An Efficient Tool for Equivalence Properties, 2017 IEEE 30th Computer Security Foundations Symposium (CSF), 2017. ,
DOI : 10.1109/CSF.2017.15
URL : https://hal.archives-ouvertes.fr/hal-01529966
Safely composing security protocols. Formal Methods in System Design, pp.1-36, 2009. ,
DOI : 10.1007/s10703-008-0059-4
URL : https://hal.archives-ouvertes.fr/inria-00181591
Constraint solving for bounded-process cryptographic protocol analysis, Proceedings of the 8th ACM conference on Computer and Communications Security , CCS '01 ,
DOI : 10.1145/501983.502007
Automating Open Bisimulation Checking for the Spi Calculus, 2010 23rd IEEE Computer Security Foundations Symposium, pp.307-321, 2010. ,
DOI : 10.1109/CSF.2010.28
A proof theoretic analysis of intruder theories, Logical Methods in Computer Science, vol.6, issue.3, 2010. ,