This paper improves the performance of the revised-simplified verifiable re-encryption mixnet (R-SVRM) based e-voting scheme by introducing confirmation numbers (CNs) that are used in the CN based e-voting scheme. Although CN based and R-SVRM based schemes had made e-voting schemes more practical by excluding zero knowledge proof (ZKP) that requires large volume of computations, still they are not efficient enough. Namely, the CN based scheme adopts RSA encryption functions that are not probabilistic or commutative, therefore to satisfy essential requirements of elections, extra random factors are necessary for individual votes, election authorities must sign on votes and they must keep encryption keys as their secrets. On the other hand, although the R-SVRM based scheme uses ElGamal encryption functions that are probabilistic and commutative, vote forms in it is complicated, i.e., vote forms consist of at least 3 items and they include information about candidates as exponents. The improved scheme simplifies vote forms by exploiting CNs, and extensively reduces the number of operations required for individual votes. Also, the scheme successfully satisfies all essential requirements of e-voting systems, i.e., it is endowed with features about privacy, robustness, accuracy, incoercibility and fairness as CN based and R-SVRM based schemes are.

中文翻译：

---

基于Revised-SVRM和确认号码的电子投票方案

本文通过引入在基于 CN 的电子投票方案中使用的确认号 (CN)，提高了基于修订简化的可验证重加密混合网络 (R-SVRM) 的电子投票方案的性能。尽管基于 CN 和基于 R-SVRM 的方案通过排除需要大量计算的零知识证明 (ZKP) 使电子投票方案更加实用，但它们仍然不够高效。即，基于 CN 的方案采用非概率性或可交换性的 RSA 加密函数，因此为了满足选举的基本要求，个人选票需要额外的随机因素，选举当局必须对选票进行签名，并且必须将加密密钥作为他们的秘密。另一方面，虽然基于 R-SVRM 的方案使用了概率和可交换的 ElGamal 加密函数，其中的投票表格比较复杂，即投票表格至少由3个项目组成，其中包含候选人信息作为指数。改进后的方案通过利用 CN 简化了投票形式，并大大减少了个人投票所需的操作次数。此外，该方案成功地满足了电子投票系统的所有基本要求，即它具有基于 CN 和基于 R-SVRM 的方案的隐私性、鲁棒性、准确性、不可抗性和公平性等特征。