A new e-voting scheme based on revised simplified verifiable re-encryption mixnet
Nazmul Islam, Kazi Md. Rokibul Alam, Shinsuke Tamura, Yasuhiko Morimoto · 2017
This paper proposes a new electronic voting (e-voting) scheme that exploits confirmation numbers (CNs) and revised simplified verifiable re-encryption mixnet (R-SVRM). R-SVRM is a recently introduced mechanism of mixnet also used to develop an e-voting scheme where a vote is decomposed to protect its voter from being coerced to cast a particular vote. Though the scheme avoids complicated zero knowledge proof (ZKP), the verification procedures of its cryptographic operations are still cumbersome. Again, another e-voting scheme based on CNs comes with benefits of vote verifiability and unlinkability between the vote and its voter, lags behind in adopting public keys for encryption and signature verification. Also its exploited mixnet is not verifiable; therefore requires a pair of signatures on each encrypted vote to ensure the verifiability of mixnet. Hence, the computation and communication overhead of the scheme becomes weighty, though ZKP is avoided. In contrast, the proposed scheme deploys both CNs and R-SVRM to eliminate these limitations. Hence, any coercer cannot force the voter to cast a specific vote as well as cryptographic operations and their verifications become simpler. Also the computation and communication overheads for involved entities get decreased. Finally, the security requirements of e-voting are achieved more elegantly.