A Homomorphic LWE-Based Verifiable Electronic Voting System

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.