, An efficient cryptographic protocol verifier based on prolog rules, Proceedings. 14th IEEE Computer Security Foundations Workshop, 2001.
DOI : 10.1109/CSFW.2001.930138
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.14.5150
, The AVANTSSAR Platform for the Automated Validation of Trust and Security of Service-Oriented Architectures, Proceedings of the 18th International Conference on Tools and Algorithms for the Construction and Analysis of Systems ser. Lecture Notes in Computer Science, pp.267-282, 2012.
DOI : 10.1007/978-3-642-28756-5_19
URL : https://hal.archives-ouvertes.fr/hal-00759725
, 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.
DOI : 10.1016/j.tcs.2006.08.035
, The Scyther Tool: Verification, Falsification, and Analysis of Security Protocols, Computer Aided Verification, 20th International Conference, pp.414-418, 2008.
DOI : 10.1007/978-3-540-70545-1_38
, The TAMARIN Prover for the Symbolic Analysis of Security Protocols, Computer Aided Verification, 25th International Conference, CAV 2013 Proc., ser. Lecture Notes in Computer Science, N. Sharygina and H. Veith, pp.696-701, 2013.
DOI : 10.1007/978-3-642-39799-8_48
, A Formal Definition of Protocol Indistinguishability and Its Verification Using Maude-NPA, STM 2014, ser, pp.162-177, 2014.
DOI : 10.1007/978-3-319-11851-2_11
, Undecidability of bounded security protocols, 1999.
, Trace equivalence decision, Proceedings of the 18th ACM conference on Computer and communications security, CCS '11, 2011.
DOI : 10.1145/2046707.2046744
URL : http://kar.kent.ac.uk/46878/1/CCD-ccs11.pdf
, Automating open bisimulation checking for the spi-calculus, Proceedings of IEEE Computer Security Foundations Symposium, 2010.
, Automated verification of equivalence properties of cryptographic protocols, Programming Languages and Systems ?Proceedings of the 21th European Symposium on Programming (ESOP'12), ser. Lecture Notes in Computer Science, pp.108-127, 2012.
URL : https://hal.archives-ouvertes.fr/inria-00632564
, APTE: An Algorithm for Proving Trace Equivalence, Proceedings of the 20th International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS'14), ser. Lecture Notes in Computer Science
DOI : 10.1007/978-3-642-54862-8_50
URL : http://kar.kent.ac.uk/46724/1/Cheval-tacas14.pdf
, A Reduced Semantics for Deciding Trace Equivalence Using Constraint Systems, Proc. 3rd 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
, Fast planning through planning graph analysis, Artificial Intelligence, vol.90, issue.1-2, pp.281-300, 1997.
DOI : 10.1016/S0004-3702(96)00047-1
URL : http://doi.org/10.1016/s0004-3702(96)00047-1
, Planning as satisfiability, ECAI, pp.359-363, 1992.
, SAT-based model-checking for security protocols analysis, International Journal of Information Security, vol.9, issue.1, pp.3-32, 2008.
DOI : 10.1007/s10207-007-0041-y
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.167.5936
, SATMC: a SAT-based model checker for security-critical systems A survey of symbolic methods for establishing equivalence-based properties in cryptographic protocols, Proceedings of the 20th international Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS'14, pp.31-45, 2014.
, Typing messages for free in security protocols: the case of equivalence propertiesCONCUR'14), ser. Lecture Notes in Computer Science, Proceedings of the 25th International Conference on Concurrency Theory, pp.372-386, 2014.
, Mobile values, new names, and secure communication, Proceedings of the 28th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, ser. POPL '01, pp.104-115, 2001.
DOI : 10.1145/373243.360213
URL : https://hal.archives-ouvertes.fr/hal-01423924
, 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
, A survey of authentication protocol literature : Version 1.0, 1997.
, Verification of cryptographic protocols: Tagging enforces termination, Foundations of Software Science and Computation Structures (FoSSaCS'03)
DOI : 10.1007/3-540-36576-1_9
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.123.7532
, Checking Trace Equivalence: How to Get Rid of Nonces?, Proceedings of the 20th European Symposium on Research in Computer Security (ESORICS'15), ser. Lecture Notes in Computer Science, 2015.
DOI : 10.1007/BFb0055718
, Bounding the number of agents, for equivalence too and Trust (POST'16), ser, Proceedings of the 5th International Conference on Principles of Security, 2016.
, SAT-based Model-Checking of Security Protocols, 2005.
, An Extensible SAT-solver, pp.502-518, 2003.
, A trace based bisimulation for the spi calculus, Programming Languages and Systems, pp.367-382, 2007.
, Automated verification of equivalence properties of cryptographic protocol, ACM Transactions on Computational Logic, 2016.
, StatVerif: Verification of stateful processes, Journal of Computer Security, vol.22, issue.5, pp.743-821, 2014.
DOI : 10.3233/JCS-140501
URL : http://doi.org/10.3233/jcs-140501
, R k ? ? ?] does not unify with v, (as r n ? Concrete ? (r ? )). So tr