论文信息 - A Verifiable Voting Protocol Based on Farnel

A Verifiable Voting Protocol Based on Farnel

Farnel is a voting system proposed in 2001 in which each voter signs a ballot. It uses two ballot boxes to avoid the association between a voter and a vote. In this paper we first point out a flaw in the ThreeBallot system proposed by Rivest that seems to have gone unnoticed so far: it reveals statistical information about who is winning the election. Then, trying to resolve this and other flaws, we present a new, voter-verifiable version of the Farnel voting system in which voters retain copies of ballot IDs as receipts.

Jeroen van de Graaf | Ricardo Felipe Custódio | Roberto Araújo

[1] Taher ElGamal,et al. A public key cyryptosystem and signature scheme based on discrete logarithms , 1985 .

[2] David Chaum,et al. Untraceable electronic mail, return addresses, and digital pseudonyms , 1981, CACM.

[3] C. Andrew Neff,et al. A verifiable secret shuffle and its application to e-voting , 2001, CCS '01.

[4] David A. Wagner,et al. Cryptographic Voting Protocols: A Systems Perspective , 2005, USENIX Security Symposium.

[5] Ronald Cramer,et al. A secure and optimally efficient multi-authority election scheme , 1997, Eur. Trans. Telecommun..

[6] R. Rivest. The ThreeBallot Voting System , 2006 .

[7] Torben P. Pedersen. Non-Interactive and Information-Theoretic Secure Verifiable Secret Sharing , 1991, CRYPTO.