Efficient and secure e-voting scheme using elliptic curve cryptography

Voting allows the people to elect their representative and express their preferences. In modern day democracy, voting is one fundamental and most important tool for election. To strengthen this process, efforts must be made to achieve a confirmable and transparent voting system. Naturally, the veracity of the election process is of ultimate importance for the honor of the democracy itself. The online voting or e-voting system is a cost-effective procedure, which saves a lot of money and time spent for organizing the election. However, security, integrity of data and privacy of the voter are the increasing concerns in this context. In this paper, we have done a thorough literature survey of the various latest schemes in this context and found that the schemes prone to several security and privacy threats. Moreover, a major issue with all these schemes is that they are inefficient in terms of computation and communication overheads. With this motivation, we present a novel and efficient e-voting scheme to tackle the security and privacy concerns. The proposed scheme is designed using the concept of blind signature, anonymous channel and trust worthy entities where elliptic curve cryptography (ECC) works as a backbone. The proposed scheme is formally evaluated using well known AVISPA simulation tool, which simulates the attack model using CL-AtSe as well as OFMC backend according to Dolev-Yao threat model. In both the cases, all the possible security threats are being nullified by the proposed scheme and results in safe communication. Also, the scheme is analyzed against all the possible attacks that jeopardize the integrity of the existing voting systems. Moreover, the proposed scheme is also compared with other prevailing schemes in terms of computation and communication overheads and found more efficient.