Identity-based cryptosystems and signature schemes
Proceedings of CRYPTO 84 on Advances in cryptology
Elections with unconditionally-secret ballots and disruption equivalent to breaking RSA
Lecture Notes in Computer Science on Advances in Cryptology-EUROCRYPT'88
Untraceable electronic mail, return addresses, and digital pseudonyms
Communications of the ACM
Practical multi-candidate election system
Proceedings of the twentieth annual ACM symposium on Principles of distributed computing
Efficient Algorithms for Pairing-Based Cryptosystems
CRYPTO '02 Proceedings of the 22nd Annual International Cryptology Conference on Advances in Cryptology
PKC '03 Proceedings of the 6th International Workshop on Theory and Practice in Public Key Cryptography: Public Key Cryptography
Anonymous Secure E-Voting Over a Network
ACSAC '98 Proceedings of the 14th Annual Computer Security Applications Conference
Efficient revocation and threshold pairing based cryptosystems
Proceedings of the twenty-second annual symposium on Principles of distributed computing
A New and Secure Electronic Voting Protocol Based on Bilinear Pairings
CONIELECOMP '09 Proceedings of the 2009 International Conference on Electrical, Communications, and Computers
A secure and optimally efficient multi-authority election scheme
EUROCRYPT'97 Proceedings of the 16th annual international conference on Theory and application of cryptographic techniques
Public-key cryptosystems based on composite degree residuosity classes
EUROCRYPT'99 Proceedings of the 17th international conference on Theory and application of cryptographic techniques
Hi-index | 0.00 |
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.