Zhongmin Su
Dept. of Computer Science and Telecommunications
University of Missouri-Kansas City
Kansas, MO 64110, USA
zsu@cstp.umkc.edu
Thu Dec 25 16:06:55 EST 1997
We propose a new practical blind signature based e-voting scheme,
which achieves all the desired properties of eligibility, unreusability,
untraceability, unduplicatability, unchangeability, and verifiability at
the cost of receipt-freeness. Unlike previous blind signature based schemes,
in which the authority directly signs its blind signature on voters' ballots,
the authority in our scheme signs blind signature on the public keys, called
tallying keys, generated by voters and the voters use their corresponding
private keys, called voting keys, to sign their ballots in the elections
hereafter. This difference
brings us some advantages: voters can change their mind in voting period,
or we can say, only one registration is needed for multiple elections -
this simplifies the administration of elections; it is more difficult for
the authority (or anyone else) in our scheme to cast votes for abstaining
voters. Moreover voters can correct their miscounted votes (if any) without
revealing the ballots. Because of the simplicity of the protocols and low
complexity of computation, as well as the efficiency of administration,
it is a practical e-voting scheme.
Area: electronic voting, electronic commerce
Keywords: electronic voting, blind signature.