Bingo voting: secure and coercion-free voting using a trusted random number generator

  • Authors:
  • Jens-Matthias Bohli;Jörn Müller-Quade;Stefan Röhrich

  • Affiliations:
  • NEC Laboratories Europe, Network Research Division, Heidelberg, Germany;Institut für Algorithmen und Kognitive Systeme, E.I.S.S., Universität Karlsruhe, Karlsruhe, Germany;Institut für Algorithmen und Kognitive Systeme, E.I.S.S., Universität Karlsruhe, Karlsruhe, Germany

  • Venue:
  • VOTE-ID'07 Proceedings of the 1st international conference on E-voting and identity
  • Year:
  • 2007

Quantified Score

Hi-index 0.00

Visualization

Abstract

It is debatable if current direct-recording electronic votingmachines can sufficiently be trusted for a use in elections. Reports about malfunctions and possible ways ofmanipulation abound. Voting schemes have to fulfill seemingly contradictory requirements: On one hand the election process should be verifiable to prevent electoral fraud and on the other hand each vote should be deniable to avoid coercion and vote buying. This work presents a new verifiable and coercion-free voting scheme Bingo Voting, which is based on a trusted random number generator. As a motivation for the new scheme two coercion/vote buying attacks on voting schemes are presented which show that it can be dangerous to let the voter contribute randomness to the voting scheme. A proof-of-concept implementation of the scheme shows the practicality of the scheme: all costly computations can be moved to a non time critical pre-voting phase.