Secret Ballot Elections with Unconditional Integrity

David Chaum; Jeroen van de Graaf; Peter Y.  A.  Ryan; Poorvi L.  Vora

Paper 2007/270

Secret Ballot Elections with Unconditional Integrity

David Chaum, Jeroen van de Graaf, Peter Y. A. Ryan, and Poorvi L. Vora

Abstract

This paper describes in detail a voting scheme which allows voters to be sure that whatever they see in the booth will be included correctly in the outcome. It presents a rigorous and understandable model of requirements for election systems, states formally the properties of the system, and proves them. As a step towards understanding the full 2D voting system, it also presents a simpler 1D system.

Note: The title has changed. Furthermore only minor changes.

Metadata

Available format(s): PDF
Category: Cryptographic protocols
Publication info: Published elsewhere. Submitted to the Journal of Cryptology
Keywords: voting elections
Contact author(s): jvdg @ ufmg br
History: 2008-02-28: revised; 2007-07-16: received; See all versions
Short URL: https://ia.cr/2007/270
License: CC BY

BibTeX

@misc{cryptoeprint:2007/270,
      author = {David Chaum and Jeroen van de Graaf and Peter Y.  A.  Ryan and Poorvi L.  Vora},
      title = {Secret Ballot Elections with Unconditional Integrity},
      howpublished = {Cryptology ePrint Archive, Paper 2007/270},
      year = {2007},
      note = {\url{https://eprint.iacr.org/2007/270}},
      url = {https://eprint.iacr.org/2007/270}
}