Paper published in a journal (Scientific congresses, symposiums and conference proceedings)
A Fair and Robust Voting System by Broadcast
Khader, Dalia; Smyth, Ben; Ryan, Peter et al.
2012In Lecture Notes in Informatics, p. 285-299
Peer reviewed
 

Files


Full Text
A Fair and Robust Voting.pdf
Publisher postprint (337.03 kB)
Download

All documents in ORBilu are protected by a user license.

Send to



Details



Keywords :
Ballot secrecy; decentralised electronic voting; dispute-free; fairness; OpenVote; privacy; robustness; self-tallying
Abstract :
[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 :
Computer science
Identifiers :
UNILU:UL-CONFERENCE-2012-485
Author, co-author :
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
External co-authors :
yes
Language :
English
Title :
A Fair and Robust Voting System by Broadcast
Publication date :
2012
Event name :
5th International Conference on Electronic Voting, EVOTE 2012
Event place :
Bregenz, Austria
Event date :
11 July 2012 through 14 July 2012
Audience :
International
Journal title :
Lecture Notes in Informatics
ISSN :
1617-5468
Publisher :
Gesellschaft fur Informatik (GI)
Pages :
285-299
Peer reviewed :
Peer reviewed
Available on ORBilu :
since 10 March 2016

Statistics


Number of views
476 (8 by Unilu)
Number of downloads
295 (4 by Unilu)

Scopus citations®
 
37
Scopus citations®
without self-citations
30

Bibliography


Similar publications



Contact ORBilu