Sciweavers

Share
VOTEID
2007
Springer

Bingo Voting: Secure and Coercion-Free Voting Using a Trusted Random Number Generator

9 years 10 months ago
Bingo Voting: Secure and Coercion-Free Voting Using a Trusted Random Number Generator
It is debatable if current direct-recording electronic voting machines can sufficiently be trusted for a use in elections. Reports about malfunctions and possible ways of manipulation 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.
Jens-Matthias Bohli, Jörn Müller-Quade,
Added 09 Jun 2010
Updated 09 Jun 2010
Type Conference
Year 2007
Where VOTEID
Authors Jens-Matthias Bohli, Jörn Müller-Quade, Stefan Röhrich
Comments (0)
books