HAL will be down for maintenance from Friday, June 10 at 4pm through Monday, June 13 at 9am. More information
Skip to Main content Skip to Navigation
Conference papers

Defining Privacy for Weighted Votes, Single and Multi-voter Coercion

Jannik Dreier 1 Pascal Lafourcade 2 Yassine Lakhnech 3
1 CASSIS - Combination of approaches to the security of infinite states systems
FEMTO-ST - Franche-Comté Électronique Mécanique, Thermique et Optique - Sciences et Technologies (UMR 6174), Inria Nancy - Grand Est, LORIA - FM - Department of Formal Methods
Abstract : Most existing formal privacy definitions for voting protocols are based on observational equivalence between two situations where two voters swap their votes. These definitions are unsuitable for cases where votes are weighted. In such a case swapping two votes can result in a different outcome and both situations become trivially distinguishable. We present a definition for privacy in voting protocols in the Applied π-Calculus that addresses this problem. Using our model, we are also able to define multi-voter coercion, i.e. situations where several voters are attacked at the same time. Then we prove that under certain realistic assumptions a protocol secure against coercion of a single voter is also secure against coercion of multiple voters. This applies for Receipt-Freeness as well as Coercion-Resistance.
Document type :
Conference papers
Complete list of metadata

Cited literature [26 references]  Display  Hide  Download

Contributor : Jannik Dreier Connect in order to contact the contributor
Submitted on : Monday, June 27, 2016 - 5:07:56 PM
Last modification on : Friday, January 21, 2022 - 3:09:02 AM


Files produced by the author(s)



Jannik Dreier, Pascal Lafourcade, Yassine Lakhnech. Defining Privacy for Weighted Votes, Single and Multi-voter Coercion. European Symposium on Research in Computer Security (ESORICS), Sep 2012, Pise, Italy. ⟨10.1007/978-3-642-33167-1_26⟩. ⟨hal-01338037⟩



Record views


Files downloads