M. Abadi and V. Cortier, Deciding knowledge in security protocols under equational theories, Proceedings of the 31st International Colloquium on Automata, Languages, and Programming, pp.46-58, 2004.
URL : https://hal.archives-ouvertes.fr/inria-00000554

M. Abadi and V. Cortier, Deciding Knowledge in Security Protocols under (Many More) Equational Theories, 18th IEEE Computer Security Foundations Workshop (CSFW'05), pp.62-76, 2005.
DOI : 10.1109/CSFW.2005.14
URL : https://hal.archives-ouvertes.fr/inria-00000554

M. Abadi and V. Cortier, Deciding knowledge in security protocols under equational theories, Theoretical Computer Science, vol.387, issue.12, pp.2-32, 2006.
URL : https://hal.archives-ouvertes.fr/inria-00000554

M. Abadi and C. Fournet, Mobile values, new names, and secure communication, Proceedings of the 28th ACM Symposium on Principles of Programming Languages (POPL'01), pp.104-115, 2001.
DOI : 10.1145/360204.360213
URL : https://hal.archives-ouvertes.fr/hal-01423924

F. Baader and K. U. Schulz, Unification in the Union of Disjoint Equational Theories: Combining Decision Procedures, Journal of Symbolic Computation, vol.21, issue.2, pp.211-243, 1996.
DOI : 10.1006/jsco.1996.0009

M. Baudet, V. Cortier, and S. Kremer, Computationally sound implementations of equational theories against passive adversaries, Proceedings of the 32nd International Colloquium on Automata, Languages and Programming (ICALP'05), pp.652-663, 2005.
URL : https://hal.archives-ouvertes.fr/inria-00426620

Y. Chevalier, R. Küsters, M. Rusinowitch, and M. Turuani, An NP decision procedure for protocol insecurity with XOR, 18th Annual IEEE Symposium of Logic in Computer Science, 2003. Proceedings., 2003.
DOI : 10.1109/LICS.2003.1210066
URL : https://hal.archives-ouvertes.fr/inria-00071889

Y. Chevalier and M. Rusinowitch, Combining Intruder Theories, Proceedings of the 32nd International Colloquium on Automata, Languages and Programming (ICALP'05), pp.639-651, 2005.
DOI : 10.1007/11523468_52
URL : https://hal.archives-ouvertes.fr/inria-00070512

Y. Chevalier and M. Rusinowitch, Combining Intruder Theories, 2005.
DOI : 10.1007/11523468_52
URL : https://hal.archives-ouvertes.fr/inria-00070512

Y. Chevalier and M. Rusinowitch, Hierarchical combination of intruder theories, Proceedings of the 17th International Conference on Rewriting Techniques and Applications, pp.108-122, 2006.
URL : https://hal.archives-ouvertes.fr/inria-00329715

H. Comon-lundh and V. Shmatikov, Intruder deductions, constraint solving and insecurity decision in presence of exclusive or, 18th Annual IEEE Symposium of Logic in Computer Science, 2003. Proceedings., 2003.
DOI : 10.1109/LICS.2003.1210067

S. Delaune, Easy intruder deduction problems with homomorphisms, Information Processing Letters, vol.97, issue.6, pp.213-218, 2006.
DOI : 10.1016/j.ipl.2005.11.008

N. Dershowitz and J. Jouannaud, Rewrite Systems, Handbook of Theoretical Computer Science, 1990.
DOI : 10.1016/B978-0-444-88074-1.50011-1

P. Lafourcade, D. Lugiez, and R. Treinen, Intruder deduction for the equational theory of Abelian groups with distributive encryption. Information and Computation, 2007.
URL : https://hal.archives-ouvertes.fr/hal-00496353

Y. Lakhnech, L. Mazaré, and B. Warinschi, Soundness of symbolic equivalence for modular exponentiation, Proceedings of the Second Workshop on Formal and Computational Cryptography (FCC'06), pp.19-23, 2006.
URL : https://hal.archives-ouvertes.fr/inria-00080673

G. Lowe, Breaking and fixing the Needham-Schroeder Public-Key Protocol using FDR, Proceedings of the 2nd International Workshop on Tools and Algorithms for the Construction and Analysis of Systems (TACAS'96), pp.147-166, 1996.
DOI : 10.1007/3-540-61042-1_43

J. Millen and V. Shmatikov, Constraint solving for bounded-process cryptographic protocol analysis, Proceedings of the 8th ACM conference on Computer and Communications Security , CCS '01, 2001.
DOI : 10.1145/501983.502007

L. C. Paulson, The inductive approach to verifying cryptographic protocols, Journal of Computer Security, vol.6, issue.1-2, pp.85-128, 1998.
DOI : 10.3233/JCS-1998-61-205

M. Rusinowitch and M. Turuani, Protocol insecurity with a finite number of sessions and composed keys is NP-complete, Theoretical Computer Science, vol.299, issue.1-3, pp.1-3451, 2003.
DOI : 10.1016/S0304-3975(02)00490-5

M. Schmidt-schauß, Unification in a combination of arbitrary disjoint equational theories, Journal of Symbolic Computation, vol.8, issue.1-2, pp.51-99, 1989.
DOI : 10.1016/S0747-7171(89)80022-7