Abstract

With the rapid development of internet, the applications requiring unobservable communications increased, such as electronic payment, electronic voting and electronic bidding. The most typical electronic voting protocol was the FOO protocol, which is the first protocol that could be employed in large-scale voting. However, when used on campus, FOO protocol was rather complicated to configure. This paper focuses on scenes of campus voting, such as course evaluation, students' mutual evaluation and students' union election. The character of these scenes was that the interest involved was relatively small and required more attention to anonymity. Therefore, the paper simplified the FOO protocol, removed the counter, concerned about abstention problem and optimized to solve the problem of ballot collision that originally existed due to bit commitment. The experiment showed the correctness, non-reusability and anonymity of our proposed scheme. In addition, because the application used OpenSSL for end-to-end encryption, it can authenticate users and resist eavesdropping attacks and tampering attacks.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call