2014 | OriginalPaper | Buchkapitel
An Efficient Homomorphic E-Voting System over Elliptic Curves
verfasst von : M. Àngels Cerveró, Víctor Mateu, Josep M. Miret, Francesc Sebé, Javier Valera
Erschienen in: Electronic Government and the Information Systems Perspective
Verlag: Springer International Publishing
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
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.