Practical multi-candidate election system

  • Authors:
  • Olivier Baudron;Pierre-Alain Fouque;David Pointcheval;Jacques Stern;Guillaume Poupard

  • Affiliations:
  • École Normale Supérieure, Paris, France;École Normale Supérieure, Paris, France;École Normale Supérieure, Paris, France;École Normale Supérieure, Paris, France;SGDN/DCSSI, DCSSI Crypto Lab.

  • Venue:
  • Proceedings of the twentieth annual ACM symposium on Principles of distributed computing
  • Year:
  • 2001

Quantified Score

Hi-index 0.00

Visualization

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 verifiability, 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.