An Electronic Voting Scheme Based On Undeniable Signature And Threshold Scheme

Electronic voting is a voting scheme,based on cryptography,which employs computer and network technologies.By electronic voting,it can't only save much manpower and material resource in organization,collecting ballots and counting ballots,but also prevent the factitious factors.Comparing with the traditional voting mode,the electronic one is more impartial,more secure,more efficient and more flexible.Therefore,it is of significance to study and research electronic voting.Since Chaum introduced the first electronic voting scheme in 1982,the concept of electronic voting has come closer and closer to cryptography.Existing voting schemes mostly assume that the voting center is trustful or untraceable channels are exist between voters and voting center.Therefore in this paper,we mainly study and investigate how to minimize the role of the voting center in electronic voting scheme. To realize the goal,the thesis employs multiple computing centers and one voting centers managing the entire voting procedure.And It also provides fair voting and counting stages.First,the thesis introduces the basic theory of cryptography involving in the electronic voting,makes a brief account on the natures of the secure electronic voting scheme.Then we presents and analyzes some typical secure electronic voting scheme,such as FOO scheme.Aiming at the existing shortages in FOO scheme,the thesis proposes a secure electronic voting scheme based on undeniable signature, blind signature and threshold technologies and provides the strict proof for security.