Vote Counting as Mathematical Proof
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]
|Collections||ANU Research Publications|
|Source:||Lecture Notes in Computer Science (LNCS)|
|01_Pattinson_Vote_Counting_as_Mathematical_2015.pdf||716.43 kB||Adobe PDF||Request a copy|
Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.