A Simple Receipt-Freeness Electronic Voting Sheme
Nana Yan · Computer Technology and Development · 2008
Receipt-freeness and verifiability are two important but imcompatible attributions in electronic voting system.Receipt-freeness requires anyone must neither obtain nor be able to construct a receipt which can prove the content of his vote.Verifiability not only permits the voter to verify that the vote has been counted correctly,but also gives voter to verify that the election tally actually represents the sum of the votes cast.But both are sacrificed to achieve the other as conditions.In this paper,choose Mix-net scheme and use TRR to achieve receipt-freenss.Though 1-out-of-L encrypt proof and re-encryption ELGamal achieve verifiability.It makes the assumption that a physically untappable means of communication between the mixing center and the voters not necessay anymore,reduce the communication cost.