A new approach to decrease the computational complexity of e‐voting protocols

Abstract

AbstractOne of the most important methods of remote e‐voting is based on the ElGamal homomorphic cryptosystems. These systems are secure enough provided that the discrete logarithm problem is secure. However, one of their main challenges is the limitation on the number of voters. In this paper, a new scheme is suggested so as to increase the number of voters by designing parallel voting subprotocols. The required time for the tally computing process for 10 subprotocols decreases to less than 20% of the time in a similar scheme. The necessary memory space and the number of random integers do not show a significant change in comparison with those of similar voting protocols. Also, the communication complexity is of order O(Nt), which seems reasonable. The security comparisons show an acceptable rate of security in a reasonable length of keys for the proposed protocol. Simulations show that the number of covering voters in this protocol is 10 times more than that of a similar protocol.