Not-So Hidden Information

  • Authors:
  • Jeremy Clark;Urs Hengartner;Kate Larson

  • Affiliations:
  • Cheriton School of Computer Science, University of Waterloo, Waterloo, Canada N2L 3G1;Cheriton School of Computer Science, University of Waterloo, Waterloo, Canada N2L 3G1;Cheriton School of Computer Science, University of Waterloo, Waterloo, Canada N2L 3G1

  • Venue:
  • VOTE-ID '09 Proceedings of the 2nd International Conference on E-Voting and Identity
  • Year:
  • 2009

Quantified Score

Hi-index 0.00

Visualization

Abstract

This paper considers coercion contracts in voting systems with end-to-end (E2E) verifiability. Contracts are a set of instructions that an adversary can dictate to a voter, either through duress or by offering payment, that increase the probability of a compliant voter constructing a vote for the adversary's preferred candidate. Using a representative E2E system, we place the attacks in game-theoretic terms and study the effectiveness of three proposed contracts from the literature. We offer a definition of optimality for contracts, provide an algorithm for generating optimal contracts, and show that as the number of candidates increases, the adversary's advantage through the use of contracts decreases. We also consider the use of contracts in a heterogeneous population of voters and for financially constrained adversaries.