{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,26]],"date-time":"2025-06-26T04:12:58Z","timestamp":1750911178801,"version":"3.41.0"},"publisher-location":"Cham","reference-count":28,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319686868"},{"type":"electronic","value":"9783319686875"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-319-68687-5_5","type":"book-chapter","created":{"date-parts":[[2017,10,5]],"date-time":"2017-10-05T08:43:05Z","timestamp":1507192985000},"page":"66-83","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["No More Excuses: Automated Synthesis of Practical and Verifiable Vote-Counting Programs for Complex Voting Schemes"],"prefix":"10.1007","author":[{"given":"Lyria","family":"Bennett Moses","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rajeev","family":"Gor\u00e9","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ron","family":"Levy","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dirk","family":"Pattinson","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mukesh","family":"Tiwari","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,10,6]]},"reference":[{"issue":"2","key":"5_CR1","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1007\/s11023-007-9063-5","volume":"17","author":"K Arkoudas","year":"2007","unstructured":"Arkoudas, K., Bringsjord, S.: Computers, justification, and mathematical knowledge. Minds Mach. 17(2), 185\u2013202 (2007)","journal-title":"Minds Mach."},{"key":"5_CR2","unstructured":"Australian Electoral Commission. Letter to Mr Michael Cordover, LSS4883 Outcome of Internal Review of the Decision to Refuse your FOI Request no. LS4849 (2013). http:\/\/www.aec.gov.au\/information-access\/foi\/2014\/files\/ls4912-1.pdf. Accessed 14 May 2017"},{"issue":"2","key":"5_CR3","first-page":"115","volume":"19","author":"B Beckert","year":"2014","unstructured":"Beckert, B., Gor\u00e9, R., Sch\u00fcrmann, C., Bormer, T., Wang, J.: Verifying voting schemes. J. Inf. Sec. Appl. 19(2), 115\u2013129 (2014)","journal-title":"J. Inf. Sec. Appl."},{"issue":"4","key":"5_CR4","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 Trans. Inf. Forensics Secur. 4(4), 685\u2013698 (2009)","journal-title":"IEEE Trans. Inf. Forensics Secur."},{"key":"5_CR5","series-title":"Texts in Theoretical Computer Science. An EATCS Series","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-07964-5","volume-title":"Interactive Theorem Proving and Program Development: Coq\u2019Art: The Calculus of Inductive Constructions","author":"Y Bertot","year":"2004","unstructured":"Bertot, Y., Cast\u00e9ran, P., Huet, G., Paulin-Mohring, C.: Interactive Theorem Proving and Program Development: Coq\u2019Art: The Calculus of Inductive Constructions. Texts in Theoretical Computer Science. An EATCS Series. Springer, Heidelberg (2004). doi:10.1007\/978-3-662-07964-5"},{"key":"5_CR6","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781107446984","volume-title":"Handbook of Computational Social Choice","author":"F Brandt","year":"2016","unstructured":"Brandt, F., Conitzer, V., Endriss, U., Lang, J., Procaccia, A.D.: Introduction to computational social choice. In: Brandt, F., Conitzer, V., Endriss, U., Lang, J., Procaccia, A.D. (eds.) Handbook of Computational Social Choice. Cambridge University Press, Cambridge (2016)"},{"key":"5_CR7","first-page":"645","volume":"79","author":"MA Carrier","year":"2012","unstructured":"Carrier, M.A.: Vote counting, technology, and unintended consequences. St Johns Law Rev. 79, 645\u2013685 (2012)","journal-title":"St Johns Law Rev."},{"key":"5_CR8","unstructured":"Cochran, D., Kiniry, J.: Votail: a formally specified and verified ballot counting system for Irish PR-STV elections. In: Pre-proceedings of the 1st International Conference on Formal Verification of Object-Oriented Software (FoVeOOS) (2010)"},{"key":"5_CR9","doi-asserted-by":"crossref","unstructured":"Conway, A., Blom, M., Naish, L., Teague, V.: An analysis of new south wales electronic vote counting. In: Proceedings of ACSW 2017, pp. 24:1\u201324:5 (2017)","DOI":"10.1145\/3014812.3014837"},{"key":"5_CR10","unstructured":"Elections ACT. Electronic voting and counting (2016). http:\/\/www.elections.act.gov.au\/elections_and_voting\/electronic_voting_and_counting. Accessed 14 May 2017"},{"key":"5_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1007\/978-3-319-68687-5_10","volume-title":"E-Vote-ID 2017","author":"MK Ghale","year":"2017","unstructured":"Ghale, M.K., Gor\u00e9, R., Pattinson, D.: A formally verified single transferable vote scheme with fractional values. In: Krimmer, R., Volkamer, M., Binder, N.B., Kersting, N., Sch\u00fcrmann, C. (eds.) E-Vote-ID 2017. LNCS, vol. 10615, pp. 163\u2013182. Springer, Cham (2017)"},{"key":"5_CR12","first-page":"1370","volume":"55","author":"T Hales","year":"2008","unstructured":"Hales, T.: Formal proof. Not. AMS 55, 1370\u20131380 (2008)","journal-title":"Not. AMS"},{"issue":"3\u20134","key":"5_CR13","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1007\/s10472-015-9479-1","volume":"77","author":"LA Hemaspaandra","year":"2016","unstructured":"Hemaspaandra, L.A., Lavaee, R., Menton, C.: Schulze and ranked-pairs voting are fixed-parameter tractable to bribe, manipulate, and control. Ann. Math. Artif. Intell. 77(3\u20134), 191\u2013223 (2016)","journal-title":"Ann. Math. Artif. Intell."},{"key":"5_CR14","first-page":"700","volume-title":"Encyclopedia of Democratic Thought","author":"C Hood","year":"2001","unstructured":"Hood, C.: Transparency. In: Clarke, P.B., Foweraker, J. (eds.) Encyclopedia of Democratic Thought, pp. 700\u2013704. Routledge, London (2001)"},{"key":"5_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"389","DOI":"10.1007\/978-3-642-15497-3_24","volume-title":"Computer Security \u2013 ESORICS 2010","author":"S Kremer","year":"2010","unstructured":"Kremer, S., Ryan, M., Smyth, B.: Election verifiability in electronic voting protocols. In: Gritzalis, D., Preneel, B., Theoharidou, M. (eds.) ESORICS 2010. LNCS, vol. 6345, pp. 389\u2013404. Springer, Heidelberg (2010). doi:10.1007\/978-3-642-15497-3_24"},{"issue":"1\/2","key":"5_CR16","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1023\/A:1010304729545","volume":"107","author":"P Kurrild-Klitgaard","year":"2001","unstructured":"Kurrild-Klitgaard, P.: An empirical example of the condorcet paradox of voting in a large electorate. Publ. Choice 107(1\/2), 135\u2013145 (2001)","journal-title":"Publ. Choice"},{"issue":"4","key":"5_CR17","doi-asserted-by":"publisher","first-page":"308","DOI":"10.1093\/comjnl\/6.4.308","volume":"6","author":"PJ Landin","year":"1964","unstructured":"Landin, P.J.: The mechanical evaluation of expressions. Comput. J. 6(4), 308 (1964)","journal-title":"Comput. J."},{"key":"5_CR18","unstructured":"Leroy, X., Doligez, D., Frisch, A., Garrigue, J., R\u00e9my, D., Vouillon, J.: The OCaml system release 4.04 documentation and user\u2019s manual. Technical report, Institut National de Recherche en Informatique et en Automatique (INRIA) (2016)"},{"key":"5_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"359","DOI":"10.1007\/978-3-540-69407-6_39","volume-title":"Logic and Theory of Algorithms","author":"P Letouzey","year":"2008","unstructured":"Letouzey, P.: Extraction in Coq: an overview. In: Beckmann, A., Dimitracopoulos, C., L\u00f6we, B. (eds.) CiE 2008. LNCS, vol. 5028, pp. 359\u2013369. Springer, Heidelberg (2008). doi:10.1007\/978-3-540-69407-6_39"},{"key":"5_CR20","first-page":"507","volume-title":"The Oxford Handbook of Public Accountability","author":"A Meijer","year":"2014","unstructured":"Meijer, A.: Transparency. In: Bovens, M., Goodin, R.E., Schillemans, T. (eds.) The Oxford Handbook of Public Accountability, pp. 507\u2013524. Oxford University Press, Oxford (2014)"},{"key":"5_CR21","volume-title":"A Question of Trust","author":"O O\u2019Neill","year":"2002","unstructured":"O\u2019Neill, O.: A Question of Trust. Cambridge University Press, Cambridge (2002)"},{"key":"5_CR22","doi-asserted-by":"crossref","unstructured":"Parkes, D., Xia, L.: A complexity-of-strategic-behavior comparison between Schulze\u2019s rule and ranked pairs. In: Hoffmann, J., Selman, B. (eds.) Proceedings of AAAI 26, pp. 1429\u20131435. AAAI Press (2012)","DOI":"10.1609\/aaai.v26i1.8258"},{"key":"5_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"464","DOI":"10.1007\/978-3-319-26350-2_41","volume-title":"AI 2015: Advances in Artificial Intelligence","author":"D Pattinson","year":"2015","unstructured":"Pattinson, D., Sch\u00fcrmann, C.: Vote counting as mathematical proof. In: Pfahringer, B., Renz, J. (eds.) AI 2015. LNCS, vol. 9457, pp. 464\u2013475. Springer, Cham (2015). doi:10.1007\/978-3-319-26350-2_41"},{"key":"5_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-66107-0_26","volume-title":"Interactive Theorem Proving","author":"D Pattinson","year":"2017","unstructured":"Pattinson, D., Tiwari, M.: Schulze voting as evidence carrying computation. In: Ayala-Rinc\u00f3n, M., Mu\u00f1oz, C.A. (eds.) ITP 2017. LNCS, vol. 10499. Springer, Cham (2017). doi:10.1007\/978-3-319-66107-0_26"},{"key":"5_CR25","unstructured":"Rivest, R.L., Shen, E.: An optimal single-winner preferential voting system based on game theory. In: Conitzer, V., Rothe, J. (eds.) Proceedings of COMSOC 2010. Duesseldorf University Press (2010)"},{"issue":"2","key":"5_CR26","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1007\/s00355-010-0475-4","volume":"36","author":"M Schulze","year":"2011","unstructured":"Schulze, M.: A new monotonic, clone-independent, reversal symmetric, and Condorcet-consistent single-winner election method. Soc. Choice Welfare 36(2), 267\u2013303 (2011)","journal-title":"Soc. Choice Welfare"},{"key":"5_CR27","doi-asserted-by":"crossref","DOI":"10.5771\/9781442218543","volume-title":"Waging War on Corruption: Inside the Movement Fighting the Abuse of Power","author":"F Vogl","year":"2012","unstructured":"Vogl, F.: Waging War on Corruption: Inside the Movement Fighting the Abuse of Power. Rowman & Littlefield, Lanham (2012)"},{"key":"5_CR28","series-title":"SpringerBriefs in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-12229-8","volume-title":"Homomorphic Encryption and Applications","author":"X Yi","year":"2014","unstructured":"Yi, X., Paulet, R., Bertino, E.: Homomorphic Encryption and Applications. SpringerBriefs in Computer Science. Springer, Heidelberg (2014). doi:10.1007\/978-3-319-12229-8"}],"container-title":["Lecture Notes in Computer Science","Electronic Voting"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-68687-5_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,26]],"date-time":"2025-06-26T00:38:17Z","timestamp":1750898297000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-68687-5_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319686868","9783319686875"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-68687-5_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]},"assertion":[{"value":"6 October 2017","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"E-Vote-ID","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Joint Conference on Electronic Voting","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Bregenz","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Austria","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2017","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 October 2017","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27 October 2017","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"evoteid2017","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.e-vote-id.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}