Linear logical voting protocols

Authors:
Henry DeYoung;Carsten Schürmann
Affiliations:
Carnegie Mellon University, Pittsburgh, PA;IT University of Copenhagen, Copenhagen, Denmark
Venue:
VoteID'11 Proceedings of the Third international conference on E-Voting and Identity
Year:
2011

Citing 10
Cited 1

Linear logic

Theoretical Computer Science
A Taste of Linear Logic

MFCS '93 Proceedings of the 18th International Symposium on Mathematical Foundations of Computer Science
Monadic concurrent linear logic programming

PPDP '05 Proceedings of the 7th ACM SIGPLAN international conference on Principles and practice of declarative programming
Celf --- A Logical Framework for Deductive and Concurrent Systems (System Description)

IJCAR '08 Proceedings of the 4th international joint conference on Automated Reasoning
Verifying privacy-type properties of electronic voting protocols

Journal of Computer Security
Relating state-based and process-based concurrency through linear logic (full-version)

Information and Computation
Shuffle-sum: coercion-resistant verifiable tallying for STV voting

IEEE Transactions on Information Forensics and Security - Special issue on electronic voting
A Proof-Carrying File System

SP '10 Proceedings of the 2010 IEEE Symposium on Security and Privacy
A practical voter-verifiable election scheme

ESORICS'05 Proceedings of the 10th European conference on Research in Computer Security
A linear logic of authorization and knowledge

ESORICS'06 Proceedings of the 11th European conference on Research in Computer Security

Analysing vote counting algorithms via logic: and its application to the CADE election scheme

CADE'13 Proceedings of the 24th international conference on Automated Deduction

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.