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). © 2010 Springer-Verlag.
CITATION STYLE
Araújo, R., Foulle, S., & Traoré, J. (2010). A practical and secure coercion-resistant scheme for internet voting (extended abstract). In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6000 LNCS, pp. 330–342). https://doi.org/10.1007/978-3-642-12980-3_20
Mendeley helps you to discover research relevant for your work.