Toggle Main Menu Toggle Search

Open Access padlockePrints

A Practical, Voter-verifiable Election Scheme

Lookup NU author(s): Professor Peter Ryan


Full text for this publication is not currently held within this repository. Alternative links are provided below where available.

Publication metadata

Author(s): Chaum D, Ryan PYA, Schneider SA

Editor(s): De Capitani di Vimercati, S., Syverson, P., Gollmann, D.

Publication type: Conference Proceedings (inc. Abstract)

Publication status: Published

Conference Name: Computer Security: 10th European Symposium on Research in Computer Security (ESORICS)

Year of Conference: 2005

Pages: 118-139

ISSN: 0302-9743 (Print) 1611-3349 (Online)

Publisher: Springer


DOI: 10.1007/11555827_8

Notes: This paper is an elaboration of an earlier paper by Ryan (NCL-CS-TR 864 and WITS'05) that proposed a significant enhancement and simplification of an earlier, voter-verifiable scheme of David Chaum. The key idea is to encode the vote in a randomised frame of reference, i,e., a randomised candidate list. This results in a very simple and familiar voter-interface and is conceptually and technologically much simpler than previous approaches. It also has some subtle technical advantages over previous schemes in that, for example, this method of encoding means that there is no need for the voter's choice to be communicated to an encryption device. This neatly eliminates side-channel and subliminal channels threats. The approach, dubbed "Pret a Voter", is now widely recognised as one of the leading, software independent, verifiable election schemes.

Library holdings: Search Newcastle University Library for this item

Series Title: Lecture Notes in Computer Science

ISBN: 9783540289630