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.
- Bingo Voting: Secure and Coercion-Free Voting Using a Trusted Random Number Generator
- Book Title
- E-Voting and Identity
- Book Subtitle
- First International Conference, VOTE-ID 2007, Bochum, Germany, October 4-5, 2007, Revised Selected Papers
- pp 111-124
- Print ISBN
- Online ISBN
- Series Title
- Lecture Notes in Computer Science
- Series Volume
- Series ISSN
- Springer Berlin Heidelberg
- Copyright Holder
- Springer-Verlag Berlin Heidelberg
- Additional Links
- Secure electronic voting
- Industry Sectors
- eBook Packages
- Author Affiliations
- 1. Network Research Division, NEC Laboratories Europe, Kurfürsten-Anlage 36, 69115, Heidelberg, Germany
- 2. Institut für Algorithmen und Kognitive Systeme / E.I.S.S., Universität Karlsruhe (TH), 76128, Karlsruhe, Germany
To view the rest of this content please follow the download PDF link above.