A practical and secure coercion-resistant scheme for remote elections (Extended Abstract)
Roberto Samarone Araujo, Sébastien Foulle, Jacques Traoré · 2008
Juels, Catalano, and Jakobsson (JCJ) proposed at WPES 2005 the first scheme that considers real-world threats and that is more realistic for remote elections. Their scheme, though, has quadratic work factor and thereby is not ecient for large scale elections. Based on the work of JCJ, Smith proposed an ecient scheme that has linear work factor. In this paper we first show that the Smith's scheme is insecure. Then we present a new coercion-resistant election scheme with linear work factor that overcomes this and other flaws of the Smith's proposal. Our solution is based on the group signature scheme of Camenisch and Lysyanskaya (Crypto 2004).