Litcius/Paper detail

How not to prove your election outcome

Thomas Haines, Sarah Jamie Lewis, Olivier Pereira, Vanessa Teague

202046 citationsDOIOpen Access PDF

Abstract

The Scytl/SwissPost e-voting solution was intended to provide complete verifiability for Swiss government elections. We show failures in both individual verifiability and universal verifiability (as defined in Swiss Federal Ordinance 161.116), based on mistaken implementations of cryptographic components. These failures allow for the construction of "proofs" of an accurate election outcome that pass verification though the votes have been manipulated. Using sophisticated cryptographic protocols without a proper consideration of what properties they offer, and under which conditions, can introduce opportunities for undetectable fraud even though the system appears to allow verification of the outcome.Our findings are immediately relevant to systems in use in Switzerland and Australia, and probably also elsewhere.

Topics & Concepts

Outcome (game theory)Mathematical proofComputer scienceImplementationVotingComputer securityCryptographyGovernment (linguistics)Cryptographic protocolElectronic votingTheoretical computer sciencePolitical scienceProgramming languageMathematicsLawMathematical economicsGeometryLinguisticsPoliticsPhilosophyCryptography and Data SecurityInternet Traffic Analysis and Secure E-votingCryptographic Implementations and Security