DMCA
Bingo Voting: Secure and coercion-free voting using a trusted random number generator (2007)
| Citations: | 19 - 0 self |
BibTeX
@MISC{Bohli07bingovoting:,
author = {Jens-matthias Bohli and Jörn Müller-Quade and Stefan Röhrich},
title = {Bingo Voting: Secure and coercion-free voting using a trusted random number generator},
year = {2007}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
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.
Keyphrases
trusted random number generator coercion-free voting bingo voting voting scheme proof-of-concept implementation voter contribute randomness coercion vote contradictory requirement election process costly computation current direct-recording electronic voting machine manipulation abound possible way new scheme non time critical pre-voting phase electoral fraud coercion-free voting scheme bingo voting vote buying
