Schemes On Electronic Voting Algorithm Based On Homomorphic Encryption

With the rapid development of digitization,electronic voting has been widely used due to its advantages in convenience and efficiency,and it has played an increasingly important role in various national and social elections.The privacy and security of ballots,the efficiency and fairness of counting votes are the main concerns in the electronic voting.There are three problems in the existing electronic voting schemes:(1)the security of the ballots and the privacy of the voters cannot be guaranteed throughout the election process,(2)the signature verification of a large number of ballots results in inefficient counting,and(3)the counting rights are in the hands of a few authorities.improving the efficiency of the electronic voting system operation under the premise of ensuring the security of balloting and the fairness of tallying has become a key issue in the design of electronic voting schemes.In this paper,we focus on the electronic voting scheme based on the homomorphic signcryption algorithm,which improves the fairness of the election and the efficiency of counting votes while ensuring the privacy and security of the ballot.The research content and contributions are shown as follows:(1)A homomorphic signcryption algorithm is proposed,which satisfies multiple senders and receivers for information transmission,and solves the single-sender-support problem in the existing homomorphic signcryption algorithms.The proposed algorithm can successfully decrypt the homomorphic evaluated ciphertext by calculating the public key of different information senders,and we give the rigorous proof of the semantic security and unforgeability of the algorithm.(2)We design a high-efficiency electronic voting scheme based on the homomorphic signcryption proposed in this paper,combined with zero-knowledge proof and other cryptography knowledge.This voting scheme has three advantages:1)ensuring the privacy and security of the ballot by maintaining the ballot in an encrypted state throughout the election process;2)the encryption and signature of the ballot are completed,which simplify the ballot generation process;3)the signature verification of counting the vote result can complete the verification of all the signatures,which improves the efficiency of counting votes.(3)In order to solve the unfairness problem,the counting rights in electronic voting are in the hands of a few authorities,we use the reconstruction key algorithm to improve the electronic voting scheme based on the homomorphic signcryption.This scheme sets up multiple authorities and distributes the counting power to all electoral participants,which avoids centralized centralization of counting.Moreover,this scheme ensures at least one authority is honest to avoid the leakage of the election results and real ballot information,therefore maximizing the privacy and fairness of the ballot.