key: 2012-decentralised-voting-system
type: inproceedings
title: A Fair and Robust Voting System by Broadcast
authors:
  - Dalia Khader
  - Ben Smyth
  - Peter Y. A. Ryan
  - Feng Hao
year: 2012
month: 7
booktitle: "EVOTE'12: 5th International Conference on Electronic Voting"
series: Lecture Notes in Informatics
volume: "205"
pages: 285-299
publisher: Gesellschaft für Informatik
description: >-
  This paper presents a variant of the OpenVote e-voting scheme that provides fairness and
  robustness in addition to perfect ballot secrecy and self-tallying.
keywords: >-
  Electronic voting, fairness, robustness, fair, robust, self-tallying, ballot secrecy, privacy,
  end-to-end verifiability, verifiability, decentralised, OpenVote
abstract: >-
  Hao, Ryan & Zielinski (2010) propose a two-round decentralized voting protocol that is
  efficient in terms of rounds, computation, and bandwidth. However, the protocol has two drawbacks.
  First, if some voters abort then the election result cannot be announced, that is, the protocol is
  not robust. Secondly, the last voter can learn the election result before voting, that is, the
  protocol is not fair. Both drawbacks are typical of other decentralized e-voting protocols. This
  paper addresses these issues: we propose a recovery round to enable the election result to be
  announced if voters abort and we add a commitment round to ensure fairness. In addition, we
  provide a computational security proof of ballot secrecy.
links:
  - file: Smyth12-decentralised-voting-system.pdf
    text: Conference paper