{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,30]],"date-time":"2025-10-30T07:16:52Z","timestamp":1761808612592,"version":"3.40.3"},"publisher-location":"Cham","reference-count":22,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031437557"},{"type":"electronic","value":"9783031437564"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2023,9,22]],"date-time":"2023-09-22T00:00:00Z","timestamp":1695340800000},"content-version":"vor","delay-in-days":264,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Benaloh challenge allows the voter to audit the encryption of her vote, and in particular to check whether the vote has been represented correctly. An interesting analysis of the mechanism has been presented by Culnane and Teague. The authors propose a natural game-theoretic model of the interaction between the voter and a corrupt, malicious encryption device. Then, they claim that there is no \u201cnatural\u201d rational strategy for the voter to play the game. In consequence, the authorities cannot provide the voter with a sensible auditing strategy, which undermines the whole idea.<\/jats:p><jats:p>Here, we claim the contrary, i.e., that there exist simple rational strategies that justify the usefulness of Benaloh challenge.<\/jats:p>","DOI":"10.1007\/978-3-031-43756-4_7","type":"book-chapter","created":{"date-parts":[[2023,9,21]],"date-time":"2023-09-21T23:02:23Z","timestamp":1695337343000},"page":"106-122","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Pretty Good Strategies for Benaloh Challenge"],"prefix":"10.1007","author":[{"given":"Wojciech","family":"Jamroga","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,9,22]]},"reference":[{"key":"7_CR1","doi-asserted-by":"crossref","unstructured":"Acemyan, C.Z., Kortum, P., Byrne, M.D., Wallach, D.S.: Usability of voter verifiable, end-to-end voting systems: baseline data for Helios, Pr\u00eat \u00e0 Voter, and Scantegrity II. In: Proceedings of EVT\/VVOTE. USENIX Association (2014)","DOI":"10.1007\/978-3-319-20376-8_41"},{"key":"7_CR2","doi-asserted-by":"crossref","unstructured":"Avenhaus, R., Von Stengel, B., Zamir, S.: Inspection games. In: Handbook of Game Theory 3, 1947\u20131987. North-Holland (2000)","DOI":"10.1016\/S1574-0005(02)03014-X"},{"key":"7_CR3","unstructured":"Benaloh, J.: Simple verifiable elections. In: USENIX Electronic Voting Technology Workshop (2006)"},{"key":"7_CR4","unstructured":"Benaloh, J.: Ballot casting assurance via voter-initiated poll station auditing. In: USENIX\/ACCURATE Electronic Voting Technology Workshop (2007)"},{"key":"7_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"320","DOI":"10.1007\/978-3-540-75651-4_22","volume-title":"Advances in Information and Computer Security","author":"A Buldas","year":"2007","unstructured":"Buldas, A., M\u00e4gi, T.: Practical security analysis of e-voting systems. In: Miyaji, A., Kikuchi, H., Rannenberg, K. (eds.) IWSEC 2007. LNCS, vol. 4752, pp. 320\u2013335. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-75651-4_22"},{"key":"7_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1007\/978-3-319-47413-7_14","volume-title":"Decision and Game Theory for Security","author":"C Culnane","year":"2016","unstructured":"Culnane, C., Teague, V.: Strategies for voter-initiated election audits. In: Zhu, Q., Alpcan, T., Panaousis, E., Tambe, M., Casey, W. (eds.) GameSec 2016. LNCS, vol. 9996, pp. 235\u2013247. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-47413-7_14"},{"issue":"4","key":"7_CR7","doi-asserted-by":"publisher","first-page":"101718","DOI":"10.1016\/j.giq.2022.101718","volume":"39","author":"P Ehin","year":"2022","unstructured":"Ehin, P., Solvak, M., Willemson, J., Vinkel, P.: Internet voting in Estonia 2005\u20132019: evidence from eleven elections. Gov. Inf. Q. 39(4), 101718 (2022)","journal-title":"Gov. Inf. Q."},{"key":"7_CR8","unstructured":"Gj\u00f8steen, K.: E-voting in Norway. In: Hao, F., Ryan, P.Y.A. (eds.) Real-World Electronic Voting. Design, Analysis and Deployment. CRC Press (2016)"},{"issue":"7","key":"7_CR9","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1007\/s12243-016-0509-8","volume":"71","author":"K Gj\u00f8steen","year":"2016","unstructured":"Gj\u00f8steen, K., Lund, A.S.: An experiment on the security of the Norwegian electronic voting protocol. Ann. Telecommun. 71(7), 299\u2013307 (2016). https:\/\/doi.org\/10.1007\/s12243-016-0509-8","journal-title":"Ann. Telecommun."},{"issue":"5\/2","key":"7_CR10","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1287\/mnsc.18.5.80","volume":"18","author":"JC Harsanyi","year":"1972","unstructured":"Harsanyi, J.C., Selten, R.: A generalized Nash solution for two-person bargaining games with incomplete information. Manage. Sci. 18(5\/2), 80\u2013106 (1972)","journal-title":"Manage. Sci."},{"key":"7_CR11","unstructured":"Jamroga, W.: Pretty good strategies for Benaloh challenge (2023). arXiv:2307.03258, https:\/\/arxiv.org\/abs\/2307.03258"},{"key":"7_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-319-52240-1_1","volume-title":"Electronic Voting","author":"W Jamroga","year":"2017","unstructured":"Jamroga, W., Tabatabaei, M.: Preventing coercion in e-voting: be open and commit. In: Krimmer, R., et al. (eds.) E-Vote-ID 2016. LNCS, vol. 10141, pp. 1\u201317. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-52240-1_1"},{"issue":"4","key":"7_CR13","doi-asserted-by":"publisher","first-page":"637","DOI":"10.1007\/BF00933155","volume":"26","author":"G Leitmann","year":"1978","unstructured":"Leitmann, G.: On generalized stackelberg strategies. J. Optim. Theory Appl. 26(4), 637\u2013643 (1978)","journal-title":"J. Optim. Theory Appl."},{"key":"7_CR14","unstructured":"Marky, K., Kulyk, O., Renaud, K., Volkamer, M.: What did I really vote for? In: Proceedings of the Conference on Human Factors in Computing Systems CHI, p. 176. ACM (2018)"},{"key":"7_CR15","doi-asserted-by":"crossref","unstructured":"Nash, J.F.: Equilibrium points in n-person games. Proc. Nat. Acad. Sci. U.S.A., 36, 48\u201349 (1950)","DOI":"10.1073\/pnas.36.1.48"},{"key":"7_CR16","unstructured":"Osborne, M., Rubinstein, A.: A Course in Game Theory. MIT Press, Cambridge (1994)"},{"issue":"2","key":"7_CR17","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1007\/s11229-007-9217-2","volume":"158","author":"A Perea","year":"2007","unstructured":"Perea, A.: A one-person doxastic characterization of Nash strategies. Synthese 158(2), 251\u2013271 (2007)","journal-title":"Synthese"},{"key":"7_CR18","doi-asserted-by":"crossref","unstructured":"Shoham, Y., Leyton-Brown, K.: Multiagent Systems - Algorithmic, Game-Theoretic, and Logical Foundations. Cambridge University Press, Cambridge (2009)","DOI":"10.1017\/CBO9780511811654"},{"key":"7_CR19","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511973031","volume-title":"Security and Game Theory: Algorithms Deployed Systems Lessons Learned","author":"M Tambe","year":"2011","unstructured":"Tambe, M.: Security and Game Theory: Algorithms Deployed Systems Lessons Learned. Cambridge University Press, Cambridge (2011)"},{"key":"7_CR20","unstructured":"von Stackelberg, H.: The Theory of the Market Economy. Oxford University Press, Oxford (1952)"},{"key":"7_CR21","unstructured":"Weber, J.-L., Hengartner, U.: USAB. study of the open audit voting system Helios (2009). http:\/\/www.jannaweber.com\/wpcontent\/uploads\/2009\/09\/858Helios.pdf"},{"key":"7_CR22","unstructured":"Yin, Y., Vorobeychik, Y., An, B., Hazon, N.: Optimally protecting elections. In: Proceedings of SECMAS. IFAAMAS (2016)"}],"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-031-43756-4_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,9,21]],"date-time":"2023-09-21T23:03:34Z","timestamp":1695337414000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-43756-4_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031437557","9783031437564"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-43756-4_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"22 September 2023","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":"Luxembourg City","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Luxembourg","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3 October 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"6 October 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"evoteid2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/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":"38","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":"9","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":"24% - 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":"3-4","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)"}}]}}