Science and Education Publishing Information Security and Computer Fraud 2376-9629 3 2 2015 12 2 An Incoercible E-Voting Scheme Based on Revised Simplified Verifiable Re-encryption Mix-nets 32 38 EN Shinsuke Tamura Graduate School of Engineering, University of Fukui, Japan Hazim A. Haddad Nazmul Islam Kazi Md. Rokibul Alam ISCF2015322 10.12691/iscf-3-2-2 2015 6 30 2015 10 30 2015 11 30 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.