Research And Design Of Electronic Voting Protocol Via Internet

With the development of computer and network technologies, a new manner of voting ?electronic voting comes into being Based on cryptography, electronic voting uses computer and network technologies to realize the functions of voting. Electronic voting, especially electronic voting via Internet, has the advantage of high efficiency, convenience and flexibility than the traditionally manual voting. People can vote at home by clicking the mouse at ease in front of the screens. Electronic voting via Internet can be applied to many fields from the voting for entertainment to the voting of governments and international organizations It has broad outlook of application.In order to meet the requirement that electronic voting be camed out securely and reliably, not only should the computers and network systems be assured to run properly, but also a secure electromc voting protocol must be designed D.Chaum designed the first electromc voting protocol in 1981. Since then many scholars have designed different protocols that are adapted to different situations. However, these protocols have some defaults They are not applied very well.In 1992, Fujioka, Okamoto and Ohta designed an electronic voting protocol(FOO protocol). This protocol can ensure the pnvacy of the voters and fairness of the voting and is suitable for large scale elections.It has stronger practicability Based on FOO protocol, an electronic voting protocol ?U protocol is designed in this paper by refemng to YL and LYW protocolsIn U protocol, multiple subtalliers are set up, the secret key sent to these subtalliers are disposed o~ with threshold scheme of secret sharing In other words, the secret key is split into multiple shares. The voter combines the bit commitment of the ballot, the signature of the subvahdator and the share of the secret key, and then sends them to the subtalhers and publishes them These subtalliers are not allowed to combine the shares to recover the secret key until the opening stage After it, these subtalhers use this secret key to decrypt the bit commitment, restore the ballot and publish it. So we can solve the problems in FOO and YL protocols. That is, when the bit commitment of the ballot and the secret key are sent to the tallier separately, the voting procedure becomes tanglesome for the voters and when the voter sends an illegal key which cannot open the bit commitment, there is no way to distinguish a dishonest voter from a dishonest tallier in FOO and YL protocols. In addition, we apply the elliptic curve cryptographic Algorithms presented in LYW protocol to U protocol so that we can efficiently take advantage of the performance of high security, small key size and good flexibility of elliptic curve cryptosystems(ECC).In conclusion, U protocol meets completeness, soundness, privacy, unreusability, eligibility, fairness, verifiability, flexibility, convenience and high efficiency. It has better security and stronger practicability.TLS protocol provides a way to transmit data and authenticate between entities via Internet. It can be used in multiple fields, for example, electronic voting However, TLS protocol still doesn抰 support ECC at present In order to solve this problem, two extended models ofTLS protocol to support ECC are proposed based on cipher suites and hello messages respectively.