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.
展开▼