Researsh On Fairness And Verifiability Of Electionic Voting Based On Blockchain

In the era of rapid development of the Internet of Things,electronic voting has become an important tool for users to express their opinions,and has long been used in all aspects of social life.Traditional electronic voting is mainly concentrated on trusted servers or third-party institutions,and there is a high risk of centralization.Then it is easy to cause threats such as replay attacks,ballot tampering or privacy leakage.Fairness defects and privacy leakage seriously affect the security of voting and the accuracy of results.Since different voting mechanisms involve different preference data types and require different security properties,it is worth exploring how to design appropriate voting protocols based on the data characteristics of voting mechanisms.This paper mainly starts from the two mechanisms of equal voting and weighted voting in electronic voting,and analysis on election fairness security and privacy leakage.The main research work and contributions are as follows:1.In the equal voting mechanism,each participating user has equal voting rights and influence,that is,"one person,one vote".Aiming at the fairness drawback and replay attack problem,an encryption pr oof scheme based on blockchain is proposed.Firstly,considering the involvement of trusted institutions,the voting process and rules are written into smart contracts,an identity-based proof of Merkel tree membership is constructed,and the hash operation is used to generate random sequences to prevent repeated voting.Secondly,considering that the final goal is to calculate the summation result,use the blockchain and Paillier encryption to store votes transactions to achieve multiple encryption and one decryption.Finally,considering the legality of transactions and the accuracy of results,a zero-knowledge proof based on zk-SNARK is constructed by using the immutable characteristics of the blockchain.There is no need to download all nodes during verification,and no need for real-time interaction between multiple users,which reduces data downloads and computational complexity.2.In the weighted voting mechanism,the influence of each participating is related to the power it has,that is,"one share,one vote".Aiming at the problems of privacy leakage and error of calculation results,this paper proposes a privacy protection scheme to hide vote data.Considering the risk of privacy leakage in centralized servers,this scheme uses the random response method to localized the differential privacy of vote weights and intention data,and broadcasts the resulting disturbance data to the blockchain.For the statistical value of various types of data,the transition matrix is used to express the difference probability between the original data and the disturbed data,and the quota estimate is further obtained.In the process of disturbing data processing and calculation,user privacy and data sensitive information will not be leaked.Maintain data availability while protecting user privacy.Finally,the security of the proposed scheme is proved,and the theoretical analysis and experimental comparison of the proposed schemes with different mechanisms are carried out.The results show that the proposed scheme is safe and feasible.