A Timed-Release E-Voting Scheme Based on Paillier Homomorphic Encryption

E-Voting is widely used in many social, economic, political and cultural fields for its convenience, efficiency and greenness, but how to guarantee the fairness of e-voting and the controllability of human intervention needs further in-depth research and exploration. Although the introduction of homomorphic encryption algorithm solves the problem of ballot privacy calculation, and most of these schemes solve the problem of private key confidentiality by using or overlaying multiple different methods of saving private keys, its security will be questioned as long as there is a possibility of human intervention in the saving process. To solve this problem, we propose a timed-release e-voting scheme based on Paillier homomorphic encryption. We analyze the semantic security of the ballot formally by defining the security game, and realize the legitimacy check of the ballot ciphertext through the idea of partial knowledge proof. Property analysis shows that this scheme satisfies the basic properties of the security requirements of the e-voting scheme. Performance analysis shows that this scheme is feasible to implement in practical voting.