Back to ProVerif
Vincent Cheval, VĂ©ronique Cortier, and Alexandre Debant. Election Verifiability with ProVerif. In Proceedings of the 36th IEEE Computer Security Foundations Symposium (CSF'23), pages 43-58, Dubrovnik, Croatia, July 2023. IEEE. Case study

Get the paper

.pdf, 461 Kb


Electronic voting systems should guarantee (at least) vote privacy and verifiability. Formally proving these two properties is challenging. Indeed, vote privacy is typically expressed as an equivalence property, hard to analyze for automatic tools, while verifiability requires to count the number of votes, to guarantee that all honest votes are properly tallied. We provide a full characterization of E2E-verifiability in terms of two simple properties, that are shown to be both sufficient and necessary. In contrast, previous approaches proposed sufficient conditions only. These two properties can easily be expressed in a formal tool like ProVerif but remain hard to prove automatically. Therefore, we provide a generic election framework, together with a library of lemmas, for the (automatic) proof of E2E-verifiability. We successfully apply our framework to several protocols of the literature that include two complex, industrial-scale voting protocols, namely Swiss Post and CHVote, designed for the Swiss context.


  AUTHOR = {Cheval, Vincent and Cortier, V{\'e}ronique and Debant, Alexandre},
  TITLE = {Election Verifiability with {P}ro{V}erif},
  BOOKTITLE = {{P}roceedings of the 36th {IEEE} {C}omputer {S}ecurity {F}oundations {S}ymposium ({CSF}'23)},
  YEAR = {2023},
  ADDRESS = {Dubrovnik, Croatia},
  PAGES = {43--58},