License
when quoting this document, please refer to the following
URN: urn:nbn:de:0030-drops-12951
URL: http://drops.dagstuhl.de/opus/volltexte/2008/1295/

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

A practical and secure coercion-resistant scheme for remote elections

pdf-format:
Dokument 1.pdf (137 KB)


Abstract

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).

BibTeX - Entry

@InProceedings{araujo_et_al:DSP:2008:1295,
  author =	{Roberto Araujo and S{\'e}bastien Foulle and Jacques Traor{\'e}},
  title =	{A practical and secure coercion-resistant scheme for remote elections},
  booktitle =	{Frontiers of Electronic Voting},
  year =	{2008},
  editor =	{David Chaum and Miroslaw Kutylowski and Ronald L. Rivest  and Peter Y. A. Ryan },
  number =	{07311},
  series =	{Dagstuhl Seminar Proceedings},
  ISSN =	{1862-4405},
  publisher =	{Internationales Begegnungs- und Forschungszentrum f{\"u}r Informatik (IBFI), Schloss Dagstuhl, Germany},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2008/1295},
  annote =	{Keywords: }
}

Seminar: 07311 - Frontiers of Electronic Voting
Issue date: 2008
Date of publication: 15.01.2008


DROPS-Home | Fulltext Search | Imprint Published by LZI