M. Abadi and V. Cortier, Deciding knowledge in security protocols under equational theories, Theoretical Computer Science, vol.367, issue.1-2, pp.2-32, 2006.
DOI : 10.1016/j.tcs.2006.08.032
URL : https://hal.archives-ouvertes.fr/inria-00000554

S. Anantharaman, C. Bouchard, P. Narendran, and M. Rusinowitch, Unification Modulo Chaining, Proc. of 6th Int. Conference on Language and Automata Theory and Applications -LATA 2012, pp.70-82, 2012.
DOI : 10.1007/978-3-642-28332-1_7
URL : https://hal.archives-ouvertes.fr/hal-00659027

S. Anantharaman, P. Narendran, and M. Rusinowitch, Intruders with Caps, Proc. of the Int. Conference RTA'07, pp.20-35, 2007.
DOI : 10.1007/978-3-540-73449-9_4
URL : https://hal.archives-ouvertes.fr/hal-00144178

S. Anantharaman, H. Lin, C. Lynch, P. Narendran, and M. Rusinowitch, Unification Modulo Homomorphic Encryption, Journal of Automated Reasoning, vol.3, issue.1-2, pp.135-158, 2012.
DOI : 10.1016/S0747-7171(87)80026-3
URL : https://hal.archives-ouvertes.fr/inria-00618336

F. Baader and W. Snyder, Unification Theory, Handbook of Automated Reasoning, pp.440-526, 2001.

M. Bellare, R. Guérin, and P. Rogaway, XOR MACs: New Methods for Message Authentication Using Finite Pseudorandom Functions, Proc. of the Int. Conference CRYPT0 '95, pp.15-28, 1995.
DOI : 10.1007/3-540-44750-4_2

M. Baudet, 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

H. Comon-lundh and R. Treinen, Easy Intruder Deductions Verification: Theory and Practice, Essays Dedicated to Zohar Manna on the Occasion of His 64th Birthday, LNCS 2772, pp.225-242, 2003.

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., pp.271-280, 2003.
DOI : 10.1109/LICS.2003.1210067

N. Dershowitz, Termination of rewriting, Journal of Symbolic Computation, vol.3, issue.1-2, pp.69-116, 1987.
DOI : 10.1016/S0747-7171(87)80022-6

D. Dolev, S. Even, and R. Karp, On the security of ping-pong protocols, Information and Control, vol.55, issue.1-3, pp.57-68, 1982.
DOI : 10.1016/S0019-9958(82)90401-6

Q. Guo, P. Narendran, and D. A. Wolfram, Unification and matching modulo nilpotence, Proc. of the 13th Int. Conf. on Automated DeductionCADE-13), LNCS 1104, pp.261-274, 1996.
DOI : 10.1007/3-540-61511-3_90
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.50.5315

J. Hullot, Canonical forms and unification, Proc. of the 5th Int. Conf. on Automated Deduction, pp.318-334, 1980.
DOI : 10.1007/3-540-10009-1_25

J. Jouannaud and C. Kirchner, Solving Equations in Abstract Algebras: a Rule-Based Survey of Unification, Computational Logic: Essays in Honor of Alan Robinson, pp.360-394, 1991.

P. C. Kanellakis and P. Z. Revesz, On the relationship of congruence closureand unification, Journal of Symbolic Computation, vol.7, issue.3-4, pp.427-444, 1989.
DOI : 10.1016/S0747-7171(89)80018-5

C. Lynch and Z. Liu, Efficient General Unification for XOR with Homomorphism, em Proc. of the 23rd Int. Conference on Automated Seduction23), LNCS 6803, pp.407-421, 2011.

C. Lynch and B. Morawska, Basic Syntactic Mutation, em Proc. of the 18th Int. Conference on Automated DeductionCADE-18), LNAI 2392, pp.471-485, 2002.
DOI : 10.1007/3-540-45620-1_37
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.8.8172

J. Millen and H. Ko, Narrowing terminates for encryption, Proceedings 9th IEEE Computer Security Foundations Workshop, pp.39-44, 1996.
DOI : 10.1109/CSFW.1996.503689

K. G. Paterson, T. Ristenpart, and T. Shrimpton, Tag Size Does Matter: Attacks and Proofs for the TLS Record Protocol, Proc. of Int. Conference ASIACRYPT 2011, pp.372-389, 2011.
DOI : 10.1007/978-3-642-25385-0_20

T. J. Schaefer, The complexity of satisfiability problems, Proceedings of the tenth annual ACM symposium on Theory of computing , STOC '78, pp.216-226, 1978.
DOI : 10.1145/800133.804350