Previous [1] [2] [3] [4] [5] [6] [7] [8] [9] [10]

Journal of Inforamtion Science and Engineering, Vol.17 No.6, pp.865-877 (November 2001)

Practical and Efficient Electronic Voting Schemes*

Zhi-Jia Tzeng and Wen-Guey Tzeng
Department of Computer and Information Science
National Chiao Tung University
Hsinchu, 300 Taiwan
E-mail: {zjtzeng, tzeng}@cis.nctu.edu.tw

We present various types of new electronic voting schemes, including two-way, multi-way and multi-selection election schemes, which guarantee privacy, universal verifiability, and robustness. Initially, a voter registers a polynomial function, his public key, with the election committee. Each voter uses his polynomial function to cast his vote in various elections. The distinct feature is that each term of a polynomial function corresponds to a candidate in a multi-way election. Thus, the final tally is independent among candidates, and the time complexity for searching final results is O(n). In our schemes, each voter contacts the authorities only once; thus, our schemes are practical and suitable for large-scale elections. For robustness, we use the witness indistinguishable technique to construct the proof of validity. Security, then, is based on the discrete logarithm and decisional Diffie-Hellman assumptions.

Keywords: electronic vote, witness indistinguishable, multi-authority election, multi-selection vote, public verifiability, zero knowledge, secure multi-party computation

Full Text () Retrieve PDF document (200111_01.pdf)

Received December 26, 2000; accepted July 10, 2001.
Communicated by Chi Sung Laih.