A New and Secure Electronic Voting Protocol Based on Bilinear Pairings

Electronic voting processes are facing an evolution due to its requirements, especially the ones needed to provide full security. In addition it should reduce costs and increase processing speed. Considering the aforementioned, an electronic voting protocol based on bilinear pairings is presented, which uses the message authentication codes (MAC), the blind signature scheme and a scheme of threshold identity based encryption (IBE). The protocol is divided in four main stages: voting set up, authentication, voting and counting. We consider a responsibility distributed model, in which the votes are decrypted with t of n users. Our protocol presents the first scheme based on blind signature and threshold IBE.