Practical multi-candidate election system
- 1 August 2001
- proceedings article
- Published by Association for Computing Machinery (ACM)
- p. 274-283
- https://doi.org/10.1145/383962.384044
Abstract
International audienceThe 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 systemKeywords
This publication has 8 references indexed in Scilit:
- Fully Distributed Threshold RSA under Standard AssumptionsPublished by Springer Nature ,2001
- A new public key cryptosystem based on higher residuesPublished by Association for Computing Machinery (ACM) ,1998
- A new public-key cryptosystem as secure as factoringPublished by Springer Nature ,1998
- A Secure and Optimally Efficient Multi-Authority Election SchemePublished by Springer Nature ,1997
- Receipt-free secret-ballot elections (extended abstract)Published by Association for Computing Machinery (ACM) ,1994
- Efficient signature generation by smart cardsJournal of Cryptology, 1991
- Untraceable electronic mail, return addresses, and digital pseudonymsCommunications of the ACM, 1981
- How to share a secretCommunications of the ACM, 1979