Abstract
Since 2000, all but eleven countries in the world have held national elections. Most of these countries have been using computers in the voting process in one way or the other, for example, for checking off voters of the electoral role, for digitally recording of votes, and also for computing the social choice function. Elections are the cornerstone of representative democracies, the collective trust of the voters in the voting process legitimizes its result. Our work within the DemTech research project ( www.demtech.dk ) aims to maintain or even increase the level of the trust by applying modern theorem proving technology to the domain of voting protocols and schemas.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Schürmann, C. (2013). Certifying Voting Protocols. In: Blazy, S., Paulin-Mohring, C., Pichardie, D. (eds) Interactive Theorem Proving. ITP 2013. Lecture Notes in Computer Science, vol 7998. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-39634-2_3
Download citation
DOI: https://doi.org/10.1007/978-3-642-39634-2_3
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-39633-5
Online ISBN: 978-3-642-39634-2
eBook Packages: Computer ScienceComputer Science (R0)