Pretty good democracy for more expressive voting schemes
Tools
Tools
Tools
Heather, J, Ryan, PYA and Teague, V (2010) Pretty good democracy for more expressive voting schemes In: 15th European Symposium on Research in Computer Security, 2010-09-20 - 2010-09-22, Athens, Greece.
![[img]](/style/images/fileicons/application_pdf.png)
| PDF (licence) 32Kb | |
| PDF (deleted) Restricted to Repository staff only Available under License : See the attached licence file. 251Kb | |
| PDF Available under License : See the attached licence file. 167Kb |
Official URL: http://dx.doi.org/10.1007/978-3-642-15497-3_25
Abstract
In this paper we revisit Pretty Good Democracy, a scheme for verifiable Internet voting from untrusted client machines. The original scheme was designed for first-past-the-post elections. Here, we show how Pretty Good Democracy can be extended to voting schemes in which the voter lists the candidates in their order of preference. Our scheme applies to elections using STV, IRV, Borda, or any other tallying scheme in which a vote is a list of candidates in preference order. We also describe an extension to cover Approval or Range voting.
| Item Type: | Conference or Workshop Item (Paper) |
|---|---|
| Additional Information: | The original publication is available at http://www.springerlink.com |
| Divisions: | Faculty of Engineering and Physical Sciences > Computing Science |
| ID Code: | 107388 |
| Deposited By: | Symplectic Elements |
| Deposited On: | 07 Dec 2012 09:39 |
| Last Modified: | 11 May 2013 14:39 |
Document Downloads
Repository Staff Only: item control page