Paperless Independently-Verifiable Voting

  • David Chaum
  • Alex Florescu
  • Mridul Nandi
  • Stefan Popoveniuc
  • Jan Rubio
  • Poorvi L. Vora
  • Filip Zagórski
Conference paper

DOI: 10.1007/978-3-642-32747-6_9

Volume 7187 of the book series Lecture Notes in Computer Science (LNCS)
Cite this paper as:
Chaum D. et al. (2012) Paperless Independently-Verifiable Voting. In: Kiayias A., Lipmaa H. (eds) E-Voting and Identity. Vote-ID 2011. Lecture Notes in Computer Science, vol 7187. Springer, Berlin, Heidelberg

Abstract

We present a new model for polling-booth voting: the voter enters the polling booth with a computational assistant which helps her verify that her vote is correctly recorded. The assistant interacts with the voting system while the voter votes on the machine in the polling booth. We present an independently-verifiable, coercion-resistant protocol based on this model. Unlike all other independently-verifiable protocols, this one is completely paperless and does not require the voter to perform any tasks outside the polling booth. We provide property definitions, rigorous claims and a description of a prototype.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2012

Authors and Affiliations

  • David Chaum
    • 1
  • Alex Florescu
    • 1
  • Mridul Nandi
    • 3
  • Stefan Popoveniuc
    • 1
  • Jan Rubio
    • 1
  • Poorvi L. Vora
    • 1
    • 2
  • Filip Zagórski
    • 1
  1. 1.The George Washington UniversityWashington D.C.USA
  2. 2.Indian Institute of TechnologyBombayIndia
  3. 3.Indian Statistical InstituteKolkataIndia