Publications

Verified Verifiers for Verifying Elections

Published in ACM SIGSAC Conference on Computer and Communications Security - 2019, 2019

The security and trustworthiness of elections is critical to democracy; alas, securing elections is notoriously hard. Powerful cryptographic techniques for verifying the integrity of electronic voting have been developed and are in increasingly common use.

Download here

Verifiable Homomorphic Tallying for the Schulze Vote Counting Scheme

Published in Conference on Verified Software: Theories, Tools, and Experiments - 2019, 2019

The encryption of ballots is crucial to maintaining integrity and anonymity in electronic voting schemes. It enables, amongst other things, each voter to verify that their encrypted ballot has been recorded as cast, by checking their ballot against a bulletin board.

Download here

Modular formalisation and verification of STV algorithms

Published in International Joint Conference on Electronic Voting - 2018, 2018

TWe introduce a formal, modular framework that captures a large number of different instances of the Single Transferable Vote (STV) counting scheme in a uniform way.

Download here

Schulze voting as evidence carrying computation

Published in International Conference on Interactive Theorem Proving - 2017, 2017

The correctness of vote counting in electronic election is one of the main pillars that engenders trust in electronic elections.

Download here