Skip to Main content Skip to Navigation
Conference papers

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.
Document type :
Conference papers
Complete list of metadata

https://hal.inria.fr/inria-00565273
Contributor : Pierre-Alain Fouque Connect in order to contact the contributor
Submitted on : Friday, February 11, 2011 - 3:13:49 PM
Last modification on : Wednesday, November 17, 2021 - 12:31:18 PM
Long-term archiving on: : Thursday, May 12, 2011 - 2:47:48 AM

File

podc01.pdf
Files produced by the author(s)

Identifiers

Collections

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. pp.274-283, ⟨10.1145/383962.384044⟩. ⟨inria-00565273⟩

Share

Metrics

Record views

545

Files downloads

1343