A practical and secure coercion-resistant scheme for remote elections.
R. Araujo, S. Foulle, and J. Traoré. Frontiers of Electronic Voting, volume 07311 of Dagstuhl Seminar Proceedings, Dagstuhl, Internationales Begegnungs- und Forschungszentrum fuer Informatik (IBFI), Schloss Dagstuhl, Germany, (2007)
Abstract
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).
%0 Conference Paper
%1 conf/dagstuhl/AraujoFT07
%A Araujo, Roberto
%A Foulle, Sébastien
%A Traoré, Jacques
%B Frontiers of Electronic Voting
%C Dagstuhl
%D 2007
%E Chaum, David
%E Kutylowski, Miroslaw
%E Rivest, Ronald L.
%E Ryan, Peter Y. A.
%I Internationales Begegnungs- und Forschungszentrum fuer Informatik (IBFI), Schloss Dagstuhl, Germany
%K 2007 credential elections privacy
%T A practical and secure coercion-resistant scheme for remote elections.
%U http://dblp.uni-trier.de/db/conf/dagstuhl/P7311.html#AraujoFT07
%V 07311
%X 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).
@inproceedings{conf/dagstuhl/AraujoFT07,
abstract = {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).},
added-at = {2010-03-01T15:09:47.000+0100},
address = {Dagstuhl},
author = {Araujo, Roberto and Foulle, Sébastien and Traoré, Jacques},
biburl = {https://www.bibsonomy.org/bibtex/235cf022a8a391a25177dab5c72fc132b/trude},
booktitle = {Frontiers of Electronic Voting},
date = {2008-05-15},
editor = {Chaum, David and Kutylowski, Miroslaw and Rivest, Ronald L. and Ryan, Peter Y. A.},
ee = {http://drops.dagstuhl.de/opus/volltexte/2008/1295},
interhash = {b6356b375e8b57d8fa5191959db123f7},
intrahash = {35cf022a8a391a25177dab5c72fc132b},
issn = {1862-4405},
keywords = {2007 credential elections privacy},
publisher = {Internationales Begegnungs- und Forschungszentrum fuer Informatik (IBFI), Schloss Dagstuhl, Germany},
series = {Dagstuhl Seminar Proceedings},
timestamp = {2010-03-01T15:09:47.000+0100},
title = {A practical and secure coercion-resistant scheme for remote elections.},
url = {http://dblp.uni-trier.de/db/conf/dagstuhl/P7311.html#AraujoFT07},
volume = 07311,
year = 2007
}