B. Adida, Helios: web-based open-audit voting, Proceedings of the 17th conference on Security Symposium (SS'08), pp.335-348, 2008.

O. Baudron, P. Fouque, D. Pointcheval, J. Stern, and G. Poupard, Practical multi-candidate election system, Proceedings of the twentieth annual ACM symposium on Principles of distributed computing , PODC '01, pp.274-283, 2001.
DOI : 10.1145/383962.384044

URL : https://hal.archives-ouvertes.fr/inria-00565273

J. Benaloh, Secret sharing homomorphisms: keeping shares of a secret secret Advances in CRYPTO, LNCS, vol.86, issue.263, pp.251-260, 1986.

J. Benaloh, Towards simple verifiable elections, Proceedings of IAVoSS Workshop on Trustworthy Election (WOTE'06), pp.61-68, 2006.

J. Benaloh, T. Moran, L. Naish, K. Ramchen, and V. Teague, Shuffle-Sum: Coercion-Resistant Verifiable Tallying for STV Voting, IEEE Transactions on Information Forensics and Security, vol.4, issue.4, pp.685-698, 2009.
DOI : 10.1109/TIFS.2009.2033757

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.155.2784

C. Burton, C. Culnane, J. Heather, T. Peacock, Y. A. Peter et al., A supervised verifiable voting protocol for the Victorian Electoral Commission, the 5th International Conference on Electronic Voting, p.2012, 2012.

C. Burton, C. Culnane, J. Heather, T. Peacock, Y. A. Peter et al., Using PrêtPrêtà Voter in the Victorian State elections, the 2012 USENIX/ACCURATE Electronic Voting Technology Workshop, p.2012, 2012.

D. Chaum, Y. A. Peter, S. A. Ryan, and . Schneider, A practical voterverifiable election scheme, Proceedings of the 10th European Symposium on Research in Computer Science (ESORICS'05), pp.118-139, 2005.
DOI : 10.1007/11555827_8

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.456.7748

R. Cramer, M. Franklin, B. Schoenmakers, and M. Yung, Multiauthority secret-ballot elections with linear work, Advances in EUROCRYPT'96, pp.72-82, 1996.
DOI : 10.1007/3-540-68339-9_7

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.112.3309

R. Cramer, R. Gennaro, and B. Schoenmakers, A secure and optimally efficient multi-authority election scheme, Advances in EUROCRYPT'97, pp.103-118, 1997.
DOI : 10.1007/3-540-69053-0_9

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.107.8654

W. Diffie and M. Hellman, Special Feature Exhaustive Cryptanalysis of the NBS Data Encryption Standard, Computer, vol.10, issue.6, pp.74-84, 1977.
DOI : 10.1109/C-M.1977.217750

T. Elgamal, A public key cryptosystem and a signature scheme based on discrete logarithms, IEEE Transactions on IT, vol.31, issue.4, pp.467-472, 1985.
DOI : 10.1109/tit.1985.1057074

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.476.4791

J. Furukawa and K. Sako, An efficient scheme for proving a shuffle Advances in CRYPTO'01, LNCS, vol.2139, pp.368-387, 2001.

R. Gennaro, S. Jarecki, H. Krawczyk, and T. Rabin, Secure distributed key generation for discrete-log based cryptosystems Advances in EURO- CRYPT'99, LNCS, vol.1592, pp.295-310, 1999.

E. Donald and . Knuth, The Art of Computer Programming, Volume II: Seminumerical Algorithms, 1981.

R. Merkle and M. Hellman, On the security of multiple encryption, Communications of the ACM, vol.24, issue.7, 1981.
DOI : 10.1145/358699.358718

C. and A. Neff, A verifiable secret shuffle and its application to e-voting, Proceedings of the 8th ACM conference on Computer and Communications Security , CCS '01, pp.116-125, 2001.
DOI : 10.1145/501983.502000

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.104.3124

P. Paillier, Public-key cryptosystems based on discrete logarithms residues, Advances in EUROCRYPT'99, pp.223-238, 1999.

P. Torben and . Pedersen, A threshold cryptosystem without a trusted party, Advances in EUROCRYPT'91, pp.522-526, 1991.

Y. A. Peter, D. Ryan, J. Bismark, S. Heather, Z. Schneider et al., PrêtPrêtà Voter: a Voter-Verifiable Voting System, IEEE Transactions on Information Forensics and Security (Special Issue on Electronic Voting), pp.662-673, 2009.

Y. A. Peter, S. A. Ryan, and . Schneider, PrêtPrêtà Voter with re-encryption mixes, Proceedings of the 11th European Symposium on Research in Computer Science (ESORICS'06), pp.313-326, 2006.

K. Sako and J. Kilian, Receipt-Free Mix-Type Voting Scheme, Advances in EUROCRYPT'95, pp.393-403, 1995.
DOI : 10.1007/3-540-49264-X_32

V. Teague, K. Ramchen, and L. Naish, Coercion-resistant tallying for STV voting, USENIX/ACCURATE Electronic Voting Workshop (EVT'08), 2008.