Skip navigation
Skip navigation
The system will be down for maintenance between 8:00 and 8:15am on Thursday 13, December 2018

Vote Counting as Mathematical Proof

Pattinson, Dirk; Schurmann, Carsten


Trust in the correctness of an election outcome requires proof of the correctness of vote counting. By formalising particular voting protocols as rules, correctness of vote counting amounts to verifying that all rules have been applied correctly. A proof of the outcome of any particular election then consists of a sequence (or tree) of rule applications and provides an independently checkable certificate of the validity of the result. This reduces the need to trust, or otherwise verify, the...[Show more]

CollectionsANU Research Publications
Date published: 2015
Type: Journal article
Source: Lecture Notes in Computer Science (LNCS)
DOI: 10.1007/978-3-319-26350-2_41


File Description SizeFormat Image
01_Pattinson_Vote_Counting_as_Mathematical_2015.pdf716.43 kBAdobe PDF    Request a copy

Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.

Updated:  27 November 2018/ Responsible Officer:  University Librarian/ Page Contact:  Library Systems & Web Coordinator