A toolbox for verifiable tally-hiding e-voting systems - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2022

A toolbox for verifiable tally-hiding e-voting systems


In most verifiable electronic voting schemes, one key step is the tally phase, where the election result is computed from the encrypted ballots. A generic technique consists in first applying (verifiable) mixnets to the ballots and then revealing all the votes in the clear. This however discloses much more information than the result of the election itself (that is, the winners) and may offer the possibility to coerce voters. In this paper, we present a collection of building blocks for designing tally-hiding schemes based on multi-party computations. As an application, we propose the first tally-hiding schemes with no leakage for four important counting functions: D'Hondt, Condorcet, STV, and Majority Judgment. We also unveil unknown flaws or leakage in several previously proposed tally-hiding schemes.
Fichier principal
Vignette du fichier
main.pdf (637.55 Ko) Télécharger le fichier
Origin Files produced by the author(s)

Dates and versions

hal-03367930 , version 1 (06-10-2021)
hal-03367930 , version 2 (29-09-2022)




Véronique Cortier, Pierrick Gaudry, Quentin Yang. A toolbox for verifiable tally-hiding e-voting systems. ESORICS 2022 - 27th European Symposium on Research in Computer Security, Sep 2022, Copenhague, Denmark. pp.631-652, ⟨10.1007/978-3-031-17146-8_31⟩. ⟨hal-03367930v2⟩
228 View
255 Download



Gmail Mastodon Facebook X LinkedIn More