Paper 2021/491
A toolbox for verifiable tally-hiding e-voting systems
Abstract
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 efficient tally-hiding schemes with no leakage for four important counting functions: D'Hondt, Condorcet, STV, and Majority Judgment. We prove that they can be used to design a private and verifiable voting scheme. We also unveil unknown flaws or leakage in several previously proposed tally-hiding schemes.
Metadata
- Available format(s)
-
PDF
- Category
- Applications
- Publication info
- Published elsewhere. ESORICS 2022
- Keywords
- election schemesdistributed cryptography
- Contact author(s)
- pierrick gaudry @ loria fr
- History
- 2023-06-10: last of 3 revisions
- 2021-04-19: received
- See all versions
- Short URL
- https://ia.cr/2021/491
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2021/491,
author = {Véronique Cortier and Pierrick Gaudry and Quentin Yang},
title = {A toolbox for verifiable tally-hiding e-voting systems},
howpublished = {Cryptology ePrint Archive, Paper 2021/491},
year = {2021},
note = {\url{https://eprint.iacr.org/2021/491}},
url = {https://eprint.iacr.org/2021/491}
}
