D. Armando, Y. Basin, Y. Boichut, L. Chevalier, J. Compagna et al., Verifying privacy-type properties of electronic voting protocols, Journal of Computer Security, 2009.

P. [. Knuth and . Bendix, Simple Word Problems in Universal Algebras, Computational Problems in Abstract Algebra, pp.263-297, 1970.
DOI : 10.1007/978-3-642-81955-1_23

. Lee, . Boyd, . Dawson, Y. Kim, and Y. , Providing Receipt-Freeness in Mixnet-Based Voting Protocols, ICISC: International Conference on Information Security and Cryptology, 2003.
DOI : 10.1007/978-3-540-24691-6_19

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

. Mcallester, Automatic recognition of tractability in inference relations, Journal of the ACM, vol.40, issue.2, 1993.
DOI : 10.1145/151261.151265

]. T. Oka96 and . Okamoto, An electronic voting scheme, IFIP World Conference on IT Tools, pp.21-30, 1996.

M. [. Rusinowitch and . Turuani, Protocol insecurity with finite number of sessions is NP-complete, Proceedings. 14th IEEE Computer Security Foundations Workshop, 2001., pp.174-190, 2001.
DOI : 10.1109/CSFW.2001.930145
URL : https://hal.archives-ouvertes.fr/inria-00100411

I. Loria and . Technopôle-de-nancy, Brabois -Campus scientifique 615, rue du Jardin Botanique -BP 101 -54602 Villers-lès