Verifiable Internet Elections with Everlasting Privacy and Minimal Trust

Conference paper

DOI: 10.1007/978-3-319-22270-7_5

Part of the Lecture Notes in Computer Science book series (LNCS, volume 9269)
Cite this paper as:
Locher P., Haenni R. (2015) Verifiable Internet Elections with Everlasting Privacy and Minimal Trust. In: Haenni R., Koenig R., Wikström D. (eds) E-Voting and Identity. VoteID 2015. Lecture Notes in Computer Science, vol 9269. Springer, Cham

Abstract

This paper presents a new cryptographic Internet voting protocol based on a set membership proof and a proof of knowledge of the representation of a committed value. When casting a vote, the voter provides a zero-knowledge proof of knowledge of the representation of one of the registered voter credentials. In this way, votes are anonymized without the need of trusted authorities. The absence of such authorities reduces the trust assumptions to a minimum and makes our protocol remarkably simple. Since computational intractability assumptions are only necessary to prevent the creation of invalid votes during the voting period, but not to protect the secrecy of the vote, the protocol even offers a solution to the everlasting privacy problem.

Copyright information

© Springer International Publishing Switzerland 2015

Authors and Affiliations

  1. 1.Bern University of Applied SciencesBielSwitzerland
  2. 2.University of FribourgFribourgSwitzerland

Personalised recommendations