A Practical Voter-Verifiable Election Scheme
We present an election scheme designed to allow voters to verify that their vote is accurately included in the count. The scheme provides a high degree of transparency whilst ensuring the secrecy of votes. Assurance is derived from close auditing of all the steps of the vote recording and counting process with minimal dependence on the system components. Thus, assurance arises from verification of the election rather than having to place trust in the correct behaviour of components of the voting system. The scheme also seeks to make the voter interface as familiar as possible.
KeywordsCandidate List Bulletin Board Voter Choice Error Handling Visual Cryptography
Unable to display preview. Download preview PDF.
- 1.Brumbaugh, R.S.: Ancient Greek Gadgets and Machines. Thomas Y. Crowell (1966)Google Scholar
- 2.Bryans, J.W., Ryan, P.Y.A.: A Dependability Analysis of the Chaum Voting Scheme. Technical Report CS-TR-809, University of Newcastle (2003)Google Scholar
- 4.Jakobsson, M., Juels, M., Rivest, R.: Making Mix Nets Robust for Electronic Voting by Randomised Partial Checking. In: USENIX 2002 (2002)Google Scholar
- 5.Mercuri, R.: A better ballot box? IEEE Spectrum 39(10) (2002)Google Scholar
- 6.Andrew Neff, C.: A verifiable secret shuffle and its application to e-voting. In: ACM-CCS (2001)Google Scholar
- 7.Ryan, P.Y.A.: A Variant of the Chaum Voter-Verifiable Scheme. Technical Report CS-TR 864, University of Newcastle, 2004, Also in WITS 2005: Workshop on Issues in the Theory of SecurityGoogle Scholar