A practical voter-verifiable election scheme

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3679 LNCS, Issue , 2005, Pages 118-139

  Chaum, David ^a   Ryan, Peter Y A ^b   Schneider, Steve ^c  

^a UNIVERSITY OF NEWCASTLE   (Australia)

^b NEWCASTLE UNIVERSITY   (United Kingdom)

^c UNIVERSITY OF SURREY   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

AUDITING; SYSTEM COMPONENTS; VOTER-VERIFIABLE ELECTION SCHEME;

LAW ENFORCEMENT; SOCIAL ASPECTS;

VOTING MACHINES;

EID: 33646028830     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11555827_8     Document Type: Conference Paper

References (7)

1. Robert S. Brumbaugh. Ancient Greek Gadgets and Machines. Thomas Y. Crowell, 1966.
2. Jeremy W. Bryans and Peter Y. A. Ryan. A Dependability Analysis of the Chaum Voting Scheme. Technical Report CS-TR-809, University of Newcastle, 2003.
3. David Chaum. Secret-Ballot Receipts: True Voter-Verifiable Elections. IEEE Security and Privacy, 2(1):38-47, Jan/Feb 2004.
4. M. Jakobsson, M. Juels, and R. Rivest. Making Mix Nets Robust for Electronic Voting by Randomised Partial Checking. In USENIX'02, 2002.
5. R. Mercuri. A better ballot box? IEEE Spectrum, 39(10), 2002.
6. C. Andrew Neff. A verifiable secret shuffle and its application to e-voting. In ACM-CCS, 2001.
7. Peter Y. A. Ryan. 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 Security.