NobleBlocks
Public

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

Published in Transactions on Emerging Telecommunications Technologies • Dec 23, 2016
Authors:
Hamed Mousavi
,
Babak Ahmadi
,
Saeed Rahimi

Abstract

Abstract One 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 n...

Finding related papers...

Discussions

(0)

No comments yet

Be the first to share your thoughts!