Paper 2008/082

Improving the Farnel, Threeballot, and Randell-Ryan Voting Schemes

Roberto Araujo and Peter Y. A. Ryan


A number of recent voting schemes provide the property of voter verifiability: voters can confirm that their votes are accurately counted in the tally. The Farnel type voting schemes are based on the observation that to achieve voter-verifiability it is not necessary for the voter to carry away a receipt corresponding to their own vote. The Farnel approach then is to provide voters, when they cast their vote, with copies of receipts of one or more randomly selected, previous cast votes. This idea has a number of attractive features: ballot secrecy is achieved up front and does not have to be provided by anonymising mixes etc during tabulation. In fact, plaintext receipts can be used in contrast to the encrypted receipts of many other voter-verifiable schemes. Furthermore, any fears that voters might have that their vote is not truly concealed in an encrypted receipt are mitigated. The Farnel mechanism also mitigates randomization style attacks. In this paper we explore some enhancements to the original Farnel scheme and ways that the Farnel concept can be combined with some existing voter-verifiable schemes, namely Prˆet-`a-Voter, ThreeBallot, and Randell-Ryan.

Available format(s)
Publication info
Published elsewhere. Unknown where it was published
Farnelelection schemes
Contact author(s)
rsa @ cdc informatik tu-darmstadt de
2008-02-27: received
Short URL
Creative Commons Attribution


      author = {Roberto Araujo and Peter Y.  A.  Ryan},
      title = {Improving the Farnel, Threeballot, and Randell-Ryan Voting Schemes},
      howpublished = {Cryptology ePrint Archive, Paper 2008/082},
      year = {2008},
      note = {\url{}},
      url = {}
Note: In order to protect the privacy of readers, does not use cookies or embedded third party content.