Coercion-Resistance and Receipt-Freeness in Electronic Voting
- 3 August 2006
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 10636900,p. 28-42
- https://doi.org/10.1109/csfw.2006.8
Abstract
In this paper we formally study important properties of electronic voting protocols. In particular we are interested in coercion-resistance and receipt-freeness. Intuitively, an election protocol is coercion-resistant if a voter A cannot prove to a potential coercer C that she voted in a particular way. We assume that A cooperates with C in an interactive fashion. Receipt-freeness is a weaker property, for which we assume that A and C cannot interact during the protocol: to break receipt-freeness, A later provides evidence (the receipt) of how she voted. While receipt-freeness can be expressed using observational equivalence from the applied pi calculus, we need to introduce a new relation to capture coercion-resistance. Our formalization of coercion-resistance and receipt-freeness are quite different. Nevertheless, we show in accordance with intuition that coercion-resistance implies receipt-freeness, which implies privacy, the basic anonymity property of voting protocols, as defined in previous work. Finally we illustrate the definitions on a simplified version of the Lee et al. voting protocolKeywords
This publication has 5 references indexed in Scilit:
- Coercion-resistant electronic electionsPublished by Association for Computing Machinery (ACM) ,2005
- Mobile values, new names, and secure communicationPublished by Association for Computing Machinery (ACM) ,2001
- An electronic voting schemePublished by Springer Nature ,1996
- Receipt-free secret-ballot elections (extended abstract)Published by Association for Computing Machinery (ACM) ,1994
- Elections with Unconditionally-Secret Ballots and Disruption Equivalent to Breaking RSAPublished by Springer Nature ,1988