Computer Science – Cryptography and Security
Scientific paper
2009-03-04
Computer Science
Cryptography and Security
An extended version of a paper from IEEE Symposium on Security and Privacy (S&P) 2009
Scientific paper
Coercion resistance is an important and one of the most intricate security requirements of electronic voting protocols. Several definitions of coercion resistance have been proposed in the literature, including definitions based on symbolic models. However, existing definitions in such models are rather restricted in their scope and quite complex. In this paper, we therefore propose a new definition of coercion resistance in a symbolic setting, based on an epistemic approach. Our definition is relatively simple and intuitive. It allows for a fine-grained formulation of coercion resistance and can be stated independently of a specific, symbolic protocol and adversary model. As a proof of concept, we apply our definition to three voting protocols. In particular, we carry out the first rigorous analysis of the recently proposed Civitas system. We precisely identify those conditions under which this system guarantees coercion resistance or fails to be coercion resistant. We also analyze protocols proposed by Lee et al. and Okamoto.
Kuesters Ralf
Truderung Tomasz
No associations
LandOfFree
An Epistemic Approach to Coercion-Resistance for Electronic Voting Protocols does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with An Epistemic Approach to Coercion-Resistance for Electronic Voting Protocols, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and An Epistemic Approach to Coercion-Resistance for Electronic Voting Protocols will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-369540