Towards Trustworthy Elections

Volume 6000 of the series Lecture Notes in Computer Science pp 330-342

A Practical and Secure Coercion-Resistant Scheme for Internet Voting

(Extended Abstract)
  • Roberto AraújoAffiliated withTU-Darmstadt
  • , Sébastien FoulleAffiliated withOrange Labs
  • , Jacques TraoréAffiliated withOrange Labs

* Final gross prices may vary according to local VAT.

Get Access


Juels, Catalano, and Jakobsson (JCJ) proposed at WPES 2005 the first voting scheme that considers real-world threats and that is more realistic for Internet elections. Their scheme, though, has a quadratic work factor and thereby is not efficient for large scale elections. Based on the work of JCJ, Smith proposed an efficient scheme that has a linear work factor. In this paper we first show that Smith’s scheme is insecure. Then we present a new coercion-resistant election scheme with a linear work factor that overcomes the flaw of Smith’s proposal. Our solution is based on the group signature scheme of Camenisch and Lysyanskaya (Crypto 2004).