2014 | OriginalPaper | Chapter
An Efficient Homomorphic E-Voting System over Elliptic Curves
Authors : M. Àngels Cerveró, Víctor Mateu, Josep M. Miret, Francesc Sebé, Javier Valera
Published in: Electronic Government and the Information Systems Perspective
Publisher: Springer International Publishing
Activate our intelligent search to find suitable subject content or patents.
Select sections of text to find matching patents with Artificial Intelligence. powered by
Select sections of text to find additional relevant content using AI-assisted search. 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.