Auflistung nach Autor:in "Ryan, Peter Y. A."
1 - 3 von 3
Treffer pro Seite
Sortieroptionen
- KonferenzbeitragA supervised verifiable voting protocol for the victorian electoral commission(5th International Conference on Electronic Voting 2012 (EVOTE2012), 2012) Burton, Craig; Culane, Chris; Heather, James; Peacock, Thea; Ryan, Peter Y. A.; Schneider, Steve; Srinivasan, Sriramkrishnan; Teague, Vanessa; Wen, Roland; Xia, ZheThis paper describes the design of a supervised, verifiable voting protocol suitable for use for elections in the state of Victoria, Australia. We provide a brief overview of the style and nature of the elections held in Victoria and associated challenges. Our protocol, based on Prêt à Voter, presents a new ballot overprinting front-end design, which assists the voter in completing the potentially complex ballot. We also present and analyze a series of modifications to the backend that will enable it to handle the large number of candidates, 35 +, with ranking single transferable vote (STV), which some Victorian elections require. We conclude with a threat analysis of the scheme and a discussion on the impact of the modifications on the integrity and privacy assumptions of Prêt à Voter.
- KonferenzbeitragA fair and robust voting system by broadcast(5th International Conference on Electronic Voting 2012 (EVOTE2012), 2012) Khader, Dalia; Smyth, Ben; Ryan, Peter Y. A.; Hao, FengHao, 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.
- KonferenzbeitragImproving the Farnel Voting Scheme(Electronic Voting 2008 (EVOTE08). 3rd International Conference on Electronic Voting 2008, Co-organized by Council of Europe, Gesellschaft für Informatik and EVoting.CC, 2008) Araújo, Roberto; Ryan, Peter Y. A.Farnel is a voting scheme which first introduced the concept of a ballot box to exchange votes. Recently, Araújo et al. improved this concept to accomplish a voter-verifiable scheme in which voters receive copies of receipts of one or more randomly selected previous cast votes. The scheme, however, relies on a strong requisite to achieve security: trustworthy talliers. With the goal of removing this requisite, in this paper we propose a Prêt-à-Voter style receipt for this scheme. In addition, we present a novel way to initialize the Farnel box and a new scheme based on combining Farnel with Prêt-à-Voter style encoding of receipts.