No more excuses: Automated synthesis of practical and verifiable vote-counting programs for complex voting schemes

1Citations
Citations of this article
6Readers
Mendeley users who have this article in their library.
Get full text

Abstract

We argue that electronic vote-counting software can engender broad-based public trust in elections to public office only if they are formally verified against their legal definition and only if they can produce an easily verifiable certificate for the correctness of the count. We then show that both are achievable for the Schulze method of vote-counting, even when the election involves millions of ballots. We argue that our methodology is applicable to any vote-counting scheme that is rigorously specified. Consequently, the current practice of using unverified and unverifiable vote counting software for elections to public office is untenable. In particular, proprietary closed source vote-counting software is simply inexcusable.

Cite

CITATION STYLE

APA

Bennett Moses, L., Goré, R., Levy, R., Pattinson, D., & Tiwari, M. (2017). No more excuses: Automated synthesis of practical and verifiable vote-counting programs for complex voting schemes. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 10615 LNCS, pp. 66–83). Springer Verlag. https://doi.org/10.1007/978-3-319-68687-5_5

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free