{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T21:26:31Z","timestamp":1743110791865,"version":"3.40.3"},"publisher-location":"Cham","reference-count":31,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030603465"},{"type":"electronic","value":"9783030603472"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","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":[[2020]]},"DOI":"10.1007\/978-3-030-60347-2_5","type":"book-chapter","created":{"date-parts":[[2020,9,24]],"date-time":"2020-09-24T06:02:54Z","timestamp":1600927374000},"page":"67-83","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Privacy-Preserving Dispute Resolution in the Improved Bingo Voting"],"prefix":"10.1007","author":[{"given":"Rosario","family":"Giustolisi","sequence":"first","affiliation":[]},{"given":"Alessandro","family":"Bruni","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,9,25]]},"reference":[{"key":"5_CR1","doi-asserted-by":"crossref","unstructured":"Abadi, M., Fournet, C.: Mobile values, new names, and secure communication. In: POPL, pp. 104\u2013115. ACM, New York (2001)","DOI":"10.1145\/373243.360213"},{"key":"5_CR2","unstructured":"Basin, D.A., Radomirovic, S., Schmid, L.: Dispute resolution in voting. CoRR abs\/2005.03749 (2020). https:\/\/arxiv.org\/abs\/2005.03749"},{"key":"5_CR3","unstructured":"Benaloh, J.: verifiable secret-ballot elections. Ph.D. thesis, Yale University, December 1996"},{"key":"5_CR4","doi-asserted-by":"crossref","unstructured":"Benaloh, J., Tuinstra, D.: Receipt-free secret-ballot elections (extended abstract). In: STOC, pp. 544\u2013553. ACM (1994)","DOI":"10.1145\/195058.195407"},{"key":"5_CR5","unstructured":"Blanchet, B.: An efficient cryptographic protocol verifier based on prolog rules. In: CSFW, pp. 82\u201396. IEEE Computer Society (2001)"},{"key":"5_CR6","doi-asserted-by":"crossref","unstructured":"Bohli, J.M., Henrich, C., Kempka, C., Muller-Quade, J., Rohrich, S.: Enhancing electronic voting machines on the example of bingo voting. IEEE Trans. Inf. Forensics Secur. 4, 745\u2013750 (2009)","DOI":"10.1109\/TIFS.2009.2033755"},{"key":"5_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1007\/978-3-540-77493-8_10","volume-title":"E-Voting and Identity","author":"J-M Bohli","year":"2007","unstructured":"Bohli, J.-M., M\u00fcller-Quade, J., R\u00f6hrich, S.: Bingo voting: secure and coercion-free voting using a trusted random number generator. In: Alkassar, A., Volkamer, M. (eds.) Vote-ID 2007. LNCS, vol. 4896, pp. 111\u2013124. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-77493-8_10"},{"key":"5_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"417","DOI":"10.1007\/978-3-319-69659-1_23","volume-title":"Information Security Conference","author":"A Bruni","year":"2017","unstructured":"Bruni, A., Giustolisi, R., Schuermann, C.: Automated analysis of accountability. In: Nguyen, P., Zhou, J. (eds.) ISC 2017. LNCS, vol. 10599, pp. 417\u2013434. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-69659-1_23"},{"key":"5_CR9","unstructured":"Carback, R., et al.: Scantegrity II municipal election at Takoma park: the first E2E binding governmental election with ballot privacy. In: USENIX Conference on Security. USENIX (2010)"},{"key":"5_CR10","doi-asserted-by":"crossref","unstructured":"Cohen, J., Fischer, M.: A robust and verifiable cryptographically secure election scheme (extended abstract). In: FOCS, pp. 372\u2013382. IEEE (1985)","DOI":"10.1109\/SFCS.1985.2"},{"key":"5_CR11","doi-asserted-by":"crossref","unstructured":"Cortier, V., Galindo, D., K\u00fcsters, R., M\u00fcller, J., Truderung, T.: SoK: verifiability notions for e-voting protocols. In: IEEE Symposium on Security and Privacy, pp. 779\u2013798 (2016)","DOI":"10.1109\/SP.2016.52"},{"key":"5_CR12","doi-asserted-by":"crossref","unstructured":"Cortier, V., Lallemand, J.: Voting: you can\u2019t have privacy without individual verifiability. In: CCS, pp. 53\u201366. ACM (2018)","DOI":"10.1145\/3243734.3243762"},{"key":"5_CR13","unstructured":"Culnane, C., Ryan, P.Y.A., Schneider, S., Teague, V.: vVote: a verifiable voting system (DRAFT). CoRR abs\/1404.6822 (2014)"},{"key":"5_CR14","series-title":"Lecture Notes in Computer Science,","doi-asserted-by":"publisher","first-page":"244","DOI":"10.1007\/3-540-57220-1_66","volume-title":"AUSCRYPT","author":"A Fujioka","year":"1992","unstructured":"Fujioka, A., Okamoto, T., Ohta, K.: A practical secret voting scheme for large scale elections. In: Seberry, J., Zheng, Y. (eds.) AUSCRYPT. LNCS, pp. 244\u2013251. Springer, Heidelberg (1992). https:\/\/doi.org\/10.1007\/3-540-57220-1_66"},{"key":"5_CR15","unstructured":"Gallegos-Garc\u00eda, G., Iovino, V., Rial, A., R\u00f8nne, P.B., Ryan, P.Y.A.: (universal) unconditional verifiability in e-voting without trusted parties. CoRR abs\/1610.06343 (2016). http:\/\/arxiv.org\/abs\/1610.06343"},{"key":"5_CR16","unstructured":"Giustolisi, R., Bruni, A.: The ProVerif code used to verify the Improved Bingo Voting. https:\/\/itu.dk\/people\/rosg\/code\/evoteid20code.tar.gz"},{"key":"5_CR17","doi-asserted-by":"crossref","unstructured":"Giustolisi, R., Iovino, V., Lenzini, G.: Privacy-preserving verifiability - a case for an electronic exam protocol. In: SECRYPT, pp. 139\u2013150. SciTePress (2017)","DOI":"10.5220\/0006429101390150"},{"key":"5_CR18","doi-asserted-by":"publisher","unstructured":"Henrich, C.: Improving and analysing bingo voting. Ph.D. thesis (2012). https:\/\/doi.org\/10.5445\/IR\/1000030270","DOI":"10.5445\/IR\/1000030270"},{"key":"5_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"539","DOI":"10.1007\/3-540-45539-6_38","volume-title":"EUROCRYPT","author":"M Hirt","year":"2000","unstructured":"Hirt, M., Sako, K.: Efficient receipt-free voting based on homomorphic encryption. In: Preneel, B. (ed.) EUROCRYPT. LNCS, vol. 1807, pp. 539\u2013556. Springer, Heidelberg (2000). https:\/\/doi.org\/10.1007\/3-540-45539-6_38"},{"key":"5_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1007\/3-540-45664-3_10","volume-title":"Public Key Cryptography","author":"A Kiayias","year":"2002","unstructured":"Kiayias, A., Yung, M.: Self-tallying elections and perfect ballot secrecy. In: Naccache, D., Paillier, P. (eds.) PKC 2002. LNCS, vol. 2274, pp. 141\u2013158. Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/3-540-45664-3_10"},{"key":"5_CR21","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":"ESORICS","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_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"186","DOI":"10.1007\/978-3-540-31987-0_14","volume-title":"Programming Languages and Systems","author":"S Kremer","year":"2005","unstructured":"Kremer, S., Ryan, M.: Analysis of an electronic voting protocol in the applied pi calculus. In: Gritzalis, D., Preneel, B., Theoharidou, M. (eds.) ESOP 2005. LNCS, vol. 3444, pp. 186\u2013200. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/978-3-540-31987-0_14"},{"key":"5_CR23","doi-asserted-by":"crossref","unstructured":"K\u00fcnnemann, R., Esiyok, I., Backes, M.: Automated verification of accountability in security protocols. In: CSF, pp. 397\u2013413. IEEE (2019)","DOI":"10.1109\/CSF.2019.00034"},{"key":"5_CR24","doi-asserted-by":"crossref","unstructured":"K\u00fcsters, R., Truderung, T., Vogt, A.: Accountability: definition and relationship to verifiability. In: CCS, pp. 526\u2013535. ACM (2010)","DOI":"10.1145\/1866307.1866366"},{"key":"5_CR25","doi-asserted-by":"crossref","unstructured":"K\u00fcsters, R., M\u00fcller, J., Scapin, E., Truderung, T.: sElect: a lightweight verifiable remote voting system. In: CSF, pp. 341\u2013354. IEEE (2016)","DOI":"10.1109\/CSF.2016.31"},{"key":"5_CR26","doi-asserted-by":"crossref","unstructured":"K\u00fcsters, R., Truderung, T., Vogt, A.: A game-based definition of coercion-resistance and its applications. In: CSF, pp. 122\u2013136. IEEE (2010)","DOI":"10.1109\/CSF.2010.16"},{"key":"5_CR27","doi-asserted-by":"crossref","unstructured":"Ryan, P.Y.A., Bismark, D., Heather, J., Schneider, S., Xia, Z.: PrE\u0302voter: a voter-verifiable voting system. IEEE Trans. Inf. Forensics Secur. 4, 662\u2013673 (2009)","DOI":"10.1109\/TIFS.2009.2033233"},{"key":"5_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"148","DOI":"10.1007\/3-540-48405-1_10","volume-title":"Advances in Cryptology \u2014 CRYPTO 1999","author":"B Schoenmakers","year":"1999","unstructured":"Schoenmakers, B.: A simple publicly verifiable secret sharing scheme and its application to electronic voting. In: Wiener, M. (ed.) CRYPTO 1999. LNCS, vol. 1666, pp. 148\u2013164. Springer, Heidelberg (1999). https:\/\/doi.org\/10.1007\/3-540-48405-1_10"},{"key":"5_CR29","unstructured":"Sherman, A.T., Fink, R.A., Carback, R., Chaum, D.: Scantegrity III: automatic trustworthy receipts, highlighting over\/under votes, and full voter verifiability. In: Shacham, H., Teague, V. (eds.) EVT\/WOTE. USENIX (2011)"},{"key":"5_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"146","DOI":"10.1007\/978-3-642-16074-5_11","volume-title":"ARSPA-WITS","author":"B Smyth","year":"2010","unstructured":"Smyth, B., Ryan, M., Kremer, S., Mounira, K.: Towards automatic analysis of election verifiability properties. In: Armando, A., Lowe, G. (eds.) ARSPA-WITS 2010. LNCS, vol. 6186, pp. 146\u2013163. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-16074-5_11"},{"key":"5_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"441","DOI":"10.1007\/978-3-642-38980-1_28","volume-title":"Applied Cryptography and Network Security","author":"F Zag\u00f3rski","year":"2013","unstructured":"Zag\u00f3rski, F., Carback, R.T., Chaum, D., Clark, J., Essex, A., Vora, P.L.: Remotegrity: design and use of an end-to-end verifiable remote voting system. In: Jacobson, M., Locasto, M., Mohassel, P., Safavi-Naini, R. (eds.) ACNS 2013. LNCS, vol. 7954, pp. 441\u2013457. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-38980-1_28"}],"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-030-60347-2_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,2,18]],"date-time":"2022-02-18T19:27:29Z","timestamp":1645212449000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-60347-2_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030603465","9783030603472"],"references-count":31,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-60347-2_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"25 September 2020","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":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"6 October 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9 October 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"evoteid2020","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"}},{"value":"Double-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":"55","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":"14","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":"25% - 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-5","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":"3","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":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}