[en] Hao, Ryan, and Zieliński (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 proposes 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.
Disciplines :
Sciences informatiques
Identifiants :
UNILU:UL-CONFERENCE-2012-485
Auteur, co-auteur :
KHADER, Dalia ; University of Luxembourg > Interdisciplinary Centre for Security, Reliability and Trust (SNT)
Smyth, Ben
RYAN, Peter ; University of Luxembourg > Faculty of Science, Technology and Communication (FSTC) > Computer Science and Communications Research Unit (CSC)
Hao, Feng
Co-auteurs externes :
yes
Langue du document :
Anglais
Titre :
A Fair and Robust Voting System by Broadcast
Date de publication/diffusion :
2012
Nom de la manifestation :
5th International Conference on Electronic Voting, EVOTE 2012
