Linear Logical Voting Protocols

  • Henry DeYoung
  • Carsten Schürmann
Conference paper

DOI: 10.1007/978-3-642-32747-6_4

Part of the Lecture Notes in Computer Science book series (LNCS, volume 7187)
Cite this paper as:
DeYoung H., Schürmann C. (2012) Linear Logical Voting Protocols. In: Kiayias A., Lipmaa H. (eds) E-Voting and Identity. Vote-ID 2011. Lecture Notes in Computer Science, vol 7187. Springer, Berlin, Heidelberg


Current approaches to electronic implementations of voting protocols involve translating legal text to source code of an imperative programming language. Because the gap between legal text and source code is very large, it is difficult to trust that the program meets its legal specification. In response, we promote linear logic as a high-level language for both specifying and implementing voting protocols. Our linear logical specifications of the single-winner first-past-the-post (SW-FPTP) and single transferable vote (STV) protocols demonstrate that this approach leads to concise implementations that closely correspond to their legal specification, thereby increasing trust.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2012

Authors and Affiliations

  • Henry DeYoung
    • 1
  • Carsten Schürmann
    • 2
  1. 1.Carnegie Mellon UniversityPittsburghUSA
  2. 2.IT University of CopenhagenCopenhagenDenmark

Personalised recommendations