Static Validation of a Voting Protocol

Christoffer Rosenkilde Nielsen, Esben Heltoft Andersen, Hanne Riis Nielson

    Research output: Chapter in Book/Report/Conference proceedingArticle in proceedingsResearchpeer-review

    Abstract

    The desired security properties of electronic voting protocols include verifiability, accuracy, democracy and fairness. In this paper we use a static program analysis tool to validate these properties for one of the classical voting protocols under appropriate assumptions. The protocol is formalised in an extension of the LySa process calculus with blinding signatures. The analysis, which is fully automatic, pinpoints previously undiscovered flaws related to verifiability and accuracy and we suggest modifications of the protocol needed for validating these properties.
    Original languageEnglish
    Title of host publicationAutomated Reasoning for Security Protocol Analysis (ARSPA 2005)
    PublisherElsevier
    Publication date2005
    Pages115-134
    Publication statusPublished - 2005

    Cite this

    Nielsen, C. R., Andersen, E. H., & Nielson, H. R. (2005). Static Validation of a Voting Protocol. In Automated Reasoning for Security Protocol Analysis (ARSPA 2005) (pp. 115-134). Elsevier. http://dx.doi.org/10.1016/j.entcs.2005.06.001