Design And Analysis Of Efficient, Secure And Democratic Electronic Voting Scheme

With the development of Internet technology, electronic voting gradually comes into being. Electronic voting is an electronization of voting process. Compared with traditionally manual voting, electronic voting can not only save much more resources in both manpower and material, but also avoid the disturbance from human factors, and has the advantages of fairness, security and high efficiency.In this paper, we analyze and discuss three famous electronic voting schemes all based on homomorphic encryption in detail, i.e. CGS scheme (R.Cramer et al. designed), HS scheme (M.Hirt et al. designed) and KO scheme (S.Kim et al. designed). We pay more attentions to democracy requirement of electronic voting scheme, and then prove the necessay and sufficient condition of being a democratic scheme.Based on CGS scheme, also with the ideas of HS scheme and KO scheme, we design an efficient, secure and democratic electronic voting scheme——named as ZZ scheme. Compared with previously proposed schemes, ZZ scheme is more secure——guarantee the security of secret pieces by employing proactive secret sharing; ZZ scheme is more efficient for voting——make use of non-interactive zero-knowledge proof to prove the effectiveness of vote's ciphertext, and cipher only the vote's plaintext chosen by votee when generating vote's ciphertext; ZZ scheme is more efficient for tallying——solve result vector with the idea of the algorithm against the special-integer knapsack cryptography; More importantly, with the blind factor collaboratively generated by both voter and several trusted third parties, ZZ scheme is democratic while it puts less security requirement on the trusted third parties.In addition, this paper designs a basic algorithm and an improved one against 0-1 knapsack cryptography based on dynamic programming and also another algorithm against special-integer knapsack cryptography. With the idea of this algorithm against special-integer knapsack cryptography, the computing load to solve result vector in ZZ scheme can be reduced from O( ) to O ( M - 1).