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 Pi-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.
Type de document :
Rapport
[Research Report] VERIMAG. 2012
Liste complète des métadonnées

Littérature citée [29 références]  Voir  Masquer  Télécharger

https://hal.archives-ouvertes.fr/hal-01338039
Contributeur : Jannik Dreier <>
Soumis le : mercredi 29 juin 2016 - 10:57:52
Dernière modification le : vendredi 6 juillet 2018 - 15:06:10
Document(s) archivé(s) le : vendredi 30 septembre 2016 - 10:45:41

Fichier

TR-2012-2.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

  • HAL Id : hal-01338039, version 1

Citation

Jannik Dreier, Pascal Lafourcade, Yassine Lakhnech. Defining Privacy for Weighted Votes, Single and Multi-voter Coercion. [Research Report] VERIMAG. 2012. 〈hal-01338039〉

Partager

Métriques

Consultations de la notice

770

Téléchargements de fichiers

84