Client/Server Tradeoffs for Online Elections

  • Authors:
  • Ivan Damgård;Mads Jurik

  • Affiliations:
  • -;-

  • Venue:
  • PKC '02 Proceedings of the 5th International Workshop on Practice and Theory in Public Key Cryptosystems: Public Key Cryptography
  • Year:
  • 2002

Quantified Score

Hi-index 0.00

Visualization

Abstract

We present various trade offs for voting schemes which, compared to known solutions, allow voters to do less work at the expense of more work done by the tallying servers running the election. One such scheme produces ballots of essentially minimal size while keeping the work load on the tally servers on a practical level. Another type of trade off leads to a voting scheme that remains secure, even if an adversary can monitor all client machines used by voters to participate. This comes at the price of introducing an additional party who is trusted to carry out registration of voters correctly.