{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T16:46:11Z","timestamp":1742921171103,"version":"3.40.3"},"publisher-location":"Cham","reference-count":25,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031488054"},{"type":"electronic","value":"9783031488061"}],"license":[{"start":{"date-parts":[[2023,12,5]],"date-time":"2023-12-05T00:00:00Z","timestamp":1701734400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,12,5]],"date-time":"2023-12-05T00:00:00Z","timestamp":1701734400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2024]]},"DOI":"10.1007\/978-3-031-48806-1_3","type":"book-chapter","created":{"date-parts":[[2023,12,4]],"date-time":"2023-12-04T17:02:12Z","timestamp":1701709332000},"page":"34-46","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Coercion-Resistant Cast-as-Intended Verifiability for Computationally Limited Voters"],"prefix":"10.1007","author":[{"given":"Tamara","family":"Finogina","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Javier","family":"Herranz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,12,5]]},"reference":[{"key":"3_CR1","unstructured":"Adida, B.: Helios: web-based open-audit voting. In: Proceedings of the 17th USENIX Security Symposium, pp. 335\u2013348 (2008)"},{"key":"3_CR2","unstructured":"Benaloh, J.: Ballot casting assurance via voter-initiated poll station auditing. In: Proceedings of the USENIX Workshop on Accurate Electronic Voting Technology, EVT\u201907, p. 14, USA, 2007. USENIX Association (2007)"},{"key":"3_CR3","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":"3_CR4","doi-asserted-by":"crossref","unstructured":"Canetti, R., Gennaro, R.: Incoercible multiparty computation. In: 37th Annual Symposium on Foundations of Computer Science, FOCS \u201996, Burlington, Vermont, USA, 14\u201316 October 1996, pp. 504\u2013513. IEEE Computer Society, November 1996","DOI":"10.1109\/SFCS.1996.548509"},{"key":"3_CR5","doi-asserted-by":"publisher","first-page":"38","DOI":"10.1109\/MSECP.2004.1264852","volume":"2","author":"D Chaum","year":"2004","unstructured":"Chaum, D.: Secret-ballot receipts: true voter-verifiable elections. IEEE Secur. Priv. Mag. 2, 38\u201347 (2004)","journal-title":"IEEE Secur. Priv. Mag."},{"key":"3_CR6","unstructured":"Cortier, V., Gaudry, P., Yang, Q.: Is the JCJ voting system really coercion-resistant? Working paper or preprint, April 2022"},{"key":"3_CR7","unstructured":"Delaune, S., Kremer, S., Ryan, M.: Coercion-resistance and receipt-freeness in electronic voting. In: 19th IEEE Computer Security Foundations Workshop (CSFW\u201906), pp. 12\u201342 (2006)"},{"key":"3_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"483","DOI":"10.1007\/978-3-030-92548-2_25","volume-title":"Cryptology and Network Security","author":"T Finogina","year":"2021","unstructured":"Finogina, T., Herranz, J., Larraia, E.: How (not) to achieve both coercion resistance and cast as intended verifiability in remote evoting. In: Conti, M., Stevens, M., Krenn, S. (eds.) CANS 2021. LNCS, vol. 13099, pp. 483\u2013491. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-92548-2_25"},{"key":"3_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"344","DOI":"10.1007\/978-3-642-03549-4_21","volume-title":"Financial Cryptography and Data Security","author":"RW Gardner","year":"2009","unstructured":"Gardner, R.W., Garera, S., Rubin, A.D.: Coercion resistant end-to-end voting. In: Dingledine, R., Golle, P. (eds.) FC 2009. LNCS, vol. 5628, pp. 344\u2013361. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-03549-4_21"},{"key":"3_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"130","DOI":"10.1007\/978-3-662-54970-4_8","volume-title":"Financial Cryptography and Data Security","author":"S Guasch","year":"2017","unstructured":"Guasch, S., Morillo, P.: How to challenge and cast your e-Vote. In: Grossklags, J., Preneel, B. (eds.) FC 2016. LNCS, vol. 9603, pp. 130\u2013145. Springer, Heidelberg (2017). https:\/\/doi.org\/10.1007\/978-3-662-54970-4_8"},{"key":"3_CR11","unstructured":"Haines, T., Smyth, B.: Surveying definitions of coercion resistance. Cryptology ePrint Archive, Report 2019\/822 (2019). https:\/\/ia.cr\/2019\/822"},{"key":"3_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1007\/978-3-319-70278-0_24","volume-title":"Financial Cryptography and Data Security","author":"V Iovino","year":"2017","unstructured":"Iovino, V., Rial, A., R\u00f8nne, P.B., Ryan, P.Y.A.: Using Selene to verify your vote in JCJ. In: Brenner, M., et al. (eds.) FC 2017. LNCS, vol. 10323, pp. 385\u2013403. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-70278-0_24"},{"key":"3_CR13","doi-asserted-by":"crossref","unstructured":"Juels, A., Catalano, D., Jakobsson, M.: Coercion-resistant electronic elections. In: Towards Trustworthy Elections, New Directions in Electronic Voting, pp. 37\u201363 (2010)","DOI":"10.1007\/978-3-642-12980-3_2"},{"key":"3_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"198","DOI":"10.1007\/978-3-319-68687-5_12","volume-title":"Electronic Voting","author":"S Khazaei","year":"2017","unstructured":"Khazaei, S., Wikstr\u00f6m, D.: Return code schemes for electronic voting systems. In: Krimmer, R., Volkamer, M., Braun Binder, N., Kersting, N., Pereira, O., Sch\u00fcrmann, C. (eds.) E-Vote-ID 2017. LNCS, vol. 10615, pp. 198\u2013209. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-68687-5_12"},{"key":"3_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"216","DOI":"10.1007\/978-3-030-30625-0_14","volume-title":"Electronic Voting","author":"K Krips","year":"2019","unstructured":"Krips, K., Willemson, J.: On practical aspects of coercion-resistant remote voting systems. In: Krimmer, R., et al. (eds.) E-Vote-ID 2019. LNCS, vol. 11759, pp. 216\u2013232. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-30625-0_14"},{"key":"3_CR16","doi-asserted-by":"crossref","unstructured":"K\u00fcsters, R., Truderung, T., Vogt, A.: A game-based definition of coercion-resistance and its applications. In: 2010 23rd IEEE Computer Security Foundations Symposium, pp. 122\u2013136 (2010)","DOI":"10.1109\/CSF.2010.16"},{"key":"3_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"373","DOI":"10.1007\/11818175_22","volume-title":"Advances in Cryptology - CRYPTO 2006","author":"T Moran","year":"2006","unstructured":"Moran, T., Naor, M.: Receipt-free universally-verifiable voting with everlasting privacy. In: Dwork, C. (ed.) CRYPTO 2006. LNCS, vol. 4117, pp. 373\u2013392. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11818175_22"},{"key":"3_CR18","unstructured":"Neff, C.A.: Practical high certainty intent verification for encrypted votes (2004)"},{"key":"3_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1007\/BFb0028157","volume-title":"Security Protocols","author":"T Okamoto","year":"1998","unstructured":"Okamoto, T.: Receipt-free electronic voting schemes for large scale elections. In: Christianson, B., Crispo, B., Lomas, M., Roe, M. (eds.) Security Protocols 1997. LNCS, vol. 1361, pp. 25\u201335. Springer, Heidelberg (1998). https:\/\/doi.org\/10.1007\/BFb0028157"},{"key":"3_CR20","unstructured":"Pankova, A., Willemson, J.: Relations between privacy, verifiability, accountability and coercion-resistance in voting protocols. Cryptology ePrint Archive, Report 2021\/1501 (2021). https:\/\/ia.cr\/2021\/1501"},{"key":"3_CR21","doi-asserted-by":"publisher","unstructured":"Riou, S.; Kulyk, O.; Marcos del Blanco, D.Y.: A formal approach to coercion resistance and its application to e-voting. Mathematics 10, 781 (2022). https:\/\/doi.org\/10.3390\/math10050781","DOI":"10.3390\/math10050781"},{"key":"3_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"176","DOI":"10.1007\/978-3-662-53357-4_12","volume-title":"Financial Cryptography and Data Security","author":"PYA Ryan","year":"2016","unstructured":"Ryan, P.Y.A., R\u00f8nne, P.B., Iovino, V.: Selene: voting with transparent verifiability and coercion-mitigation. In: Clark, J., Meiklejohn, S., Ryan, P.Y.A., Wallach, D., Brenner, M., Rohloff, K. (eds.) FC 2016. LNCS, vol. 9604, pp. 176\u2013192. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-53357-4_12"},{"key":"3_CR23","unstructured":"Smith, W.D.: New cryptographic election protocol with best-known theoretical properties. In: Workshop on Frontiers in Electronic Election (2005). https:\/\/users.encs.concordia.ca\/~clark\/biblio\/coercion\/Smith\/202005-1.pdf"},{"key":"3_CR24","unstructured":"Trechsel, A.H., Vassil, K.: Internet voting in Estonia: a comparative analysis of four elections since 2005: report for the council of Europe (2010)"},{"key":"3_CR25","doi-asserted-by":"crossref","unstructured":"Benaloh, J., Tuinstra, D.: Receipt-free secret-ballot elections. In: STOC \u201994 Proceedings of the Twenty-sixth Annual ACM Symposium on Theory of Computing, pp. 544\u2013553. Association for Computing Machinery Inc., May 1994","DOI":"10.1145\/195058.195407"}],"container-title":["Lecture Notes in Computer Science","Financial Cryptography and Data Security. FC 2023 International Workshops"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-48806-1_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,11,4]],"date-time":"2024-11-04T22:54:27Z","timestamp":1730760867000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-48806-1_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,12,5]]},"ISBN":["9783031488054","9783031488061"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-48806-1_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023,12,5]]},"assertion":[{"value":"5 December 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"FC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Financial Cryptography and Data Security","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Bol, Bra\u010d","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Croatia","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":"1 May 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 May 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"fc2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/fc23.ifca.ai\/","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":"HotCRP","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"182","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":"39","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":"2","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":"21% - 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":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"For the workshops 7 full papers have been accepted from 18 submissions.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}