Blinded additively homomorphic encryption schemes for self-tallying voting

Jérôme Dossogne, Frédéric Lafitte

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

In this paper, we propose a self-tallying election protocol based public key homomorphic encryption. The additive ho-momorphism allows a set of participants (voters) to publish an encrypted value (ballot) and to compute the encrypted sum of all these values based on their ciphertexts. Our scheme has the particularity that anyone can decrypt the sum, but only once all participants have contributed to its computation. More precisely, the sum can be decrypted at all times, but remains blinded until all participants have contributed their vote, which contains a share of the unblinding key. Additionally, we propose an adaptation of Helios in order to provide self-tallying.

Original languageEnglish
Title of host publicationSIN 2013 - Proceedings of the 6th International Conference on Security of Information and Networks
Pages173-180
Number of pages8
DOIs
Publication statusPublished - 2013
Event6th International Conference on Security of Information and Networks, SIN 2013 - Aksaray, Turkey
Duration: 26 Nov 201328 Nov 2013

Publication series

NameSIN 2013 - Proceedings of the 6th International Conference on Security of Information and Networks

Conference

Conference6th International Conference on Security of Information and Networks, SIN 2013
Country/TerritoryTurkey
CityAksaray
Period26/11/1328/11/13

Keywords

  • Blinding
  • E-voting
  • Helios
  • Homomorphism
  • Self-tallying

Fingerprint

Dive into the research topics of 'Blinded additively homomorphic encryption schemes for self-tallying voting'. Together they form a unique fingerprint.

Cite this