Double Voter Perceptible Blind Signature Based Electronic Voting Protocol

Mu et al. have proposed an electronic voting protocol and claimed that it protects anonymity of voters, detects double voting and authenticates eligible voters. It has been shown that it does not protect voter s privacy and prevent double voting. After that, several schemes have been presented to fulfill these properties. However, many of them suer from the same weaknesses. In this paper, getting Asadpour et al. s scheme as one of the latest ones and showing its weaknesses, we propose a new voting scheme which is immune to the weaknesses of previous schemes without losing efficiency. The scheme, is based on a special structure, which directly uses the identity of the voter, hides it in that structure and reveals it after double voting. We also, show that the security of this scheme depends on hardness of RSA cryptosystem, Discrete Logarithm problem and Representation problem