@COMMENT This file was generated by bib2html.pl <https://sourceforge.net/projects/bib2html/> version 0.94
@COMMENT written by Patrick Riley <http://sourceforge.net/users/patstg/>
@inproceedings{privacy-framework-CSF26,
  TITLE = {{Simultaneously Proving Privacy and Verifiability: A ProVerif Framework for Internet Voting}},
  AUTHOR = {Cheval, Vincent and Cortier, Veronique and Debant, Alexandre and Moser, Florian},
  BOOKTITLE = {{CSF 2026 -- 39th IEEE Computer Security Foundations Symposium}},
  ADDRESS = {Lisbon, Portugal},
  YEAR = {2026},
  abstract = {Electronic voting aims to guarantee the same security properties than
traditional paper-based voting, namely vote privacy and verifiability.
While the formal verification of security protocols is now a mature
field with several powerful tools such as ProVerif or Tamarin,
verifying voting protocols still pushes existing tools at their
limits.
\par
We present in this work a proof framework for ProVerif that  models an extensible
election setting with an unbounded number of concurrent elections,
voters and votes. We also develop a library of lemmas to aid the
automatic verification.
Crucially, the framework
allows to reuse the same protocol model for both privacy and
verifiability proofs.
We apply the framework to several protocols of the literature and
industry, showing the flexibility and applicability of our framework.},
}