How not to prove your election outcome
Thomas Haines, Sarah Jamie Lewis, Olivier Pereira, Vanessa Teague
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.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Your agent calls
Luneget_paper_fulltext
Free to start. No credit card required.
Terminal
Install the CLIlune papers fulltext 3be5f01a-5ec9-4c6c-a70e-078d79eefdceCited by top-tier papers9
- Security Analysis of the Democracy Live Online Voting SystemMichael A. Specter, J. Alex HaldermanUSENIX Security 2021 · 24 citations
- Kryvos: Publicly Tally-Hiding Verifiable E-VotingNicolas Huber, Ralf Küsters, Toomas Krips, Julian Liedtke et al.CCS 2022 · 23 citations
- "Why wouldn't someone think of democracy as a target?": Security practices & challenges of people involved with U.S. political campaignsSunny Consolvo, Patrick Gage Kelley, Tara Matthews, Kurt Thomas et al.USENIX Security 2021 · 15 citations
- Did you mix me? Formally Verifying Verifiable Mix Nets in Electronic VotingThomas Haines, Rajeev Goré, Bhavesh SharmaS&P 2021 · 14 citations
- Rushing at SPDZ: On the Practical Security of Malicious MPC ImplementationsAlexander Kyster, Frederik Huss Nielsen, Sabine Oechsner, Peter SchollS&P 2025
Related papers
- Machine-checking Multi-Round Proofs of Shuffle: Terelius-Wikstrom and Bayer-GrothThomas Haines, Rajeev Goré, Mukesh TiwariUSENIX Security 2023
- Verifying Table-Based ElectionsDavid A. Basin, Jannik Dreier, Sofia Giampietro, Sasa RadomirovicCCS 2021
- Voting: You Can't Have Privacy without Individual VerifiabilityVéronique Cortier, Joseph LallemandCCS 2018 · 36 citations
- Verified Verifiers for Verifying ElectionsThomas Haines, Rajeev Goré, Mukesh TiwariCCS 2019 · 14 citations
- ElectionGuard: a Cryptographic Toolkit to Enable Verifiable ElectionsJosh Benaloh, Michael Naehrig, Olivier Pereira, Dan S. WallachUSENIX Security 2024 · 12 citations
