Practical multi-candidate election system

Abstract : The aim of electronic voting schemes is to provide a set of protocols that allow voters to cast ballots while a group of authorities collect the votes and output the final tally. In this paper we describe a practical multi-candidate election scheme that guarantees privacy of voters, public verifiablity and robustness against a coalition of malicious authorities. Furthermore, we address the problem of receipt-freeness and incoercibility of voters. Our new scheme is based on the Paillier cryptosystem and on some related zero-knowledge proof techniques. The voting schemes are very practical and can be efficiently implemented in a real system.
Type de document :
Communication dans un congrès
Proceedings of the Twentieth Annual ACM Symposium on Principles of Distributed Computing : PODC 2001, 2001, Newport, Rhode Island, United States. ACM, pp.274-283, 2001, 〈10.1145/383962.384044〉
Liste complète des métadonnées

https://hal.inria.fr/inria-00565273
Contributeur : Pierre-Alain Fouque <>
Soumis le : vendredi 11 février 2011 - 15:13:49
Dernière modification le : jeudi 11 janvier 2018 - 06:19:17
Document(s) archivé(s) le : jeudi 12 mai 2011 - 02:47:48

Fichier

podc01.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

Collections

PSL

Citation

Olivier Baudron, Pierre-Alain Fouque, David Pointcheval, Jacques Stern, Guillaume Poupard. Practical multi-candidate election system. Proceedings of the Twentieth Annual ACM Symposium on Principles of Distributed Computing : PODC 2001, 2001, Newport, Rhode Island, United States. ACM, pp.274-283, 2001, 〈10.1145/383962.384044〉. 〈inria-00565273〉

Partager

Métriques

Consultations de la notice

299

Téléchargements de fichiers

345