Is the JCJ voting system really coercion-resistant?

Véronique Cortier (1) , Pierrick Gaudry (2) , Quentin Yang (2)

1 PESTO - Proof techniques for security protocols
2 CARAMBA - Cryptology, arithmetic : algebraic methods for better algorithms

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, Catalon 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 coercionresistance was too weak. We therefore propose a definition that can take into accounts more behaviors such as revoting or the addition of fake ballots by authorities. We then prove that CHide is coercion-resistant for this definition, and that JCJ is coercionresistant for a slightly weakened version of our definition, that models the leakage of information in JCJ.

Mots clés: E-voting; coercion-resistance; JCJ protocol

Domaines: Cryptographie et sécurité [cs.CR]

Véronique Cortier, Pierrick Gaudry, Quentin Yang. Is the JCJ voting system really coercion-resistant?. 2022. ⟨hal-03629587v1⟩