On the specification and verification of voting schemes

Bernhard Beckert, Rajeev Goré, Carsten Schürmann

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

    1 Citation (Scopus)

    Abstract

    The ability to count ballots by computers allows us to design new voting schemes that are arguably fairer than existing schemes designed for hand-counting. We argue that formal methods can and should be used to ensure that such schemes behave as intended and are conform to the desired democratic properties. Specifically, we define two semantic criteria for single transferable vote (STV) schemes, formulated in first-order logic, and show how bounded model-checking can be used to test whether these criteria are met. As a case study, we then analyse an existing voting scheme for electing the board of trustees for a major international conference and discuss its deficiencies.

    Original languageEnglish
    Title of host publicationE-Voting and Identity - 4th International Conference, Vote-ID 2013, Proceedings
    Pages25-40
    Number of pages16
    DOIs
    Publication statusPublished - 2013
    Event4th International Conference on E-Voting and Identity, Vote-ID 2013 - Guildford, United Kingdom
    Duration: 17 Jul 201319 Jul 2013

    Publication series

    NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
    Volume7985 LNCS
    ISSN (Print)0302-9743
    ISSN (Electronic)1611-3349

    Conference

    Conference4th International Conference on E-Voting and Identity, Vote-ID 2013
    Country/TerritoryUnited Kingdom
    CityGuildford
    Period17/07/1319/07/13

    Fingerprint

    Dive into the research topics of 'On the specification and verification of voting schemes'. Together they form a unique fingerprint.

    Cite this