Cryptology ePrint Archive: Report 2009/574

Voting with unconditional privacy: CFSY for booth voting

Jeroen van de Graaf

Abstract: In this note we simplify the Cramer, Franklin, Schoenmaker and Yung internet voting protocol to the booth setting. In it, objects of the form $g_0^r g_1^{x_1}...g_l^{x_l}$ are used to define an unconditionally hiding commitment scheme. Because of their homomorphic properties they are particularly suited for voting protocols with unconditional privacy. In fact, we show that almost all existing protocols that provide unconditional privacy use or could benefit from these commitments. Even though we present no novelty from a cryptographic perpective, the protocol presented is interesting from a voting perspective because it is simple enough to be understood by non-cryptographers, yet very powerful.

Category / Keywords: voting protocols, election protocols

Publication Info: new manuscript

Date: received 26 Nov 2009, last revised 26 Jan 2011

Contact author: jvdg ufop at gmail com

Available formats: Postscript (PS) | Compressed Postscript (PS.GZ) | PDF | BibTeX Citation

Note: Corrected a minor mistake in the title

Version: 20110126:181535 (All versions of this report)

Discussion forum: Show discussion | Start new discussion