Call for Papers

Elections form the foundations of democracy and have been the target for attack since its inception. Over the last few decades the introduction of digital technologies to elections has opened up a raft of new attack vectors. Recently in the US there is discussion of placing voting technologies on the list of national, critical infrastructures. Secure voting protocols, in particular so-called “end-to-end verifiable” schemes, have been a hot topic of research for the last decade or so. Voting poses many challenges: the precise characterization of very subtle properties including verifiability and coercion resistance, and the design and analysis of schemes providing these properties in a complex, hostile environment. The field requires a deep understanding of modern crypto but is highly interdisciplinary, requiring understanding of the role of humans, procedures, laws, regulations, etc.

Papers should contain original research in any area related to electronic voting technologies, verifiable elections, and related concerns. Example topics include but are not limited to:

  • In-person voting systems
  • Remote/Internet voting systems
  • Voter registration and authentication systems
  • Procedures for ballot and election auditing
  • Cryptographic (or non-cryptographic) verifiable election schemes
  • Attacks on existing systems
  • Designs of new systems
  • Experiences deploying voting systems or conducting elections
  • Experiences detecting and recovering from election problems
  • Formal or informal security or requirements analysis
  • Examination of usability and accessibility issues
  • Research on relevant regulations, standards, or laws

Important Dates

Submissions deadline23:59 UTC, December 9th, 2016
Notification of acceptanceFebruary 1st, 2017


Submissions will be judged on originality, relevance, correctness, and clarity.

Submissions must not substantially overlap with works that have been published or that are simultaneously submitted to a journal or a conference with proceedings. Submissions should follow the Springer Lecture Notes in Computer Science format and should be no more than 15 pages including references and well-marked appendices. Accepted papers will appear in the proceedings published by Springer Lecture Notes in Computer Science. Authors who wish to publish a full version of their paper later may opt-out by publishing a 1-2 page extended abstract only.

All submissions will be reviewed double-blind, and as such, must be anonymous, with no author names, affiliations, acknowledgements, or obvious references.

Please use the following EasyChair link to upload your submissions: EasyChair submission website

Program Co-Chairs

Peter Y. A. Ryan

Vanessa Teague

Program Committee

Roberto Araujo Universidade Federal do Pará
Josh Benaloh Microsoft Research
Jeremy Clark Concordia University
Chris Culnane Melbourne University
Eric Dubuis Bern University of Applied Sciences
Jeremy Epstein SRI International
Aleksander Essex Western University
David Galindo University of Birmingham
Kristian Gjøsteen Norwegian University of Science and Technology
Rajeev Gore The Australian National University
Jeroen van de Graaf Federal University of Minas Gerais – Belo Horizonte
Rolf Haenni Bern University of Applied Sciences
J. Alex Halderman University of Michigan
Richard Hill Hill Associates
Reto König Bern University of Applied Sciences
Steve Kremer INRIA Nancy
Robert Krimmer Tallinn University of Technology
Ralf Kuesters University of Trier
Helger Lipmaa University of Tartu
Tal Moran IDC Herzliya
Olivier Pereira Université catholique de Louvain
Ron Rivest Massachusetts Institute of Technology (MIT)
Peter B Roenne University of Luxembourg
Alon Rosen IDC Herzliya
Mark Ryan University of Birmingham
Steve Schneider University of Surrey
Berry Schoenmakers Eindhoven University of Technology
Carsten Schuermann IT University of Copenhagen
Philip Stark University of California, Berkeley
Melanie Volkamer Karlstad University / TU Darmstadt
Poorvi Vora The George Washington University
Dan Wallach Rice University


Schedule Friday April 7th 2017
Welcome: Vanessa Teague and Peter Y. A. Ryan
Session 1: Foundations

Ron Rivest, Philip B. Stark and Zara Perumal

BatchVote: Voting rules designed for auditability

R. Ramanujam, Vaishnavi Sundararajan and S P Suresh

Existential Assertions for Voting Protocols

Olivier Pereira and Ron Rivest

Marked Mix-Nets
Coffee break
Session 2: Tutorial

Rolf Haenni and Philipp Locher

Pseudo-Code Algorithms for Verifiable Re-Encryption Mix-Nets
Keynote: Philip Stark. Sometimes, a Paper Trail Isn't Worth the Paper It's Printed on
Lunch break

Vitalik Buterin

Blockchain and Smart Contract Mechanism Design Challenges” Ethereum Foundation (founder) in TSC workshop
Session 3: Protocols

Peter Roenne, Vincenzo Iovino, Alfredo Rial and Peter Y A Ryan

Using Selene to Verify your Vote in JCJ
Coffee break
Session 4: Protocols

Kristian Gjøsteen and Martin Strand

Fully homomorphic elections: Stronger security, better verifiability

Oksana Kulyk, Stephan Neumann, Karola Marky and Melanie Volkamer

Enabling Vote Delegation for Boardroom Voting

Nan Yang and Jeremy Clark

Practical Governmental Voting with Unconditional Integrity and Privacy

Quick Access

Navigate to other sections.