Improved Anonymous Secure e-Voting over a Network

Abstract

In a democratic country voting is one of the most important activities. However, many eligible voters do not exercise their right simply because they do not want to visit a public booth where they can vote. In 1981, David Chaum first introduced the concept of electronic voting and attempted to overcome the problems associated with the traditional voting environment. Hereafter, Mu and Varadharajan proposed in 1998 an anonymous secure e-voting scheme over a network. They claimed that the proposed scheme is not only capable of preventing double voting but it can also protect the privacy of voters. However, many researchers afterwards have discovered that Mu and Varadharajan's scheme is not secure. Attackers can easily forge a valid ballot and can vote more than once. In this paper, an e-voting scheme based on Mu and Varadharajan's scheme is proposed that meets the following e-voting requirements: democracy, accuracy, anonymity, mobility and efficiency.

A Practical Verifiable e-Voting Protocol for Large Scale Elections over a Network

“…There are some e-voting protocols in the literature which use neither anonymous channels nor homomorphic encryption in order to perform e-voting over a network [15], [16], [17]. These protocols suffer from accuracy as corrupted participants can make fraud without being detected.…”

Yet another improvement over the Mu–Varadharajan e-voting protocol

“…Yang et al proposed in [3] another modification to the scheme proposed by Mu and Varadharajan. That scheme resists the attacks reported in [1,15,2].…”

“…The main contribution presented in this paper is to show that all variations of the Mu and Varadharajan [12] e-voting scheme that have been proposed so far, namely, the Lin et al [1], Hwang et al [2] and Yang et al [3] schemes, share a functional flaw: a high possibility of not being able to sign the voting content m. Moreover, we show that this difficulty arises from the way that all those schemes use the ElGamal digital signature algorithm. Furthermore, we propose a new modification to these schemes which allows overcoming the security flaw we found effectively.…”

“…We illustrate our solution by describing in detail how to modify the scheme proposed by Lin et al [1]. Our solution consisting of replacing the ElGamal signature algorithm with the DSA algorithm can be easily extended to the schemes in [2,3] too. However, the specific details are not covered in this contribution.…”

Cryptanalysis and security enhancement on the generation of Mu-Varadharajan electronic voting protocol

“…Their proposed scheme does not require any special voting channel and it is claimed that the scheme is able to detect vote duplicity effectively. Yang et al (2004) proposed another improvement on Mu and Varadharajan's protocol. Although their scheme is resistant to the attacks which has been proposed in Chien et al (2003), it can not determine the identity of double voter.…”