Paper 2016/776

Homomorphic Tallying for the Estonian Internet Voting System

Arnis Parsovs

Abstract

In this paper we study the feasibility of using homomorphic tallying in the Estonian Internet voting system. The paper analyzes the security benefits provided by homomorphic tallying, the costs introduced and the required changes to the voting system. We find that homomorphic tallying has several security benefits, such as improved ballot secrecy, public verifiability of the vote tallying server and the possibility for observers to recalculate the tally without compromising ballot secrecy. The use of modern elliptic curve cryptography allows homomorphic tallying to be implemented without a significant loss of performance.

Metadata
Available format(s)
PDF
Category
Cryptographic protocols
Publication info
Preprint. MINOR revision.
Contact author(s)
arnis @ ut ee
History
2016-08-17: received
Short URL
https://ia.cr/2016/776
License
Creative Commons Attribution
CC BY

BibTeX

@misc{cryptoeprint:2016/776,
      author = {Arnis Parsovs},
      title = {Homomorphic Tallying for the Estonian Internet Voting System},
      howpublished = {Cryptology ePrint Archive, Paper 2016/776},
      year = {2016},
      note = {\url{https://eprint.iacr.org/2016/776}},
      url = {https://eprint.iacr.org/2016/776}
}
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.