Multi-Candidate Electronic Voting Scheme Based on Fully Homomorphic Encryption

Abstract

In recent years, multi-candidate electronic voting has attracted tremendous attention and been put into lots of practice because of its outstanding effectiveness and convenience. As a result, it has become an urgent task to achieve the anonymity and public verifiability of electronic voting. Several schemes have been proposed so far, but most of them are either inefficient or too demanding of the security of the entities involved. Focusing on this problem, a multi-candidate electronic voting scheme based on fully homomorphic encryption and digital signature algorithm is proposed in the paper. To encrypt votes efficiently and reduce the dependence of different entities, the Identity Based Full Homomorphic Encryption(IBFHE) scheme is used in the paper. A homomorphic addition ticket counter is then used to realize the homomorphism calculation of encrypted votes. To settle the problem of identity authentication in electronic voting with high efficiency and security, Elliptic Curve Digital Signature Algorithm(ECDSA) is utilized. The capability of batching votes is achieved by making use of Single Instruction Multiple Data(SIMD) technology, which is designed for improving the efficiency of the voting system. Finally, the paper makes an analysis based on six security features of e-voting, which reveals the scheme’s safety and feasibility.