Skip to main content
SpringerLink
Log in

Linear Logical Voting Protocols

  • Conference paper
E-Voting and Identity (Vote-ID 2011)

Part of the book series: Lecture Notes in Computer Science ((LNSC,volume 7187))

Included in the following conference series:

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 49.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Andreoli, J.M.: Logic programming with focusing proofs in linear logic. Journal of Logic and Computation 2(3), 297–347 (1992)

    Article  MathSciNet  MATH  Google Scholar 

  2. Benaloh, J., Moran, T., Naish, L., Ramchen, K., Teague, V.: Shuffle-sum: Coercion-resistant verifiable tallying for STV voting. IEEE Transactions on Information Forensics and Security 4(4), 685–698 (2009)

    Article  Google Scholar 

  3. Cervesato, I., Scedrov, A.: Relating state-based and process-based concurrency through linear logic. Information & Computation 207(10), 1044–1077 (2009)

    Article  MATH  Google Scholar 

  4. Chang, B.Y.E., Chaudhuri, K., Pfenning, F.: A judgmental analysis of linear logic. Tech. Rep. CMU-CS-03-131R, Carnegie Mellon University (December 2003)

    Google Scholar 

  5. Chaum, D., Ryan, P.Y.A., Schneider, S.: A Practical Voter-Verifiable Election Scheme. In: De Capitani di Vimercati, S., Syverson, P.F., Gollmann, D. (eds.) ESORICS 2005. LNCS, vol. 3679, pp. 118–139. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  6. Clocksin, W.F., Mellish, C.S.: Programming in Prolog, 5th edn. Springer (2003)

    Google Scholar 

  7. Cochran, D., Kiniry, J.: Vótáil: A formally specified and verified ballot counting system for Irish PR-STV elections. In: Beckert, B., Marché, C. (eds.) Pre-proceedings of the International Conference on Formal Verification of Object-Oriented Software, Paris, France (June 2010)

    Google Scholar 

  8. Delaune, S., Kremer, S., Ryan, M.: Verifying privacy-type properties of electronic voting protocols. Journal of Computer Security 17(4), 435–487 (2009)

    Google Scholar 

  9. DeYoung, H., Pfenning, F.: Reasoning about the consequences of authorization policies in a linear epistemic logic. In: Cortier, V., Shmatikov, V. (eds.) Proceedings of the Workshop on Foundations of Computer Security, Los Angeles, California (August 2009)

    Google Scholar 

  10. Garg, D., Bauer, L., Bowers, K.D., Pfenning, F., Reiter, M.K.: A Linear Logic of Authorization and Knowledge. In: Gollmann, D., Meier, J., Sabelfeld, A. (eds.) ESORICS 2006. LNCS, vol. 4189, pp. 297–312. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  11. Garg, D., Pfenning, F.: A proof-carrying file system. In: 31st IEEE Symposium on Security and Privacy, pp. 349–364. IEEE Computer Society Press, Oakland (2010)

    Chapter  Google Scholar 

  12. Girard, J.Y.: Linear logic. Theoretical Computer Science 50(1), 1–102 (1987)

    Article  MathSciNet  MATH  Google Scholar 

  13. López, P., Pfenning, F., Polakow, J., Watkins, K.: Monadic concurrent linear logic programming. In: Barahona, P., Felty, A.P. (eds.) Proceedings of the 7th International ACM SIGPLAN Conference on Principles and Practice of Declarative Programming, pp. 35–46. ACM Press, Lisbon (2005)

    Google Scholar 

  14. Schack-Nielsen, A., Schürmann, C.: Celf – A Logical Framework for Deductive and Concurrent Systems (System Description). In: Armando, A., Baumgartner, P., Dowek, G. (eds.) IJCAR 2008. LNCS (LNAI), vol. 5195, pp. 320–326. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  15. Wadler, P.: A Taste of Linear Logic. In: Borzyszkowski, A.M., Sokolowski, S. (eds.) MFCS 1993. LNCS, vol. 711, pp. 185–210. Springer, Heidelberg (1993)

    Chapter  Google Scholar 

  16. Watkins, K., Cervesato, I., Pfenning, F., Walker, D.: A concurrent logical framework I: Judgments and properties. Tech. Rep. CMU-CS-02-101, Carnegie Mellon University (2002) (revised May 2003)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Carnegie Mellon University, Pittsburgh, PA, USA

    Henry DeYoung

  2. IT University of Copenhagen, Copenhagen, Denmark

    Carsten Schürmann

Authors
  1. Henry DeYoung
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Carsten Schürmann
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Informatics and Telecommunications, National and Kapodistrian University of Athens, 15784, Panepistimiopolis, Athens, Greece

    Aggelos Kiayias

  2. Institute of Computer Science, University of Tartu, J. Liivi 2, 50409, Tartu, Estonia

    Helger Lipmaa

Rights and permissions

Reprints and permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

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. https://doi.org/10.1007/978-3-642-32747-6_4

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-32747-6_4

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-32746-9

  • Online ISBN: 978-3-642-32747-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation