Cryptology ePrint Archive: Report 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.

Category / Keywords: cryptographic protocols /

Date: received 3 Aug 2016

Contact author: arnis at ut ee

Available format(s): PDF | BibTeX Citation

Version: 20160817:065538 (All versions of this report)

Short URL: ia.cr/2016/776

Discussion forum: Show discussion | Start new discussion


[ Cryptology ePrint archive ]