A new approach towards coercion-resistant remote e-voting in linear time

  • Authors:
  • Oliver Spycher;Reto Koenig;Rolf Haenni;Michael Schläpfer

  • Affiliations:
  • University of Fribourg, Fribourg, Switzerland;University of Fribourg, Fribourg, Switzerland;Bern University of Applied Sciences, Biel, Switzerland;ETH Zurich, Zurich, Switzerland

  • Venue:
  • FC'11 Proceedings of the 15th international conference on Financial Cryptography and Data Security
  • Year:
  • 2011

Quantified Score

Hi-index 0.00

Visualization

Abstract

Remote electronic voting has attracted increasing attention in cryptographic research. A promising protocol presented by Juels et al. is currently widely discussed. Although it offers a remarkably high degree of coercion-resistance under reasonable assumptions, it can not be employed in practice due to its poor efficiency. The improvements that have been proposed either require stronger trust assumptions or turned out to be insecure. In this paper, we present an enhancement of the protocol, which runs in linear time without changing the underlying trust assumptions.