ITU

Linear Logical Voting Protocols

Research output: Journal Article or Conference Article in JournalJournal articleResearchpeer-review

View graph of relations

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.
Original languageEnglish
Book seriesLecture Notes in Computer Science
Volume7187
Pages (from-to)53-70
ISSN0302-9743
Publication statusPublished - 2012

Bibliographical note

The third international conference on e-voting and identity

ID: 32757128