Research On Secure Electronic Voting Scheme Based On Blockchain

In recent years,due to the COVID-19,traditional paper voting has potential health risks.Compared with traditional paper voting,electronic voting is not limited by space,and the convenience is significantly improved.It becomes more important to study safe and fair electronic voting.In the Internet environment,the existing electronic voting system has certain security loopholes,which may lead to malicious attacks.The existing self-counting electronic voting scheme can not rely on the central authority,and achieve stronger privacy protection and non-controversy.However,when this scheme calculates the final result,the ciphertexts of all voters need to be multiplied,and the last voter can get the final vote counting result in advance,which leads to a fairness problem.While taking fairness into account,it is also crucial for the voting scheme to ensure the balance of anonymity and accountability.With more and more scenarios of electronic voting applications,more and more functions are required.In order to solve the problems of fairness,traceability and functionality,this paper introduces technologies such as blockchain,homomorphic encryption and proxy signature,and proposes two effective solutions.The main research contents and innovations in this dissertation are as follows:This dissertation firstly conducts a specific study on the self-counting electronic voting scheme,and proposes a safe and efficient electronic voting scheme in view of the fairness problem in its scheme,combined with the smart contract in the blockchain.At the same time,the openness,transparency and immutability of the blockchain are utilized to make it function as a bulletin board in electronic voting,which enhances the non-controversial nature of electronic voting.And in order to balance the anonymity and accountability in the electronic voting process and prevent attacks from within the system to achieve the supervision function,the use of pseudonyms for voters in the scheme can reveal the true identity of malicious users without revealing the votes.specific content.Through performance analysis and security proof,compared with other schemes,this scheme is safe and efficient.In the dissertation,it is important to study the diverse requirements of electronic voting in real scenarios.According to its different functional requirements,a homomorphic weighted electronic voting scheme that can realize proxy function is proposed.On one hand,the insecurity of other weighting schemes is analyzed,and a secure weighted voting scheme is realized by using the additive homomorphism and mixed multiplication homomorphism of the Paillier encryption algorithm.On the other hand,combined with the proxy signature,the voter needs to entrust a proxy voter to perform proxy voting in electronic voting.Through security analysis and performance analysis,this solution is safe and reliable.