{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T16:06:34Z","timestamp":1743005194250,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642327469"},{"type":"electronic","value":"9783642327476"}],"license":[{"start":{"date-parts":[[2012,1,1]],"date-time":"2012-01-01T00:00:00Z","timestamp":1325376000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2012,1,1]],"date-time":"2012-01-01T00:00:00Z","timestamp":1325376000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-32747-6_4","type":"book-chapter","created":{"date-parts":[[2012,9,12]],"date-time":"2012-09-12T08:24:14Z","timestamp":1347438254000},"page":"53-70","source":"Crossref","is-referenced-by-count":8,"title":["Linear Logical Voting Protocols"],"prefix":"10.1007","author":[{"given":"Henry","family":"DeYoung","sequence":"first","affiliation":[]},{"given":"Carsten","family":"Sch\u00fcrmann","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"3","key":"4_CR1","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1093\/logcom\/2.3.297","volume":"2","author":"J.M. Andreoli","year":"1992","unstructured":"Andreoli, J.M.: Logic programming with focusing proofs in linear logic. Journal of Logic and Computation\u00a02(3), 297\u2013347 (1992)","journal-title":"Journal of Logic and Computation"},{"issue":"4","key":"4_CR2","doi-asserted-by":"publisher","first-page":"685","DOI":"10.1109\/TIFS.2009.2033757","volume":"4","author":"J. Benaloh","year":"2009","unstructured":"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\u00a04(4), 685\u2013698 (2009)","journal-title":"IEEE Transactions on Information Forensics and Security"},{"issue":"10","key":"4_CR3","doi-asserted-by":"publisher","first-page":"1044","DOI":"10.1016\/j.ic.2008.11.006","volume":"207","author":"I. Cervesato","year":"2009","unstructured":"Cervesato, I., Scedrov, A.: Relating state-based and process-based concurrency through linear logic. Information & Computation\u00a0207(10), 1044\u20131077 (2009)","journal-title":"Information & Computation"},{"key":"4_CR4","unstructured":"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)"},{"key":"4_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"118","DOI":"10.1007\/11555827_8","volume-title":"Computer Security \u2013 ESORICS 2005","author":"D. Chaum","year":"2005","unstructured":"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.\u00a03679, pp. 118\u2013139. Springer, Heidelberg (2005)"},{"key":"4_CR6","doi-asserted-by":"crossref","unstructured":"Clocksin, W.F., Mellish, C.S.: Programming in Prolog, 5th edn. Springer (2003)","DOI":"10.1007\/978-3-642-55481-0"},{"key":"4_CR7","unstructured":"Cochran, D., Kiniry, J.: V\u00f3t\u00e1il: A formally specified and verified ballot counting system for Irish PR-STV elections. In: Beckert, B., March\u00e9, C. (eds.) Pre-proceedings of the International Conference on Formal Verification of Object-Oriented Software, Paris, France (June 2010)"},{"issue":"4","key":"4_CR8","doi-asserted-by":"crossref","first-page":"435","DOI":"10.3233\/JCS-2009-0340","volume":"17","author":"S. Delaune","year":"2009","unstructured":"Delaune, S., Kremer, S., Ryan, M.: Verifying privacy-type properties of electronic voting protocols. Journal of Computer Security\u00a017(4), 435\u2013487 (2009)","journal-title":"Journal of Computer Security"},{"key":"4_CR9","unstructured":"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)"},{"key":"4_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1007\/11863908_19","volume-title":"Computer Security \u2013 ESORICS 2006","author":"D. Garg","year":"2006","unstructured":"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.\u00a04189, pp. 297\u2013312. Springer, Heidelberg (2006)"},{"key":"4_CR11","doi-asserted-by":"publisher","first-page":"349","DOI":"10.1109\/SP.2010.28","volume-title":"31st IEEE Symposium on Security and Privacy","author":"D. Garg","year":"2010","unstructured":"Garg, D., Pfenning, F.: A proof-carrying file system. In: 31st IEEE Symposium on Security and Privacy, pp. 349\u2013364. IEEE Computer Society Press, Oakland (2010)"},{"issue":"1","key":"4_CR12","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0304-3975(87)90045-4","volume":"50","author":"J.Y. Girard","year":"1987","unstructured":"Girard, J.Y.: Linear logic. Theoretical Computer Science\u00a050(1), 1\u2013102 (1987)","journal-title":"Theoretical Computer Science"},{"key":"4_CR13","first-page":"35","volume-title":"Proceedings of the 7th International ACM SIGPLAN Conference on Principles and Practice of Declarative Programming","author":"P. L\u00f3pez","year":"2005","unstructured":"L\u00f3pez, 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\u201346. ACM Press, Lisbon (2005)"},{"key":"4_CR14","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"320","DOI":"10.1007\/978-3-540-71070-7_28","volume-title":"Automated Reasoning","author":"A. Schack-Nielsen","year":"2008","unstructured":"Schack-Nielsen, A., Sch\u00fcrmann, C.: Celf \u2013 A Logical Framework for Deductive and Concurrent Systems (System Description). In: Armando, A., Baumgartner, P., Dowek, G. (eds.) IJCAR 2008. LNCS (LNAI), vol.\u00a05195, pp. 320\u2013326. Springer, Heidelberg (2008)"},{"key":"4_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1007\/3-540-57182-5_12","volume-title":"Mathematical Foundations of Computer Science 1993","author":"P. Wadler","year":"1993","unstructured":"Wadler, P.: A Taste of Linear Logic. In: Borzyszkowski, A.M., Sokolowski, S. (eds.) MFCS 1993. LNCS, vol.\u00a0711, pp. 185\u2013210. Springer, Heidelberg (1993)"},{"key":"4_CR16","doi-asserted-by":"crossref","unstructured":"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)","DOI":"10.21236\/ADA418517"}],"container-title":["Lecture Notes in Computer Science","E-Voting and Identity"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-32747-6_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,19]],"date-time":"2023-02-19T05:36:27Z","timestamp":1676784987000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-642-32747-6_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642327469","9783642327476"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-32747-6_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}