The AVISPA Tool for the automated validation of internet security protocols and applications, 17th International Conference on Computer Aided Verification, CAV'2005, vol.3576, pp.281-285, 2005. ,
URL : https://hal.archives-ouvertes.fr/inria-00000408
A formal analysis of 5g authentication, 25th ACM Conference on Computer and Communications Security (CCS'18), 2018. ,
URL : https://hal.archives-ouvertes.fr/hal-01898050
Verified models and reference implementations for the tls 1.3 standard candidate, IEEE Symposium on Security and Privacy (S&P'17), pp.483-503, 2017. ,
URL : https://hal.archives-ouvertes.fr/hal-01575920
An Efficient Cryptographic Protocol Verifier Based on Prolog Rules, 14th IEEE Computer Security Foundations Workshop (CSFW-14), pp.82-96, 2001. ,
Symbolic and computational mechanized verification of the ar-inc823 avionic protocols, 30th IEEE Computer Security Foundations Symposium (CSF'17), pp.68-82, 2017. ,
Deepsec: Deciding equivalence properties in security protocols -theory and practice, Proceedings of the 39th IEEE Symposium on Security and Privacy (S&P'18), pp.525-542, 2018. ,
URL : https://hal.archives-ouvertes.fr/hal-01698177
A formal analysis of the neuchâtel e-voting protocol, 3rd IEEE European Symposium on Security and Privacy (EuroSP'18), pp.430-442, 2018. ,
Automated Unbounded Verification of Stateful Cryptographic Protocols with Exclusive OR, CSF 2018, pp.359-373, 2018. ,
URL : https://hal.archives-ouvertes.fr/hal-01780603
Undecidability of bounded security protocols, Workshop on Formal Methods and Security Protocols, 1999. ,
A spectral analysis of Noise: A comprehensive, automated, formal analysis of Diffie-Hellman protocols, Usenix Security, 2020. ,
The TAMARIN Prover for the Symbolic Analysis of Security Protocols, Computer Aided Verification, 25th International Conference, CAV 2013, vol.8044, pp.696-701, 2013. ,
Automated Analysis of Diffie-Hellman Protocols and Advanced Security Properties, CSF 2012, pp.78-94, 2012. ,
Automated verification of group key agreement protocols, IEEE Symposium on Security and Privacy (S&P'14), 2014. ,
, Security protocols open repository
, Main source code repository of the tamarin prover for security protocol verification, A Proofs of Theorems, vol.1, issue.2
, Theorem 1. Given a set of well-formed protocol rules P , a rule ru ? Variant(P ), a variable x occurring in ru, and ? returned by SourceLemma(Variant(P ), ru, x), then ? is satisfied by Variant(P )
, The rule ru is of the form, Proof. Let P be a set of protocol rules, ru ? Variant(P ) and a variable x occurring in ru, let ? be a formula returned by SourceLemma(Variant(P ), ru, x)
, , p.1