key: 2010-towards-verifiability-definition-for-electronic-voting
type: inproceedings
title: Towards automatic analysis of election verifiability properties
authors:
  - Ben Smyth
  - Mark D. Ryan
  - Steve Kremer
  - Mounira Kourjieh
year: 2010
month: 3
booktitle: >-
  ARSPA-WITS'10: Joint Workshop on Automated Reasoning for Security Protocol Analysis and Issues in
  the Theory of Security
series: LNCS
volume: "6186"
pages: 165--182
publisher: Springer
doi: 10.1007/978-3-642-16074-5_11
description: >-
  This paper presents a symbolic definition of election verifiability for electronic voting
  protocols which is amenable to automated reasoning using ProVerif.
keywords: >-
  electronic voting, e-voting, election verifiability, individual verifiability, universal
  verifiability, eligibility verifiability, end-to-end verifiability, automated reasoning, applied
  pi calculus, FOO, JCJ, Civitas
abstract: >-
  We present a symbolic definition that captures some cases of election verifiability for electronic
  voting protocols. Our definition is given in terms of reachability assertions in the applied pi
  calculus and is amenable to automated reasoning using the software tool ProVerif. The definition
  distinguishes three aspects of verifiability, which we call individual, universal, and eligibility
  verifiability. We demonstrate the applicability of our formalism by analysing the protocols due to
  Fujioka, Okamoto & Ohta and a variant of the one by Juels, Catalano & Jakobsson
  (implemented as Civitas by Clarkson, Chong & Myers).
supersededby:
  - key: 2010-verifiability-definition-for-electronic-voting
    text: ESORICS paper
links:
  - file: Smyth10-towards-definition-verifiability.pdf
    text: Conference paper
  - file: Smyth10-towards-definition-verifiability.code.tar.gz
    text: ProVerif source
  - file: Smyth09-towards-definition-verifiability.pdf
    text: WISSec'09 version
  - file: Smyth09-towards-definition-verifiability.code.tar.gz
    text: WISSec'09 ProVerif source
  - url: https://doi.org/10.1007/978-3-642-16074-5_11
    text: Official version