• DocumentCode
    3070318
  • Title

    Gaining Assurance in a Voter-Verifiable Voting System

  • Author

    Alberdi, Eugenio ; Strigini, Lorenzo ; Leach, Kieran ; Ryan, Peter ; Palanque, Philippe ; Winckler, Marco

  • Author_Institution
    Centre for Software Reliability, City Univ. London, London, UK
  • fYear
    2009
  • fDate
    18-23 June 2009
  • Firstpage
    99
  • Lastpage
    104
  • Abstract
    The literature on e-voting systems has many examples of discussion of the correctness of the computer and communication algorithms of such systems, as well as discussions of their vulnerabilities. However, a gap in the literature concerns the practical need (before adoption of a specific e-voting system) for a complete case demonstrating that the system as a whole has sufficiently high probability of exhibiting the desired properties when in use in an actual election. This paper discusses the problem of producing such a case, with reference to a specific system: a version of the Pret a voter scheme for voter-verifiable e-voting. We show a possible organisation of a case in terms of four main requirements - accuracy, privacy, termination and `trustedness´- and show some of the detailed organisation that such a case should have, the diverse kinds of evidence that needs to be gathered and some of the interesting difficulties that arise.
  • Keywords
    cryptography; data privacy; government data processing; program verification; cryptography; data privacy; e-voting system assurance; election; probability; software verification; voter-verifiable voting system; Electronic voting; Electronic voting systems; Humans; Large-scale systems; Nominations and elections; Privacy; Safety; Sociotechnical systems; Software algorithms; Strips; assurance case; crypotography; e-voting; security; socio-technical systems; trust;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Dependability, 2009. DEPEND '09. Second International Conference on
  • Conference_Location
    Athens, Glyfada
  • Print_ISBN
    978-0-7695-3666-8
  • Type

    conf

  • DOI
    10.1109/DEPEND.2009.21
  • Filename
    5211081