A secure voting scheme based on rational self-interest

In this paper we constructed a formal performance model for a secure and scalable e-voting scheme known as DRE-i voting scheme. The well-known formal stochastic performance evaluation process algebra (PEPA) language and PEPA Eclipse plug-in were used to represent the voting scheme and analyse its performance characteristics. Timely responses of remote electronic voting protocols are important to increase voters’ confidence in e-voting systems. Therefore we evaluated the average response time that voters may observe when they cast their votes using remote electronic voting systems, such as DRE-i, and we also evaluated the throughput and queue length of the DRE-i server’s actions for different number of voters inside the DRE-i e-voting system. The performance evaluation of the DRE-i scheme reveals that PEPA language is efficient in investigating the performance properties of large scale e-voting schemes.

The great convenience of electronic voting can improve the attendance and thus promote the process of democratization. However, the appearance of quantum computer severely threatens the security of those traditional electronic voting schemes. The efficiency of the current post-quantum electronic voting scheme is relatively low, some of them are unable to verify the validity of the ballots which results in a stronger security assumption. In this paper, we propose an efficient LWE-based verifiable electronic voting system whose security is based on the LWE assumption. To protect the user privacy, we tally homomorphically and verify the validity of ballot ciphertext through some interactions between two verification servers. In addition, a zero-knowledge proof can be utilized to verify the correctness of tally results. Finally, we analyze the properties and implement our system, the experimental results show the effectiveness of our system.