Cryptology ePrint Archive: Report 2009/424

Double Voter Perceptible Blind Signature Based Electronic Voting Protocol

Yaser Baseri, Amir S. Mortazavi, Maryam Rajabzadeh Asaar, Mohsen Pourpouneh, Javad Mohajeri

Abstract: 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 suffer from the same weaknesses. In this paper, getting Asadpour et al. scheme as one of the latest one and showing its weaknesses, we propose a new voting scheme which is immune to the weaknesses of previous schemes without loosing efficiency. The scheme, is based on a special structure, which directly use the identity of 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.

Category / Keywords: Electronic voting, Anonymity of voter, Unforgeability of ticket, Perceptibility of double voting, Security of voting, Blind signature.

Date: received 31 Aug 2009, last revised 5 Mar 2011

Contact author: yaser_baseri at alum sharif ir

Available format(s): PDF | BibTeX Citation

Version: 20110305:204439 (All versions of this report)

Short URL:

Discussion forum: Show discussion | Start new discussion

[ Cryptology ePrint archive ]