Reference : A Fair and Robust Voting System by Broadcast
Scientific congresses, symposiums and conference proceedings : Paper published in a journal
Engineering, computing & technology : Computer science
http://hdl.handle.net/10993/25419
A Fair and Robust Voting System by Broadcast
English
Khader, Dalia [University of Luxembourg > Interdisciplinary Centre for Security, Reliability and Trust (SNT) > >]
Smyth, Ben [> >]
Ryan, Peter mailto [University of Luxembourg > Faculty of Science, Technology and Communication (FSTC) > Computer Science and Communications Research Unit (CSC) >]
Hao, Feng [> >]
2012
Lecture Notes in Informatics (LNI), Proceedings - Series of the Gesellschaft fur Informatik (GI)
Gesellschaft fur Informatik (GI)
285-299
Yes
International
16175468
5th International Conference on Electronic Voting, EVOTE 2012
11 July 2012 through 14 July 2012
Bregenz
Austria
[en] Ballot secrecy ; decentralised electronic voting ; dispute-free ; fairness ; OpenVote ; privacy ; robustness ; self-tallying
[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.
http://hdl.handle.net/10993/25419

File(s) associated to this reference

Fulltext file(s):

FileCommentaryVersionSizeAccess
Open access
A Fair and Robust Voting.pdfPublisher postprint329.13 kBView/Open

Bookmark and Share SFX Query

All documents in ORBilu are protected by a user license.