Skip to main content
Springer Nature Link
Log in

An Efficient Homomorphic E-Voting System over Elliptic Curves

  • Conference paper
Electronic Government and the Information Systems Perspective (EGOVIS 2014)

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 8650))

  • 1184 Accesses

Abstract

The homomorphic tallying paradigm provides efficient e-voting solutions when implemented using the multiplicative homomorphic property of the ElGamal cryptosystem. However, that is not the case when implemented over the Elliptic Curve ElGamal cryptosystem (EC-ElGamal) due to the need to solve a knapsack problem for obtaining the election result. In this paper, we present a homomorphic tallying based e-voting system implemented over the Elliptic Curve ElGamal cryptosystem that includes a redundancy system which allows to obtain the election result in a fast way.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Chaum, D.: Security without identification: transaction systems to make big brother obsolete. Communications of the ACM 28(10), 1030–1044 (1985)

    Article  Google Scholar 

  2. Fujioka, A., Okamoto, T., Ohta, K.: A practical secret voting scheme for large scale elections. In: Zheng, Y., Seberry, J. (eds.) AUSCRYPT 1992. LNCS, vol. 718, pp. 244–251. Springer, Heidelberg (1993)

    Chapter  Google Scholar 

  3. Ohkubo, M., Miura, F., Abe, M., Fujioka, A., Okamoto, T.: An improvement on a practical secret voting scheme. In: Zheng, Y., Mambo, M. (eds.) ISW 1999. LNCS, vol. 1729, pp. 225–234. Springer, Heidelberg (1999)

    Chapter  Google Scholar 

  4. Sako, K., Kilian, J.: Receipt-free mix-type voting scheme: A practical solution to the implementation of a voting booth. In: Guillou, L.C., Quisquater, J.-J. (eds.) EUROCRYPT 1995. LNCS, vol. 921, pp. 393–403. Springer, Heidelberg (1995)

    Chapter  Google Scholar 

  5. Jakobsson, M.: A practical mix. In: Nyberg, K. (ed.) EUROCRYPT 1998. LNCS, vol. 1403, pp. 448–461. Springer, Heidelberg (1998)

    Google Scholar 

  6. Sebé, F., Miret, J.M., Pujolàs, J., Puiggalí, J.: Simple and efficient hash-based verifiable mixing for remote electronic voting. Computer Communications 33(6), 667–675 (2010)

    Article  Google Scholar 

  7. Peng, K.: An efficient shuffling based eVoting scheme. J. Syst. Softw. 84(6), 906–922 (2011)

    Article  Google Scholar 

  8. Mateu, V., Miret, J.M., Sebé, F.: Verifiable encrypted redundancy for mix-type remote electronic voting. In: Andersen, K.N., Francesconi, E., Grönlund, Å., van Engers, T.M. (eds.) EGOVIS 2011. LNCS, vol. 6866, pp. 370–385. Springer, Heidelberg (2011)

    Chapter  Google Scholar 

  9. Cohen, J.D., Fischer, M.J.: A robust and verifiable cryptographically secure election scheme. In: 26th Annual Symposium on Foundations of Computer Science, pp. 372–382 (1985)

    Google Scholar 

  10. Sako, K., Kilian, J.: Secure voting using partially compatible homomorphisms. In: Desmedt, Y.G. (ed.) CRYPTO 1994. LNCS, vol. 839, pp. 411–424. Springer, Heidelberg (1994)

    Chapter  Google Scholar 

  11. Cramer, R., Gennaro, R., Schoenmakers, B.: A secure and optimally efficient multi-authority election scheme. In: Fumy, W. (ed.) EUROCRYPT 1997. LNCS, vol. 1233, pp. 103–118. Springer, Heidelberg (1997)

    Chapter  Google Scholar 

  12. Hirt, M., Sako, K.: Efficient receipt-free voting based on homomorphic encryption. In: Preneel, B. (ed.) EUROCRYPT 2000. LNCS, vol. 1807, pp. 539–556. Springer, Heidelberg (2000)

    Chapter  Google Scholar 

  13. Peng, K., Aditya, R., Boyd, C., Dawson, E., Lee, B.: Multiplicative homomorphic E-voting. In: Canteaut, A., Viswanathan, K. (eds.) INDOCRYPT 2004. LNCS, vol. 3348, pp. 61–72. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  14. Peng, K., Bao, F.: Efficient multiplicative homomorphic E-voting. In: Burmester, M., Tsudik, G., Magliveras, S., Ilić, I. (eds.) ISC 2010. LNCS, vol. 6531, pp. 381–393. Springer, Heidelberg (2011)

    Chapter  Google Scholar 

  15. Hankerson, D., Menezes, A.J., Vanstone, S.: Guide to Elliptic Curve Cryptography. Springer (2004)

    Google Scholar 

  16. Cramer, R., Damgård, I.B., Schoenmakers, B.: Proofs of partial knowledge and simplified design of witness hiding protocols. In: Desmedt, Y.G. (ed.) CRYPTO 1994. LNCS, vol. 839, pp. 174–187. Springer, Heidelberg (1994)

    Chapter  Google Scholar 

  17. Chaum, D., Pedersen, T.P.: Wallet databases with observers. In: Brickell, E.F. (ed.) CRYPTO 1992. LNCS, vol. 740, pp. 89–105. Springer, Heidelberg (1993)

    Chapter  Google Scholar 

  18. Juels, A., Catalano, D., Jakobsson, M.: Coercion-resistant electronic elections. In: Chaum, D., Jakobsson, M., Rivest, R.L., Ryan, P.Y.A., Benaloh, J., Kutylowski, M., Adida, B. (eds.) Towards Trustworthy Elections. LNCS, vol. 6000, pp. 37–63. Springer, Heidelberg (2010)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dept. of Mathematics, Universitat de Lleida, Jaume II, 69, 25001, Lleida, Spain

    M. Àngels Cerveró, Víctor Mateu, Josep M. Miret, Francesc Sebé & Javier Valera

Authors
  1. M. Àngels Cerveró
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Víctor Mateu
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Josep M. Miret
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Francesc Sebé
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Javier Valera
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Corvinus University of Budapest, Fővám tér 13.-15, 1093, Budapest, Hungary

    Andrea Kő

  2. ITTIG - CNR, Institute of Legal Information Theory and Techniques, Italian National Research, Council, Via de’ Barucci 20, 50127, Florence, Italy

    Enrico Francesconi

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer International Publishing Switzerland

About this paper

Cite this paper

Cerveró, M.À., Mateu, V., Miret, J.M., Sebé, F., Valera, J. (2014). An Efficient Homomorphic E-Voting System over Elliptic Curves. In: Kő, A., Francesconi, E. (eds) Electronic Government and the Information Systems Perspective. EGOVIS 2014. Lecture Notes in Computer Science, vol 8650. Springer, Cham. https://doi.org/10.1007/978-3-319-10178-1_4

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-10178-1_4

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-10177-4

  • Online ISBN: 978-3-319-10178-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics