Research Of Electricity Voting Protocol

As the rapid development and application of Intenet, humankind has gradually entered the information society. Information, an important resource, is as a more important role in social production and daily lives. Electronic voting is exactly the product of information technology, it has become an important component of e-commerce and e-government. Although there are many deficiencies in electronic voting system, in the long run, electronic voting which is quicker, more convenient and more security will replace the traditional voting.Most of the traditional electronic voting protocol use zero-knowledge proof to verify the legitimacy of votes. While the low efficiency of the zero-knowledge proof process efficiency greatly restricted the efficiency of the election, so it does not apply to a large-scale national election. The focus of this article is electronic voting system without zero-knowledge proof.First, in this article, it is described that the electronic voting protocol, the basic concepts and principles, an overview of its development process and the basic technology.Second, with the progress of the e-voting protocols study, the conditions of secure electronic voting protocols were propsed more and more, so the designers must follow all the security natures of the design of the protocols, in this way the design is more difficult and complex than before. Fortunately, Ran Canetti proposed UC concept. In UC framework, the design of protocol is in a modular approach. In this paper, an electronic voting protocol with two candidates was proposed based on the nature of modulus in Number Theory. In the UC framework we adopt a new code to verify the legitimacy of votes without zero-knowledge proof and use identity-based (n,n) threshold encryption and decryption, as well as bi-linear to achieve the multiple counting of the Center for counting of the multi-candidate electoral scheme.Third, based on Bit decomposition protocol, a without zero-knowledge proof multi-candidate election protocol was proposed. In 2006 TCC Bit decomposition was first proposed by Ivan Damard as a typical application of secure multi-party computation. By the cooperation of high-performance server, the encryption bit string value of each one broken down into its corresponding encrypted value, which is used to decompose the re-encoded the votes into the votes the candidates by their counterparts. And then through the homomorphic encryption algorithm with the state election results can be obtained. Using above-mentioned measures that the high-performance server is used to decompose a large number of votes and complete the statistical work can be greatly improve the efficiency of the elections for the national election, or another large-scale election.