, Identification cards. Machine readable travel documents, International Civil Aviation Organization
Écrire en chancellerie, Les clercs au palais, 2010. ,
Mobile values, new names, and secure communication, Proceedings of the 28th ACM SIGPLAN-SIGACT symposium on Principles of programming languages - POPL '01, pp.104-115, 2001. ,
URL : https://hal.archives-ouvertes.fr/hal-01423924
A Calculus for Cryptographic Protocols: The Spi Calculus, Information and Computation, vol.148, issue.1, pp.1-70, 1999. ,
The AVISPA Tool for the Automated Validation of Internet Security Protocols and Applications, Computer Aided Verification, vol.3576, pp.281-285, 2005. ,
URL : https://hal.archives-ouvertes.fr/inria-00000408
Deciding security of protocols against off-line guessing attacks, Proceedings of the 12th ACM conference on Computer and communications security - CCS '05, 2005. ,
An efficient cryptographic protocol verifier based on prolog rules, Proceedings. 14th IEEE Computer Security Foundations Workshop, 2001. ,
4 Modèle pragmatique et sémantique des connecteurs prépositionnels, Les connecteurs contenant des prépositions en français, pp.165-226, 2013. ,
Automated Verification of Equivalence Properties of Cryptographic Protocols, Programming Languages and Systems, vol.7211, pp.108-127, 2012. ,
URL : https://hal.archives-ouvertes.fr/inria-00632564
Automated Verification of Equivalence Properties of Cryptographic Protocols, Programming Languages and Systems, pp.108-127, 2012. ,
URL : https://hal.archives-ouvertes.fr/inria-00632564
APTE: An Algorithm for Proving Trace Equivalence, Tools and Algorithms for the Construction and Analysis of Systems, vol.8413, pp.587-592, 2014. ,
DEEPSEC: Deciding Equivalence Properties in Security Protocols Theory and Practice, 2018 IEEE Symposium on Security and Privacy (SP), pp.525-542, 2018. ,
URL : https://hal.archives-ouvertes.fr/hal-01698177
Typing Messages for Free in Security Protocols, ACM Transactions on Computational Logic, vol.21, issue.1, pp.1-52, 2020. ,
From Security Protocols to Pushdown Automata, Automata, Languages, and Programming, pp.137-149, 2013. ,
Typing Messages for Free in Security Protocols: The Case of Equivalence Properties, CONCUR 2014 ? Concurrency Theory, vol.8704, pp.372-386, 2014. ,
Decidability of Trace Equivalence for Protocols with Nonces, 2015 IEEE 28th Computer Security Foundations Symposium, pp.170-184, 2015. ,
URL : https://hal.archives-ouvertes.fr/hal-01206276
New Decidability Results for Fragments of First-Order Logic and Application to Cryptographic Protocols, Rewriting Techniques and Applications, vol.2706, pp.148-164, 2003. ,
Bounding the Number of Agents, for Equivalence Too, Lecture Notes in Computer Science, vol.9635, pp.211-232, 2016. ,
URL : https://hal.archives-ouvertes.fr/hal-01361286
Efficiently Deciding Equivalence for Standard Primitives and Phases, Computer Security, pp.491-511, 2018. ,
URL : https://hal.archives-ouvertes.fr/hal-01900083
SAT-Equiv: An Efficient Tool for Equivalence Properties, 2017 IEEE 30th Computer Security Foundations Symposium (CSF), pp.481-494, 2017. ,
URL : https://hal.archives-ouvertes.fr/hal-01624274
A Decidable Class of Security Protocols for Both Reachability and Equivalence Properties, Journal of Automated Reasoning, 2020. ,
URL : https://hal.archives-ouvertes.fr/hal-02446170
, , 2020.
The Scyther Tool: Verification, Falsification, and Analysis of Security Protocols, Computer Aided Verification, pp.414-418 ,
Automating open bisimulation checking for the spi-calculus, IEEE Computer Security Foundations Symposium (CSF 2010), 2010. ,
Implementing and Proving the TLS 1.3 Record Layer, 2017 IEEE Symposium on Security and Privacy (SP), pp.463-482, 2017. ,
URL : https://hal.archives-ouvertes.fr/hal-01674096
Timestamps in key distribution protocols, Communications of the ACM, vol.24, issue.8, pp.533-536, 1981. ,
Decidability for Lightweight Diffie-Hellman Protocols, 2014 IEEE 27th Computer Security Foundations Symposium, 2014. ,
Multiset rewriting and the complexity of bounded security protocols, Journal of Computer Security, vol.12, issue.2, pp.247-311, 2004. ,
A rewriting-based inference system for the NRL Protocol Analyzer and its meta-logical properties, Theoretical Computer Science, vol.367, issue.1-2, pp.162-202, 2006. ,
Leakiness is Decidable for Well-Founded Protocols, Lecture Notes in Computer Science, pp.176-195, 2015. ,
A Method for Verifying Privacy-Type Properties: The Unbounded Case, 2016 IEEE Symposium on Security and Privacy (SP), 2016. ,
Towards a completeness result for model checking of security protocols, Proceedings. 11th IEEE Computer Security Foundations Workshop (Cat. No.98TB100238) ,
The TAMARIN Prover for the Symbolic Analysis of Security Protocols, Computer Aided Verification, vol.8044, pp.696-701, 2013. ,
Tagging Makes Secrecy Decidable with Unbounded Nonces as Well, Lecture Notes in Computer Science, pp.363-374, 2003. ,
Protocol insecurity with a finite number of sessions and composed keys is NP-complete, Theoretical Computer Science, vol.299, issue.1-3, pp.451-475, 2003. ,