Analysis And Desigin Of The E-voting Protocol In Campus Network

Secure Multi-party Computation is research on the problem where two or more parties want to jointly to compute a task, in the process of computing, it must ensure the privacy of participants, and at last each of the participants know the output of the task. The Problem was first proposed by A.C.Yao in1982, and in1987, O.Goldreich and S.Micali proposed the protocol of secure multi-party computation which is cryptography security, this protocol can compute any function. But O. Goldreich pointed out in1988that using general protocol to solve specific problem in secure multi-party computation can not reach ideal effect. To these specific problems we should design corresponding security protocol, which can solve problem efficiently. Under the pushing of this thought and the further research of scholars, secure multi-party computation derivative out a lot of research direction, such as: privacy-preservation computational geometry, private information retrieval, electronic voting, electronic sale, statistical analysis and so on. All these promote secure multi-party computation can solve more realistic problem. Electronic Voting is an important and realistic problem, which has significant application in life field, commercial field and so on.Voting is a common occurrence behavior in our daily life. With the development of the times, voting is no longer confined to political activities. In recent years, various vote activities are increase continually, but traditional vote activity by hand is not effective, much money and effort were wasted seriously. We also can’t make sure about the safety and equity. So, traditional vote can’t satisfy our needs. Besides, with the rapid development of net, various web services are all over our daily life and works. E-voting instead of traditional voting is getting more and more attention. How to devise a more secure and practical E-voting system is becoming a hot topic in information security industry. E-voting is a research field of cryptography, with the basic of various cryptography techniques, using computers and internet to accomplish the whole vote procedure. E-voting could save time and effort, with high efficiency and flexibility. Because the features of cryptographic technique and E-voting system itself, how to ensure the system’s safety with availability is wildly researched. Generally speaking, a safety E-voting system should be satisfied with the following principles:Veracity, integrity, accessibility, uniqueness, efficiency, impartiality, flexibility, verifiability, anonymity and non-obligatory.This article is mainly researched on the E-voting protocol in Campus Network, and did a further research in the pluggable authentication module. The following is the mainly work:First, the project achieves a complete E-voting system. For voter, the system protects their secrets. For voting result, the project ensures the impartiality. Any voter who has the qualification to vote could finish their voting by enter browser in any place. And the system has the ability to ensure that anyone could vote just once, and test whether their votes were counted. The system also could find statistical errors and the final voting result. All above are the features of the system. Comparing with many existing systems, multi-entity is the best feature of this system. So, voting right will be separated in detail. In this way, we can prevent cheating. Each module just needs to be responsible for its own function. If so, E-voting will meet safety requirement.Then, a further research was done with pluggable authentication modules in E-voting system. Based on elliptic curve cryptography, an electronic seal technology was proposed. The electronic seal technology is ultimately used in authentic phase of E-voting.