Mobile values, new names, and secure communication, 28th Symposium on Principles of Programming Languages (POPL'01), pp.104-115, 2001. ,
DOI : 10.1145/373243.360213
URL : https://hal.archives-ouvertes.fr/hal-01423924
A calculus for cryptographic protocols, Proceedings of the 4th ACM conference on Computer and communications security , CCS '97, pp.1-70, 1999. ,
DOI : 10.1145/266420.266432
Analysing Unlinkability and Anonymity Using the Applied Pi Calculus, 2010 23rd IEEE Computer Security Foundations Symposium, pp.107-121, 2010. ,
DOI : 10.1109/CSF.2010.15
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.172.5739
Formal analysis of SAML 2.0 web browser single sign-on, Proceedings of the 6th ACM workshop on Formal methods in security engineering, FMSE '08, pp.1-10, 2008. ,
DOI : 10.1145/1456396.1456397
The AVISPA Tool for the Automated Validation of Internet Security Protocols and Applications, 17th International Conference on Computer Aided Verification (CAV'05), pp.281-285, 2005. ,
DOI : 10.1007/11513988_27
URL : https://hal.archives-ouvertes.fr/inria-00000408
A Privacy-Friendly RFID Protocol Using Reusable Anonymous Tickets, 2011IEEE 10th International Conference on Trust, Security and Privacy in Computing and Communications, pp.206-213, 2011. ,
DOI : 10.1109/TrustCom.2011.29
Symbolic verification of privacy-type properties for security protocols with XOR (extended version) Research report, Inria Nancy -Grand Est, 2017. ,
A Reduced Semantics for Deciding Trace Equivalence Using Constraint Systems, 3rd International Conference on Principles of Security and Trust (POST'14), pp.1-21, 2014. ,
DOI : 10.1007/978-3-642-54792-8_1
URL : http://arxiv.org/abs/1401.2854
Partial order reduction for security protocols, 26th International Conference on Concurrency Theory (CONCUR'15) Leibniz- Zentrum für Informatik, pp.497-510, 2015. ,
Provably Repairing the ISO/IEC 9798 Standard for Entity Authentication, Journal of Computer Security, vol.21, issue.6, pp.817-846, 2013. ,
DOI : 10.1007/978-3-642-28641-4_8
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.377.9839
Automated Symbolic Proofs of Observational Equivalence, Proceedings of the 22nd ACM SIGSAC Conference on Computer and Communications Security, CCS '15, pp.1144-1155, 2015. ,
DOI : 10.1145/2810103.2813662
URL : https://hal.archives-ouvertes.fr/hal-01337409
Deciding security of protocols against off-line guessing attacks, Proceedings of the 12th ACM conference on Computer and communications security , CCS '05, pp.16-25, 2005. ,
DOI : 10.1145/1102120.1102125
Triple Handshakes and Cookie Cutters: Breaking and Fixing Authentication over TLS, 2014 IEEE Symposium on Security and Privacy, pp.98-113, 2014. ,
DOI : 10.1109/SP.2014.14
URL : https://hal.archives-ouvertes.fr/hal-01102259
Automatic proof of strong secrecy for security protocols, IEEE Symposium on Security and Privacy, 2004. Proceedings. 2004, pp.86-100, 2004. ,
DOI : 10.1109/SECPRI.2004.1301317
Automated Verification of Selected Equivalences for Security Protocols, 20th Annual IEEE Symposium on Logic in Computer Science (LICS' 05), pp.331-340, 2005. ,
DOI : 10.1109/LICS.2005.8
Automatic Cryptographic Protocol Verifier, 2016. ,
Analysing unlinkability and anonymity using the applied pi calculus, 23rd Computer Security Foundations Symposium (CSF'10), pp.107-121, 2010. ,
Automated verification of equivalence properties of cryptographic protocol, ACM Transactions on Computational Logic, vol.23, issue.4, p.2016 ,
Trace equivalence decision, Proceedings of the 18th ACM conference on Computer and communications security, CCS '11, pp.321-330, 2011. ,
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 ,
DOI : 10.1016/j.tcs.2013.04.016
URL : https://hal.archives-ouvertes.fr/hal-00881060
An NP decision procedure for protocol insecurity with XOR, 18th Annual IEEE Symposium of Logic in Computer Science, 2003. Proceedings., pp.261-270, 2003. ,
DOI : 10.1109/LICS.2003.1210066
URL : https://hal.archives-ouvertes.fr/inria-00071889
The Finite Variant Property: How to Get Rid of Some Algebraic Properties, Proceedings of the 16th International Conference on Rewriting Techniques and Applications (RTA'05), pp.294-307, 2005. ,
DOI : 10.1007/978-3-540-32033-3_22
Intruder deductions, constraint solving and insecurity decision in presence of exclusive or, 18th Annual IEEE Symposium of Logic in Computer Science, 2003. Proceedings., pp.271-280, 2003. ,
DOI : 10.1109/LICS.2003.1210067
Analysing Password Protocol Security Against Off-line Dictionary Attacks, Electronic Notes in Theoretical Computer Science, vol.121, pp.47-63, 2005. ,
DOI : 10.1016/j.entcs.2004.10.007
URL : http://doi.org/10.1016/j.entcs.2004.10.007
A survey of algebraic properties used in cryptographic protocols, Journal of Computer Security, vol.14, issue.1, pp.1-43, 2006. ,
DOI : 10.3233/JCS-2006-14101
URL : https://hal.archives-ouvertes.fr/inria-00000552
Security Protocols, Constraint Systems, and Group Theories, 6th International Joint Conference on Automated Reasoning (IJCAR'12), pp.164-178, 2012. ,
DOI : 10.1007/978-3-642-31365-3_15
URL : https://hal.archives-ouvertes.fr/hal-00729091
Verifying privacy-type properties of electronic voting protocols, Journal of Computer Security, vol.17, issue.4, pp.435-487, 2009. ,
DOI : 10.3233/JCS-2009-0340
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.142.1731
Maude-NPA: Cryptographic Protocol Analysis Modulo Equational Properties, Foundations of Security Analysis and Design V, pp.1-50, 2009. ,
DOI : 10.1007/s10990-007-9000-6
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.226.3197
Folding variant narrowing and optimal variant termination, The Journal of Logic and Algebraic Programming, vol.81, issue.7-8, pp.898-928, 2012. ,
DOI : 10.1016/j.jlap.2012.01.002
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.226.3740
Using one-way functions for authentication, ACM SIGCOMM Computer Communication Review, vol.19, issue.5, pp.8-11, 1989. ,
DOI : 10.1145/74681.74682
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.47.4472
Protecting poorly chosen secrets from guessing attacks, IEEE Journal on Selected Areas in Communications, vol.11, issue.5, pp.648-656, 1993. ,
DOI : 10.1109/49.223865
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.208.5305
Analysis of the ibm cca security api protocols in maudenpa, 1st International Conference on Security Standardisation Research (SSR'14), pp.111-130, 2014. ,
Reducing protocol analysis with XOR to the xor-free case in the Horn theory based approach, J. Autom. Reasoning, vol.46, pp.3-4325, 2011. ,
Breaking and fixing the Needham-Schroeder Public-Key Protocol using FDR, Tools and Algorithms for the Construction and Analysis of Systems (TACAS'96), pp.147-166, 1996. ,
DOI : 10.1007/3-540-61042-1_43
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.27.6385
Privacy and security in library RFID, Proceedings of the 11th ACM conference on Computer and communications security , CCS '04, pp.210-219, 2004. ,
DOI : 10.1145/1030083.1030112
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.58.5470
A Formal Definition of Protocol Indistinguishability and Its Verification Using Maude-NPA, 10th International Workshop on Security and Trust Management (STM'14), pp.162-177, 2014. ,
DOI : 10.1007/978-3-319-11851-2_11
The TAMARIN prover for the symbolic analysis of security protocols, 25th International Conference on Computer Aided Verification (CAV'13), pp.696-701, 2013. ,
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
The impossibility of computationally sound XOR, IACR Cryptology ePrint Archive, p.389, 2010. ,
Attacks on RFID protocols, IACR Cryptology ePrint Archive, p.310, 2008. ,