Services on Demand
Journal
Article
Indicators
- Cited by SciELO
- Access statistics
Related links
- Cited by Google
- Similars in SciELO
- Similars in Google
Share
Revista Facultad de Ingeniería Universidad de Antioquia
Print version ISSN 0120-6230On-line version ISSN 2422-2844
Abstract
GALLEGOS-GARCIA, Gina; GOMEZ-CARDENAS, Roberto and DUCHEN- SANCHEZ, Gonzalo I. Electronic voting protocol from bilinear pairings. Rev.fac.ing.univ. Antioquia [online]. 2010, n.56, pp.234-244. ISSN 0120-6230.
Electronic voting has been an active research area since two decades, which involves using information systems and cryptographic schemes in order to reduce costs and human mistakes as well as increase process speed, without discard its security. In the literature there exist some proposals, which are based on the difficult to resolve mathematical problems such as: prime factorization or discrete logarithm, both of them from Public Key Cryptography. In this paper we describe an electronic voting protocol that meets privacy, transparency and robustness by using a scheme from Identity Based Cryptography. The proposed protocol is divided in four main phases: set-up, authentication, voting and counting and involves a distributed responsibility model, with t out of n entities that are required during the counting phase to decrypt the votes. The paper includes a correctness test to show how the protocol works.
Keywords : Bilinear pairings; threshold schemes; blind signature schemes; electronic voting.