Scratch & vote: Self-contained paper-based cryptographic voting

Proceedings of the ACM Conference on Computer and Communications Security

Volumn , Issue , 2006, Pages 29-39

  Adida, Ben ^a   Rivest, Ronald L ^a  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

barcode; cryptographic voting; homomorphic tallying; paillier cryptosystem; paper ballot; scratch surface

Indexed keywords

AUDIT PROCESS; CRYPTOGRAPHIC VOTING; HOMOMORPHIC TALLYING; PAILLIER CRYPTOSYSTEM;

BAR CODES; COMPUTER PRIVACY; PAPER; SECURITY OF DATA; VOTING MACHINES;

CRYPTOGRAPHY;

EID: 84885208090     PISSN: 15437221     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1179601.1179607     Document Type: Conference Paper

References (32)

1. Swox AB. The GNU Multi-Precision Arithmetic Library. http://www.swox.com/ gmp/.
2. Olivier Baudron, Pierre-Alain Fouque, David Pointcheval, Jacques Stern, and Guillaume Poupard. Practical multi-candidate election system. In PODC, pages 274-283. ACM, 2001.
3. Josh Benaloh and Moti Yung. Distributing the power of government to enhance the power of voters. In PODC, pages 52-62. ACM, 1986.
4. Manuel Blum, Paul Feldman, and Silvio Micali. Non-interactive zero-knowledge and its applications (extended abstract). In STOC, pages 103-112. ACM, 1988.
5. C. Andrew Neff. Coerced Randomization, April 2006. private conversation with and unpublished manuscript by Andy Neff.
6. David Chaum. Punchscan. http://punchscan.org viewed on August 13th, 2006.
7. David Chaum. Secret-Ballot Receipts: True Voter-Verifiable Elections. IEEE Security and Privacy, 02(1):38-47, 2004.
8. David Chaum, Peter Y. A. Ryan, and Steve Schneider. A practical voter-verifiable election scheme. In Sabrina De Capitani di Vimercati, Paul F. Syverson, and Dieter Gollmann, editors, ESORICS, volume 3679 of Lecture Notes in Computer Science, pages 118-139. Springer, 2005.
9. J. D. Cohen and M. J. Fischer. A robust and verifiable cryptographically secure election scheme. In FOCS, pages 372-382. IEEE Computer Society, 1985.
10. Ronald Cramer, Ivan Damgård, and Berry Schoenmakers. Proofs of Partial Knowledge and Simplified Design of Witness Hiding Protocols. In Yvo Desmedt, editor, CRYPTO, volume 839 of Lecture Notes in Computer Science, pages 174-187. Springer, 1994.
11. Ivan Damgård and Mats Jurik. A generalisation, a simplification and some applications of paillier's probabilistic public-key system. In Kwangjo Kim, editor, Public Key Cryptography, volume 1992 of Lecture Notes in Computer Science, pages 119-136. Springer, 2001.
12. Ivan Damgård and Maciej Koprowski. Practical threshold rsa signatures without a trusted dealer. In Pfitzmann [25], pages 152-165.
13. A. Fiat and A. Shamir. How to prove yourself. practical solutions to identification and signature problems. In Andrew M. Odlyzko, editor, CRYPTO, volume 263 of Lecture Notes in Computer Science, pages 186-189. Springer, 1987.
14. Pierre-Alain Fouque, Guillaume Poupard, and Jacques Stern. Sharing decryption in the context of voting or lotteries. In Yair Frankel, editor, Financial Cryptography, volume 1962 of Lecture Notes in Computer Science, pages 90-104. Springer, 2001.
15. Louis C. Guillou and Jean-Jacques Quisquater. A practical zero-knowledge protocol fitted to security microprocessor minimizing both transmission and memory. In C. G. Günther, editor, EUROCRYPT, volume 330 of Lecture Notes in Computer Science, pages 123-128. Springer, 1988.
16. Markus Jakobsson and Ari Juels. Millimix: Mixing in small batches. Technical Report 99-33, Center for Discrete Mathematics & Theoretical Computer Science (DIMACS), 1999.
17. Markus Jakobsson, Ari Juels, and Ronald L. Rivest. Making mix nets robust for electronic voting by randomized partial checking. In Dan Boneh, editor, USENIX Security Symposium, pages 339-353. USENIX, 2002.
18. Joseph P. Harris. Election Administration in the United States. Brookings Institute Press, 1934.
19. Jonathan Katz, Steven Myers, and Rafail Ostrovsky. Cryptographic counters and applications to electronic voting. In Pfitzmann [25], pages 78-92.
20. Kevin Fisher and Richard Carback and Alan Sherman. Punchscan: Introduction and System Definition of a High-Integrity Election System. In Peter A. Ryan, editor, Proceedings of the IAVoSS Workshop On Trustworthy Elections (WOTE'06), Cambridge, UK, June 2006.
21. A. Kiayias and M. Yung. The vector-ballot e-voting approach. In Ari Juels, editor, Financial Cryptography, volume 3110 of Lecture Notes in Computer Science, pages 72-89. Springer, 2004.
22. Yehuda Lindell, Anna Lysyanskaya, and Tal Rabin. On the composition of authenticated byzantine agreement. In STOC, pages 514-523. ACM, 2002.
23. C. Andrew Neff. A verifiable secret shuffle and its application to e-voting. In ACM Conference on Computer and Communications Security, pages 116-125. ACM, 2001.
24. Pascal Paillier. Public-key cryptosystems based on composite degree residuosity classes. In Jacques Stern, editor, EUROCRYPT, volume 1592 of Lecture Notes in Computer Science, pages 223-238. Springer, 1999.
25. Birgit Pfitzmann, editor. Advances in Cryptology - EUROCRYPT 2001, International Conference on the Theory and Application of Cryptographic Techniques, Innsbruck, Austria, May 6-10, 2001, Proceeding, volume 2045 of Lecture Notes in Computer Science. Springer, 2001.
26. Ralph C. Merkle. Secrecy, authentication, and public key systems. PhD thesis, Stanford University, 1979.
27. Randal C. Archibold. Arizona Ballot Could Become Lottery Ticket, July 2006. http://www.nytimes.com/2006/07/17/us/17voter.html?ex=1310788800&en= 9626060428eeb1ed&ei=5088&partner=rssnyt&emc=rss.
28. B. Randell and P.Y.A. Ryan. Voting technologies and trust. IEEE Security & Privacy, 2005. To appear.
29. P.Y.A. Ryan and S A Schneider. Prêt à voter with re-encryption mixes. In ESORICS, Lecture Notes in Computer Science. Springer, 2006.
30. Scratch 'N Win Ballots To Debut In November, July 2006. http://www.theonion.com/content/node/50640.
31. The Barcode Software Center. PDF-417, 2003. http://www.mecsw.com/specs/ pdf417.html.
32. Wikipedia. http://en.wikipedia.org/wiki/2D barcode.