Identity-based threshold cryptography for electronic voting

Electronic voting protocols are a reasonable alternative to conventional elections. Nevertheless, they are facing an evolution due to its requirements, especially the ones needed to provide full security considered to represent a democratic electronic vote. Different algorithms, based on public key schemes, have been proposed in the literature to meet these security requirements. We propose the use of threshold cryptography and bilinear pairings in order to provide the security requirements that an electronic voting protocol must meet, without requiring the entire infrastructure needed in a public key scheme. We make a comparative analysis of our proposal with other electronic voting protocols. It is based in their performance and the cryptographic primitives they use.