Is the JCJ voting system really coercion-resistant? - Department of Algorithms, Computation, Image and Geometry Access content directly
Conference Papers Year : 2024

Is the JCJ voting system really coercion-resistant?

Abstract

Coercion-resistance is a security property of electronic voting, often considered as a must-have for high-stake elections. The JCJ voting scheme, proposed in 2005 by Juels, Catalano and Jakobsson, is still the reference paradigm when designing a coercion-resistant protocol. We highlight a weakness in JCJ that is also present in all the systems following its general structure. This comes from the procedure that precedes the tally, where the trustees remove the ballots that should not be counted. This phase leaks more information than necessary, leading to potential threats for the coerced voters. Fixing this leads to the notion of cleansing-hiding, that we apply to form a variant of JCJ that we call CHide. One reason for the problem not being seen before is the fact that the associated formal definition of coercion-resistance was too weak. We therefore propose a definition that takes into account more behaviors such as revoting or the addition of fake ballots by authorities. We then prove that CHide is coercion-resistant for this definition.
Fichier principal
Vignette du fichier
main-full.pdf (559.28 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-03629587 , version 1 (04-04-2022)
hal-03629587 , version 2 (17-05-2023)
hal-03629587 , version 3 (13-02-2024)

Licence

Attribution

Identifiers

  • HAL Id : hal-03629587 , version 3

Cite

Véronique Cortier, Pierrick Gaudry, Quentin Yang. Is the JCJ voting system really coercion-resistant?. 37th IEEE Computer Security Foundations Symposium (CSF), 2024, Enschede, Netherlands. ⟨hal-03629587v3⟩
257 View
171 Download

Share

Gmail Facebook X LinkedIn More