Y. Chevalier, R. Küsters, M. Rusinowitch, and M. Turuani, An NP decision procedure for protocol insecurity with XOR, Proc. of 18th Annual IEEE Symposium on Logic in Computer Science (LICS'03), pp.261-270, 2003.
URL : https://hal.archives-ouvertes.fr/inria-00103807

Y. Chevalier and M. Rusinowitch, Combining Intruder Theories, Proc. 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

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

V. Cortier, S. Delaune, and P. Lafourcade, 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

R. Cramer, R. Gennaro, and B. Schoenmakers, A secure and optimally efficient multiauthority election scheme, Proc. International Conference on the Theory and Application of Cryptographic Techniques, pp.103-118, 1997.
DOI : 10.1002/ett.4460080506
URL : http://www.win.tue.nl/~berry/papers/euro97.pdf

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

S. Delaune, An undecidability result for AGh, Theoretical Computer Science, vol.368, issue.1-2, 2006.
DOI : 10.1016/j.tcs.2006.08.018
URL : https://doi.org/10.1016/j.tcs.2006.08.018

S. Delaune and F. Jacquemard, A decision procedure for the verification of security protocols with explicit destructors, Proceedings of the 11th ACM conference on Computer and communications security , CCS '04, pp.278-287, 2004.
DOI : 10.1145/1030083.1030121
URL : https://hal.archives-ouvertes.fr/inria-00579012

S. Delaune, P. Lafourcade, D. Lugiez, and R. Treinen, Symbolic Protocol Analysis in Presence of a Homomorphism Operator and Exclusive Or, 2005.
DOI : 10.1007/11787006_12
URL : https://hal.archives-ouvertes.fr/hal-01759947

D. Dolev and A. Yao, On the security of public key protocols, Proc. of the 22nd Symp. on Foundations of Computer Science, pp.350-357, 1981.

N. Durgin, P. Lincoln, J. Mitchell, and A. Scedrov, Undecidability of bounded security protocols, Proc. Workshop on formal methods in security protocols, 1999.

Q. Guo, P. Narendran, and D. A. Wolfram, Complexity of Nilpotent Unification and Matching Problems, Information and Computation, vol.162, issue.1-2, pp.3-23, 2000.
DOI : 10.1006/inco.1999.2849

P. Lafourcade, D. Lugiez, and R. Treinen, Intruder Deduction for AC-Like Equational Theories with Homomorphisms, Proc. of 16th Int. Conference on Rewriting Techniques and Applications (RTA'05), pp.308-322, 2005.
DOI : 10.1007/978-3-540-32033-3_23

P. Lafourcade, D. Lugiez, and R. Treinen, Intruder Deduction for the Equational Theory of Exclusive-or with Commutative and Distributive Encryption, Electronic Notes in Theoretical Computer Science, vol.171, issue.4, 2005.
DOI : 10.1016/j.entcs.2007.02.054

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
URL : http://www.cs.utexas.edu/~shmat/shmat_ccs01.pdf

J. Millen and V. Shmatikov, Symbolic protocol analysis with an Abelian group operator or Diffie???Hellman exponentiation, Journal of Computer Security, vol.13, issue.3, pp.515-564, 2005.
DOI : 10.3233/JCS-2005-13306

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