2026-07-22T19:10:14Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:1295 2024-03-06T11:07:38Z ddc:004 open_access

A practical and secure coercion-resistant scheme for remote elections Araujo, Roberto Foulle, Sébastien Traoré, Jacques 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). Schloss Dagstuhl – Leibniz-Zentrum für Informatik Roberto Araujo and Sébastien Foulle and Jacques Traoré 2008 Is Part Of Dagstuhl Seminar Proceedings, Volume 7311, Frontiers of Electronic Voting (2008) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/DagSemProc.07311.3 urn:nbn:de:0030-drops-12951 https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.07311.3 eng https://creativecommons.org/licenses/by/4.0/legalcode