Pretty good democracy for more expressive voting schemes

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.

Preview	Text (licence) SRI_deposit_agreement.pdf Download (33kB)
	Text (deleted) fulltext.pdf Restricted to Repository staff only Available under License : See the attached licence file. Download (257kB)
Preview	Text PGD4STV-final.pdf Available under License : See the attached licence file. Download (171kB)

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 (Conference Paper)
Divisions :	Faculty of Engineering and Physical Sciences > Computing Science
Authors :	Name Email ORCID Heather, J Ryan, PYA Teague, V
Date :	2010
DOI :	10.1007/978-3-642-15497-3_25
Contributors :	Contribution Name Email ORCID http://www.loc.gov/loc.terms/relators/PBL Springer,
Additional Information :	The original publication is available at http://www.springerlink.com
Depositing User :	Symplectic Elements
Date Deposited :	07 Dec 2012 09:39
Last Modified :	31 Oct 2017 14:54
URI:	http://epubs.surrey.ac.uk/id/eprint/107388

Actions (login required)

View Item

Downloads