Information Security and Computer Fraud
ISSN (Print): 2376-9602 ISSN (Online): 2376-9629 Website: Editor-in-chief: Sergii Kavun
Open Access
Journal Browser
Information Security and Computer Fraud. 2015, 3(2), 32-38
DOI: 10.12691/iscf-3-2-2
Open AccessArticle

An Incoercible E-Voting Scheme Based on Revised Simplified Verifiable Re-encryption Mix-nets

Shinsuke Tamura1, , Hazim A. Haddad1, Nazmul Islam2 and Kazi Md. Rokibul Alam2

1Graduate School of Engineering, University of Fukui, Japan

2Department of Computer Science and Engineering, Khulna University of Engineering and Technology, Bangladesh

Pub. Date: December 02, 2015

Cite this paper:
Shinsuke Tamura, Hazim A. Haddad, Nazmul Islam and Kazi Md. Rokibul Alam. An Incoercible E-Voting Scheme Based on Revised Simplified Verifiable Re-encryption Mix-nets. Information Security and Computer Fraud. 2015; 3(2):32-38. doi: 10.12691/iscf-3-2-2


Simplified verifiable re-encryption mix-net (SVRM) is revised and a scheme for e-voting systems is developed based on it. The developed scheme enables e-voting systems to satisfy all essential requirements of elections. Namely, they satisfy requirements about privacy, verifiability, fairness and robustness. It also successfully protects voters from coercers except cases where the coercers force voters to abstain from elections. In detail, voters can conceal correspondences between them and their votes, anyone can verify the accuracy of election results, and interim election results are concealed from any entity. About incoercibility, provided that erasable-state voting booths which disable voters to memorize complete information exchanged between them and election authorities for constructing votes are available, coercer C cannot know candidates that voters coerced by C had chosen even if the candidates are unique to the voters. In addition, elections can be completed without reelections even when votes were handled illegitimately.

revised-SVRM anonymous credential inferior votes erasable-state voting booth

Creative CommonsThis work is licensed under a Creative Commons Attribution 4.0 International License. To view a copy of this license, visit


[1]  Diffie and M. E. Hellman, “New directions in cryptography,” IEEE Trans. On Information Theory, IT-22(6), 644-654, 1976.
[2]  D. Boneh and P. Golle, “Almost entirely correct mixing with applications to voting,” ACM Conference on Computer and Communication Security, 68-77, 2002.
[3]  P. Golle, S. Zhong, D. Boneh, M. Jakobsson and A. Juels, “Optimistic mixing for exit-polls,” Asiacrypt 2002, 451-465, 2002.
[4]  M. Jakobson, A. Juels and R. Rivest, “Making mix nets robust for electronic voting by randomized partial checking,” USENIX Security 02, 339-353, 2002.
[5]  L. Nguen, R. Dafavi-Naini and K. Kurosawa, “Verifiable shuffles: A formal model and a Paillier-based efficient construction with provable security,” PKC 2004, 61-75, 2004.
[6]  B. Lee, C. Boyd, E. Dawson, K. Kim, J. Yang and S. Yoo, “Providing receipt-freeness in mixnet-based voting protocols,” Proceedings of the ICISC ’03, 261-74, 2003.
[7]  J. Furukawa, “Efficient, Verifiable shuffle decryption and its requirement of unlinkability,” PKC 2004, 319-332, 2004.
[8]  K. Sampigethaya and R. Poovendran, “A framework and taxonomy for comparison of electronic voting schemes,” Elsevier Computers and Security, 25, 137-153, 2006.
[9]  S. Weber, “A coercion-resistant cryptographic voting protocol -evaluation and prototype implementation,” Diploma thesis, Darmstadt University of Technology; 2006
[10]  P. Y. A. Ryan, D. Bismark, J. Heather, S,Schneider and Z. Xia, “A voter verifiable voting system,” IEEE Trans. On Information Forensics and Security, 4(4), 662-673, 2009.
[11]  K. A. Md Rokibul, S. Tamura, S. Taniguchi and T. Yanase, “An anonymous voting scheme based on confirmation numbers,” IEEJ Trans. EIS. 130(11), 2065-2073, 2010.
[12]  C. C. Lee, T. Y. Chen, S. C. Lin and M. S. Hwang, “A new proxy electronic voting scheme based on proxy signatures,” Lecture Notes in Electrical Engineering, 164, Part 1 3-12, 2012.
[13]  S. Tamura, “Anonymous security systems and applications: requirements and solutions,” Information Science Reference, 2012.
[14]  S. Tamura and S. Taniguchi, “Simplified verifiable re-encryption mix-nets,” Information Security and Computer Fraud, 1(1), 1-7, 2013.
[15]  S. Tamura and S. Taniguchi, “Enhancement of anonymous tag based credentials,” Information Security and Computer Fraud, 2(1), 10-20, 2014.
[16]  S. Tamura, “Elements of schemes for preserving privacies in e-society systems,” Lambert Academic Publishing, 2015.