A practical and secure coercion-resistant scheme for remote elections

Authors Roberto Araujo, Sébastien Foulle, Jacques Traoré

Thumbnail PDF


  • Filesize: 137 kB
  • 6 pages

Document Identifiers

Author Details

Roberto Araujo
Sébastien Foulle
Jacques Traoré

Cite AsGet BibTex

Roberto Araujo, Sébastien Foulle, and Jacques Traoré. A practical and secure coercion-resistant scheme for remote elections. In Frontiers of Electronic Voting. Dagstuhl Seminar Proceedings, Volume 7311, pp. 1-6, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2008)


Election schemes, coercion-resistance, security 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 efficient for large scale elections. Based on the work of JCJ, Smith proposed an efficient 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).


  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    PDF Downloads