{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,4]],"date-time":"2026-04-04T05:59:04Z","timestamp":1775282344875,"version":"3.50.1"},"publisher-location":"Cham","reference-count":23,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030035914","type":"print"},{"value":"9783030035921","type":"electronic"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"tdm","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":[[2018]]},"DOI":"10.1007\/978-3-030-03592-1_5","type":"book-chapter","created":{"date-parts":[[2018,11,22]],"date-time":"2018-11-22T23:45:32Z","timestamp":1542930332000},"page":"69-87","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Verified Certificate Checking for Counting Votes"],"prefix":"10.1007","author":[{"given":"Milad K.","family":"Ghale","sequence":"first","affiliation":[]},{"given":"Dirk","family":"Pattinson","sequence":"additional","affiliation":[]},{"given":"Ramana","family":"Kumar","sequence":"additional","affiliation":[]},{"given":"Michael","family":"Norrish","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,11,24]]},"reference":[{"issue":"3","key":"5_CR1","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1007\/s10817-013-9289-2","volume":"52","author":"E Alkassar","year":"2014","unstructured":"Alkassar, E., B\u00f6hme, S., Mehlhorn, K., Rizkallah, C.: A framework for the verification of certifying computations. J. Autom. Reason. 52(3), 241\u2013273 (2014)","journal-title":"J. Autom. Reason."},{"key":"5_CR2","doi-asserted-by":"crossref","unstructured":"Blum, M., Kannan, S.: Designing programs that check their work. In: Proceedings of the 21st Annual ACM Symposium on Theory of Computing, 14\u201317 May 1989, Seattle, Washington, USA, pp. 86\u201397 (1989)","DOI":"10.1145\/73007.73015"},{"key":"5_CR3","unstructured":"Brooks, L., Griffits, A.: NSW council elections: computer \u2018guesstimate\u2019 might have ignored your vote. ABC News, September 2017. http:\/\/www.abc.net.au\/news\/2017-09-14\/computer-algorithms-may-sway-local-council-elections\/8944186"},{"key":"5_CR4","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1007\/978-1-4615-0239-5_14","volume-title":"Secure Electronic Voting","author":"D Chaum","year":"2003","unstructured":"Chaum, D.: Untraceable electronic mail return addresses and digital pseudonyms. In: Gritzalis, D.A. (ed.) Secure Electronic Voting, pp. 211\u2013219. Springer, Boston (2003). https:\/\/doi.org\/10.1007\/978-1-4615-0239-5_14"},{"key":"5_CR5","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 the ACSW 2017, pp. 24:1\u201324:5 (2017)","DOI":"10.1145\/3014812.3014837"},{"key":"5_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1007\/978-3-662-46666-7_16","volume-title":"Principles of Security and Trust","author":"V Cortier","year":"2015","unstructured":"Cortier, V., Eigner, F., Kremer, S., Maffei, M., Wiedling, C.: Type-based verification of electronic voting protocols. In: Focardi, R., Myers, A. (eds.) POST 2015. LNCS, vol. 9036, pp. 303\u2013323. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-46666-7_16"},{"key":"5_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"327","DOI":"10.1007\/978-3-319-11212-1_19","volume-title":"Computer Security - ESORICS 2014","author":"V Cortier","year":"2014","unstructured":"Cortier, V., Galindo, D., Glondu, S., Izabach\u00e8ne, M.: Election verifiability for Helios under weaker trust assumptions. In: Kuty\u0142owski, M., Vaidya, J. (eds.) ESORICS 2014. LNCS, vol. 8713, pp. 327\u2013344. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-11212-1_19"},{"key":"5_CR8","doi-asserted-by":"crossref","unstructured":"Cortier, V., Galindo, D., K\u00fcsters, R., M\u00fcller, J., Truderung, T.: Verifiability notions for e-voting protocols. IACR Cryptology ePrint Archive 2016, 287 (2016)","DOI":"10.1109\/SP.2016.52"},{"key":"5_CR9","doi-asserted-by":"crossref","unstructured":"Dahlweid, M., Moskal, M., Santen, T., Tobies, S., Schulte, W.: VCC: contract-based modular verification of concurrent C. In: 31st International Conference on Software Engineering, ICSE 2009, Vancouver, Canada, 16\u201324 May 2009, Companion Volume, pp. 429\u2013430 (2009)","DOI":"10.1109\/ICSE-COMPANION.2009.5071046"},{"issue":"2","key":"5_CR10","doi-asserted-by":"publisher","first-page":"141","DOI":"10.2307\/2339223","volume":"44","author":"HR Droop","year":"1881","unstructured":"Droop, H.R.: On methods of electing representatives. J. Stat. Soc. Lond. 44(2), 141\u2013202 (1881). http:\/\/www.jstor.org\/stable\/2339223","journal-title":"J. Stat. Soc. Lond."},{"key":"5_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1007\/978-3-319-68687-5_10","volume-title":"Electronic Voting","author":"MK Ghale","year":"2017","unstructured":"Ghale, M.K., Gor\u00e9, R., Pattinson, D.: A formally verified single transferable voting scheme with fractional values. In: Krimmer, R., Volkamer, M., Braun Binder, N., Kersting, N., Pereira, O., Sch\u00fcrmann, C. (eds.) E-Vote-ID 2017. LNCS, vol. 10615, pp. 163\u2013182. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-68687-5_10"},{"key":"5_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1007\/978-3-642-32347-8_8","volume-title":"Interactive Theorem Proving","author":"D Greenaway","year":"2012","unstructured":"Greenaway, D., Andronick, J., Klein, G.: Bridging the gap: automatic verified abstraction of C. In: Beringer, L., Felty, A. (eds.) ITP 2012. LNCS, vol. 7406, pp. 99\u2013115. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-32347-8_8"},{"key":"5_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"584","DOI":"10.1007\/978-3-662-54434-1_22","volume-title":"Programming Languages and Systems","author":"A Gu\u00e9neau","year":"2017","unstructured":"Gu\u00e9neau, A., Myreen, M.O., Kumar, R., Norrish, M.: Verified characteristic formulae for CakeML. In: Yang, H. (ed.) ESOP 2017. LNCS, vol. 10201, pp. 584\u2013610. Springer, Heidelberg (2017). https:\/\/doi.org\/10.1007\/978-3-662-54434-1_22"},{"key":"5_CR14","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). https:\/\/doi.org\/10.1007\/978-3-642-15497-3_24"},{"key":"5_CR15","doi-asserted-by":"crossref","unstructured":"K\u00fcsters, R., Truderung, T., Vogt, A.: Accountability: definition and relationship to verifiability. In: Proceedings of the 17th ACM Conference on Computer and Communications Security, CCS 2010, Chicago, Illinois, USA, 4\u20138 October 2010, pp. 526\u2013535 (2010)","DOI":"10.1145\/1866307.1866366"},{"key":"5_CR16","doi-asserted-by":"crossref","unstructured":"K\u00fcsters, R., Truderung, T., Vogt, A.: Verifiability, privacy, and coercion-resistance: new insights from a case study. In: 32nd IEEE Symposium on Security and Privacy, S&P 2011, 22\u201325 May 2011, Berkeley, California, USA, pp. 538\u2013553 (2011)","DOI":"10.1109\/SP.2011.21"},{"issue":"2","key":"5_CR17","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1016\/j.cosrev.2010.09.009","volume":"5","author":"RM McConnell","year":"2011","unstructured":"McConnell, R.M., Mehlhorn, K., N\u00e4her, S., Schweitzer, P.: Certifying algorithms. Comput. Sci. Rev. 5(2), 119\u2013161 (2011)","journal-title":"Comput. Sci. Rev."},{"issue":"2\u20133","key":"5_CR18","doi-asserted-by":"publisher","first-page":"284","DOI":"10.1017\/S0956796813000282","volume":"24","author":"MO Myreen","year":"2014","unstructured":"Myreen, M.O., Owens, S.: Proof-producing translation of higher-order logic into pure and stateful ML. J. Funct. Program. 24(2\u20133), 284\u2013315 (2014)","journal-title":"J. Funct. Program."},{"key":"5_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"46","DOI":"10.1007\/978-3-319-06200-6_4","volume-title":"NASA Formal Methods","author":"L Noschinski","year":"2014","unstructured":"Noschinski, L., Rizkallah, C., Mehlhorn, K.: Verification of certifying computations through autocorres and simpl. In: Badger, J.M., Rozier, K.Y. (eds.) NFM 2014. LNCS, vol. 8430, pp. 46\u201361. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-06200-6_4"},{"key":"5_CR20","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","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 (LNAI), vol. 9457, pp. 464\u2013475. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-26350-2_41"},{"key":"5_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"410","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, pp. 410\u2013426. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-66107-0_26"},{"key":"5_CR22","doi-asserted-by":"crossref","unstructured":"Tan, Y.K., Myreen, M.O., Kumar, R., Fox, A.C.J., Owens, S., Norrish, M.: A new verified compiler backend for CakeML. In: Garrigue, J., Keller, G., Sumii, E. (eds.) Proceedings of the 21st ACM SIGPLAN International Conference on Functional Programming, ICFP 2016, Nara, Japan, 18\u201322 September 2016, pp. 60\u201373. ACM (2016). http:\/\/doi.acm.org\/10.1145\/2951913.2951924","DOI":"10.1145\/3022670.2951924"},{"key":"5_CR23","unstructured":"Verity, F., Pattinson, D.: Formally verified invariants of vote counting schemes. In: Proceedings of the Australasian Computer Science Week Multiconference, ACSW 2017, Geelong, Australia, 31 January\u20133 February 2017, pp. 31:1\u201331:10 (2017). http:\/\/doi.acm.org\/10.1145\/3014812.3014845"}],"container-title":["Lecture Notes in Computer Science","Verified Software. Theories, Tools, and Experiments"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-03592-1_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,4]],"date-time":"2026-04-04T05:13:28Z","timestamp":1775279608000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-03592-1_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783030035914","9783030035921"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-03592-1_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"24 November 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"VSTTE","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Working Conference on Verified Software: Theories, Tools, and Experiments","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Oxford","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"United Kingdom","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18 July 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 July 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"vstte2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/vstte18.it.uu.se\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"24","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"19","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"79% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}