Did you mix me? Formally verifying verifiable mix nets in electronic voting

Thomas Haines*, Rajeev Gore, Bhavesh Sharma

*Corresponding author for this work

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

    14 Citations (Scopus)

    Abstract

    Verifiable mix nets, and specifically proofs of (correct) shuffle, are a fundamental building block in numerous applications: these zero-knowledge proofs allow the prover to produce a public transcript which can be perused by the verifier to confirm the purported shuffle. They are particularly vital to verifiable electronic voting, where they underpin almost all voting schemes with non-trivial tallying methods. These complicated pieces of cryptography are a prime location for critical errors which might allow undetected modification of the outcome.The best solution to preventing these errors is to machine-check the cryptographic properties of the design and implementation of the mix net. Particularly crucial for the integrity of the outcome is the soundness of the design and implementation of the verifier (software). Unfortunately, several different encryption schemes are used in many different slight variations which makes it infeasible to machine-check every single case individually. However, a particular optimised variant of the Terelius-Wikström mix net is, and has been, widely deployed in elections including national elections in Norway, Estonia and Switzerland, albeit with many slight variations and several different encryption schemes.In this work, we develop the logical theory and formal methods tools to machine-check the design and implementation of all these variants of Terelius-Wikström mix nets, for all the different encryption schemes used; resulting in provably correct mix nets for all these different variations. We do this carefully to ensure that we can extract a formally verified implementation of the verifier (software) which is compatible with existing deployed implementations of the Terelius-Wikström mix net. This gives us provably correct implementations of the verifiers for more than half of the national elections which have used verifiable mix nets.Our implementation of a proof of correct shuffle is the first to be machine-checked to be cryptographically correct and able to verify proof transcripts from national elections. We demonstrate the practicality of our implementation by verifying transcripts produced by the Verificatum mix net system and the CHVote e-voting system from Switzerland.

    Original languageEnglish
    Title of host publicationProceedings - 2021 IEEE Symposium on Security and Privacy, SP 2021
    PublisherInstitute of Electrical and Electronics Engineers Inc.
    Pages1748-1765
    Number of pages18
    ISBN (Electronic)9781728189345
    DOIs
    Publication statusPublished - May 2021
    Event42nd IEEE Symposium on Security and Privacy, SP 2021 - Virtual, San Francisco, United States
    Duration: 24 May 202127 May 2021

    Publication series

    NameProceedings - IEEE Symposium on Security and Privacy
    Volume2021-May
    ISSN (Print)1081-6011

    Conference

    Conference42nd IEEE Symposium on Security and Privacy, SP 2021
    Country/TerritoryUnited States
    CityVirtual, San Francisco
    Period24/05/2127/05/21

    Fingerprint

    Dive into the research topics of 'Did you mix me? Formally verifying verifiable mix nets in electronic voting'. Together they form a unique fingerprint.

    Cite this