Table of Contents Author Guidelines Submit a Manuscript
The Scientific World Journal
Volume 2015, Article ID 741031, 6 pages
http://dx.doi.org/10.1155/2015/741031
Research Article

Electronic Voting Protocol Using Identity-Based Cryptography

1Sección de Estudios de Posgrado e Investigación, Escuela Superior de Ingeniería Mecánica y Eléctrica, Instituto Politécnico Nacional, Avenida Santa Ana 1000, San Francisco, Culhuacan, Coyoacan, 04430 México City, DF, Mexico
2Departamento de Matematicas, Universidad Autónoma Metropolitana Iztapalapa, San Rafael Atlixco 186, Vicentina, Iztapalapa, 09340 México City, DF, Mexico

Received 9 February 2015; Revised 4 May 2015; Accepted 6 May 2015

Academic Editor: Ting-Yi Chang

Copyright © 2015 Gina Gallegos-Garcia and Horacio Tapia-Recillas. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Linked References

  1. R. Cramer, R. Gennaro, and B. Schoenmakers, “A secure and optimally efficient multi-authority election scheme,” in Advances in Cryptology—EUROCRYPT '97, vol. 1233 of Lecture Notes in Computer Science, pp. 361–376, Springer, Berlin, Germany, 1997. View at Publisher · View at Google Scholar
  2. Y. Mu and V. Varadharajan, “Anonymuos secure e-voting over a network,” in Proceedings of the 14th Annual Computer Security Applications Conference, pp. 293–299, IEEE Computer Society, 1998.
  3. M. Ohkubo, F. Miura, M. Abe, A. Fujioka, and T. Okamoto, “An improvement on a practical secret voting scheme,” in Information Security, vol. 1729 of Lecture Notes in Computer Science, pp. 225–234, Springer, Berlin, Germany, 1999. View at Publisher · View at Google Scholar
  4. O. Baudron, P. Fouque, D. Pointcheval, G. Poupard, and J. Stern, “Practical multi-candidate election system,” in Proceedings of the 20th Annual ACM Symposium on Principles of Distributed Computing (PODC '01), pp. 274–283, ACM, 2001. View at Publisher · View at Google Scholar
  5. G. Gallegos-García, R. Gómez-Cárdenas, and G. I. Duchén-Sánchez, “Identity based threshold cryptography and blind signatures for electronic voting,” WSEAS Transactions on Computers, vol. 9, no. 1, pp. 62–71, 2010. View at Google Scholar · View at Scopus
  6. Internet Policy Institute, Report of the National Workshop on Internet Voting: Issues and Research Agenda, Internet Policy Institute, 2001.
  7. T. Kohno, A. Stubblefield, A. D. Rubin, and D. S. Wallach, “Analysis of an electronic voting system,” in Proceedings of the IEEE Symposium on Security and Privacy, pp. 27–40, IEEE, May 2004. View at Publisher · View at Google Scholar · View at Scopus
  8. D. A. Gritzalis, “Principles and requirements for a secure e-voting system,” Computers and Security, vol. 21, no. 6, pp. 539–556, 2002. View at Publisher · View at Google Scholar · View at Scopus
  9. P. Barreto, H. Kim, and M. Scott, “Efficient algorithms for pairing-based cryptosystems,” in Advances in Cryptology—Crypto '02, vol. 2442 of Lecture Notes in Computer Science, pp. 354–368, Springer, 2003. View at Google Scholar
  10. J. L. Beuchat, N. Brisebarre, J. Detrey, E. Okamoto, M. Shirase, and T. Takagi, “Algorithms and arithmetic operators for computing the ηT pairing in characteristic three,” IEEE Transactions on Computers, vol. 57, no. 11, pp. 1454–1468, 2008. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  11. H. Cohen and F. Gerhard, Handbook of Elliptic and Hyperelliptic Curve Cryptography, Chapman & Hall/CRC, Taylor & Francis, 2006.
  12. D. Boneh and M. Franklin, “Identity-based encryption from the Weil pairing,” in Advances in Cryptology—CRYPTO 2001: Proceedings of the 21st Annual International Cryptology Conference, Santa Barbara, California, USA, August 19–23, 2001, vol. 2139 of Lecture Notes in Computer Science, pp. 213–229, Springer, Berlin, Germany, 2001. View at Publisher · View at Google Scholar
  13. B. Libert and J.-J. Quisquater, “Efficient revocation and threshold pairing based cryptosystems,” in Proceedings of the 22nd Annual ACM Symposium on Principles of Distributed Computing (PODC '03), pp. 163–171, July 2003. View at Scopus
  14. D. Liem, F. Zhang, and K. Kim, “A new threshold blind signature scheme from pairings,” in Proceedings of the Symposium on Cryptography and Information Security, Hamamatsu, Japan, 2003.
  15. A. Shamir, “How to share a secret,” Communications of the ACM, vol. 22, no. 11, pp. 612–613, 1979. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  16. Y. Desmedt, “Threshold cryptosystems,” in Advances in Cryptology—AUSCRYPT '92, J. Seberry and Y. Zheng, Eds., vol. 718 of Lecture Notes in Computer Science, pp. 1–14, Springer, Berlin, Germany, 1993. View at Publisher · View at Google Scholar
  17. A. Boldyreva, “Efficient threshold signature, multisignature and blind signature schemes based on the Gap-Diffie-Hellman-Group signature scheme,” in Proceedings of the International Workshop on Public Key Cryptography (PKC '03), vol. 2139 of Lecture Notes in Computer Science, pp. 31–46, Springer, 2003.