Blinded additively homomorphic encryption schemes for self-tallying voting

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

Onderzoeksoutput: Hoofdstuk in Boek/Rapport/CongresprocedureConferentiebijdragepeer review

Samenvatting

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.

Originele taal-2Engels
TitelSIN 2013 - Proceedings of the 6th International Conference on Security of Information and Networks
Pagina's173-180
Aantal pagina's8
DOI's
StatusGepubliceerd - 2013
Evenement6th International Conference on Security of Information and Networks, SIN 2013 - Aksaray, Turkije
Duur: 26 nov. 201328 nov. 2013

Publicatie series

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

Congres

Congres6th International Conference on Security of Information and Networks, SIN 2013
Land/RegioTurkije
StadAksaray
Periode26/11/1328/11/13

Vingerafdruk

Duik in de onderzoeksthema's van 'Blinded additively homomorphic encryption schemes for self-tallying voting'. Samen vormen ze een unieke vingerafdruk.

Citeer dit