Electronic voting protocol from bilinear pairings
DOI:
https://doi.org/10.17533/udea.redin.14672Keywords:
threshold schemes, blind signature schemes, electronic votin, bilinear pairingsAbstract
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.
Downloads
References
O. Cetinkaya, D. Cetinkaya, “Verification and Validation Issues in Electronic Voting” The Electronic Journal of e-Government, Vol. 5. 2007, pp 117 – 126.
D.R. Kuhn, V. C. Hu, W. T. Polk, S-J. Chang, Introduction to Public Key Technology and the Federal PKI Infrastructure, National Institute of Standards and Technology, SP 800-32, 2001, pp. 5-27. DOI: https://doi.org/10.6028/NIST.SP.800-32
A. Shamir, “Identity-based cryptosystems and signature schemes”, Advances in Cryptology Crypto´84, Springer-Verlag, LNCS 196. Santa Bárbara (CA). 1985. pp. 47-53. DOI: https://doi.org/10.1007/3-540-39568-7_5
D. Boneh, M. Franklin, “Identity-based encryption from the Weil Pairing”, SIAM Journal of Computing, Vol. 32. 2003. pp. 586-615. DOI: https://doi.org/10.1137/S0097539701398521
M. Scott, N. Benger, M. Charlemagne, L. J. Dominguez and E. J. Kachisa, “On the Final Exponentiation for Calculating Pairings on Ordinary Elliptic Curves”. Pairing 2009. Springer-Verlag. LNCS 5671. 2009. pp. 78-88. DOI: https://doi.org/10.1007/978-3-642-03298-1_6
A. Boldyreva, “Efficient Threshold Siganture, Multisignature and Blind Signature Schemes based on the Gap-Diffie-Hellman-Group Siganture Scheme”. PKC 2003. Springer-Verlag, LNCS 2139. Miami (FL). 2003. pp. 31-46. DOI: https://doi.org/10.1007/3-540-36288-6_3
B. Libert and J. Quisquarter, “Efficient Revocation and Threshold Pairing Based Cryptosystems”, ACM Annual Symposium on Principles of Distributed Computing, PODC. Boston (MA). 2003. pp. 163-171. DOI: https://doi.org/10.1145/872035.872059
A. Shamir. How to share a secret. Ed. Communications ACM 22. New York. 1979. pp. 612-613. DOI: https://doi.org/10.1145/359168.359176
A. Fujioka, T. Okamoto and Ohta K., “A practical secret voting scheme for large scale elections”, Advances in Cryptology – AUSCRYPT ’92, LNCS 718, Springer – Verlag. Queensland (Australia). 1993. pp. 244-251. DOI: https://doi.org/10.1007/3-540-57220-1_66
Lourdes López-García, Francisco Rodríguez- Henríquez and Miguel Ángel, León-Chávez, “An E-Voting Protocol Based on Pairing Blind Signatures” Poster Session of International Conference on Security and Cryptography, Secrypt 2008. Porto (Portugal).
Sung-Hyun Yun Sung-Jin Lee, “An electronic voting scheme based on undeniable blind signature scheme”, Proc. of the 37th Annual 2003 International Carnahan Conference on Security Technology, IEEE Computer Society. Taipei (Taiwan). 2003. pp. 163-167.
B. Kharchineh and M. Ettelaee, “A New Electronic Voting Protocol Using a New Blind Signature Scheme”, Proc. of the Second International Conference on Future Networks, 2010, IEEE Computer Society. Sanya (China). 2010. pp. 190-194. DOI: https://doi.org/10.1109/ICFN.2010.40
D. Chaum, “Elections with unconditionally secrets ballots and disruption equivalent to breaking RSA”, Proc. of Eurocrypt ’88, Davos. Switzerland. 1988. pp. 177-182 DOI: https://doi.org/10.1007/3-540-45961-8_15
R. Cramer, R. Gennaro and B. Schoenmrkers, “A Secure and Optimally Efficient Multi-Authority Election Scheme”, Proc. of EUROCRYPT ’97, Springer – Verlag, LNCS 1233. Konstanz (Germany). 1997. pp. 103-118. DOI: https://doi.org/10.1007/3-540-69053-0_9
O. Baudron, P. Fouque, D. Pointcheval, G. Poupard and J. Stern, “Practical multi-candidate election system”, ACM Annual Symposium on Principles of Distributed Computing, PODC 2001. New Port (RI). 2001. pp 274-283. DOI: https://doi.org/10.1145/383962.384044
Downloads
Published
How to Cite
Issue
Section
License
Copyright (c) 2018 Revista Facultad de Ingeniería
This work is licensed under a Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International License.
Revista Facultad de Ingeniería, Universidad de Antioquia is licensed under the Creative Commons Attribution BY-NC-SA 4.0 license. https://creativecommons.org/licenses/by-nc-sa/4.0/deed.en
You are free to:
Share — copy and redistribute the material in any medium or format
Adapt — remix, transform, and build upon the material
Under the following terms:
Attribution — You must give appropriate credit, provide a link to the license, and indicate if changes were made. You may do so in any reasonable manner, but not in any way that suggests the licensor endorses you or your use.
NonCommercial — You may not use the material for commercial purposes.
ShareAlike — If you remix, transform, or build upon the material, you must distribute your contributions under the same license as the original.
The material published in the journal can be distributed, copied and exhibited by third parties if the respective credits are given to the journal. No commercial benefit can be obtained and derivative works must be under the same license terms as the original work.
Twitter