B. Adida, Advances in Cryptographic Voting Systems, 2006.

B. Adida, O. Olivier-de-marneffe, J. Pereira, and . Quisquater, Electing a University President Using Open-Audit Voting: Analysis of Real-World Use of Helios, EVT/WOTE'09: Electronic Voting Technology Workshop/Workshop on Trustworthy Elections. USENIX Association, 2009.

M. Backes, M. Hrit¸cuhrit¸cu, and . Maffei, Automated Verification of Remote Electronic Voting Protocols in the Applied Pi-Calculus, 2008 21st IEEE Computer Security Foundations Symposium, pp.195-209, 2008.
DOI : 10.1109/CSF.2008.26

J. Cohen-benaloh and M. Yung, Distributing the power of a government to enhance the privacy of voters, Proceedings of the fifth annual ACM symposium on Principles of distributed computing , PODC '86, pp.52-62, 1986.
DOI : 10.1145/10590.10595

[. Cramer, I. Damgård, and B. Schoenmakers, Proofs of Partial Knowledge and Simplified Design of Witness Hiding Protocols, CRYPTO'94: 14th International Cryptology Conference, pp.174-187, 1994.
DOI : 10.1007/3-540-48658-5_19

I. Cramer, M. K. Franklin, B. Schoenmakers, and M. Yung, Multi-Autority Secret-Ballot Elections with Linear Work, EUROCRYPT'96: 15th International Conference on the Theory and Applications of Cryptographic Techniques, pp.72-83, 1996.
DOI : 10.1007/3-540-68339-9_7
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.112.3309

[. Chor, S. Goldwasser, S. Micali, and B. Awerbuch, Verifiable secret sharing and achieving simultaneity in the presence of faults, 26th Annual Symposium on Foundations of Computer Science (sfcs 1985), pp.383-395, 1985.
DOI : 10.1109/SFCS.1985.64

[. Cramer, R. Gennaro, and B. Schoenmakers, A Secure and Optimally Efficient Multi-Authority Election Scheme, EUROCRYPT'97: 16th International Conference on the Theory and Applications of Cryptographic Techniques, pp.103-118, 1997.

D. Chaum and T. P. Pedersen, Wallet Databases with Observers, CRYPTO'92: 12th International Cryptology Conference, pp.89-105, 1993.
DOI : 10.1007/3-540-48071-4_7

B. Chor and M. O. Rabin, Achieving independence in logarithmic number of rounds, Proceedings of the sixth annual ACM Symposium on Principles of distributed computing , PODC '87, pp.260-268, 1987.
DOI : 10.1145/41840.41862

[. Chaum, Y. A. Peter, S. Ryan, and . Schneider, A Practical Voter-Verifiable Election Scheme, ESORICS'05: 10th European Symposium On Research In Computer Security, pp.118-139, 2005.
DOI : 10.1007/11555827_8

V. Cortier and B. Smyth, Attacking and fixing Helios: An analysis of ballot secrecy, CSF'11: 24th Computer Security Foundations Symposium. IEEE Computer Society, 2011.
URL : https://hal.archives-ouvertes.fr/hal-00732899

[. Dolev, C. Dwork, and M. Naor, Non-malleable cryptography, Proceedings of the twenty-third annual ACM symposium on Theory of computing , STOC '91, pp.542-552, 1991.
DOI : 10.1145/103418.103474
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.26.8267

[. Delaune, S. Kremer, and M. D. Ryan, Verifying privacy-type properties of electronic voting protocols, Journal of Computer Security, vol.17, issue.4, pp.435-487, 2009.
DOI : 10.3233/JCS-2009-0340

[. Gennaro, Achieving independence efficiently and securely, Proceedings of the fourteenth annual ACM symposium on Principles of distributed computing , PODC '95, pp.130-136, 1995.
DOI : 10.1145/224964.224979
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.32.618

B. Smyth and &. Gennaro, A Protocol to Achieve Independence in Constant Rounds, IEEE Transactions on Parallel and Distributed Systems, vol.11, issue.7, pp.636-647, 2000.

A. Juels, D. Catalano, and M. Jakobsson, Coercion-resistant electronic elections, Proceedings of the 2005 ACM workshop on Privacy in the electronic society , WPES '05, 2002.
DOI : 10.1145/1102199.1102213
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.11.8779

S. Kremer and M. D. Ryan, Analysis of an Electronic Voting Protocol in the Applied Pi Calculus, ESOP'05: 14th European Symposium on Programming, pp.186-200
DOI : 10.1007/978-3-540-31987-0_14

S. Kremer, M. D. Ryan, and B. Smyth, Election Verifiability in Electronic Voting Protocols, ESORICS'10: 15th European Symposium on Research in Computer Security, pp.389-404, 2010.
DOI : 10.1007/978-3-642-15497-3_24

K. Arjen, H. W. Lenstra, and . Lenstra-jr, Algorithms in Number Theory, Algorithms and Complexity, vol.12, pp.673-716, 1990.

P. Torben and . Pedersen, A Threshold Cryptosystem without a Trusted Party, EUROCRYPT'91: 10th International Conference on the Theory and Applications of Cryptographic Techniques, number 547 in LNCS, pp.522-526, 1991.

B. Smyth and V. Cortier, Attacking and fixing helios: An analysis of ballot secrecy, Cryptology ePrint Archive Report, vol.625, 2010.
URL : https://hal.archives-ouvertes.fr/hal-00732899

D. Shanks, Class number, a theory of factorization, and genera, Number Theory Institute of Symposia in Pure Mathematics, pp.415-440, 1971.
DOI : 10.1090/pspum/020/0316385

K. Sako and J. Kilian, Secure Voting Using Partially Compatible Homomorphisms, CRYPTO'94: 14th International Cryptology Conference, pp.411-424, 1994.
DOI : 10.1007/3-540-48658-5_37

I. Wikström, Simplified Submission of Inputs to Protocols, Cryptology ePrint Archive Report, vol.259, 2006.
DOI : 10.1007/978-3-540-85855-3_20

[. Wikström, Simplified Submission of Inputs to Protocols, SCN'08: 6th International Conference on Security and Cryptography for Networks, pp.293-308, 2008.
DOI : 10.1007/978-3-540-85855-3_20

I. Centre-de-recherche, ?. Nancy, and L. Est, Technopôle de Nancy-Brabois -Campus scientifique 615, rue du Jardin Botanique -BP 101 -54602 Villers-lès