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. © 2014 Springer International Publishing.
Cite
CITATION STYLE
Cerveró, M. À., Mateu, V., Miret, J. M., Sebé, F., & Valera, J. (2014). An efficient homomorphic e-voting system over elliptic curves. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8650 LNCS, pp. 41–53). Springer Verlag. https://doi.org/10.1007/978-3-319-10178-1_4
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
