{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,31]],"date-time":"2025-08-31T10:12:14Z","timestamp":1756635134947,"version":"3.40.3"},"publisher-location":"Cham","reference-count":27,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031505935"},{"type":"electronic","value":"9783031505942"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"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-50594-2_11","type":"book-chapter","created":{"date-parts":[[2024,1,11]],"date-time":"2024-01-11T09:04:34Z","timestamp":1704963874000},"page":"209-228","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Fully Tally-Hiding Verifiable E-Voting for\u00a0Real-World Elections with\u00a0Seat-Allocations"],"prefix":"10.1007","author":[{"given":"Carmen","family":"Wabartha","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8289-4970","authenticated-orcid":false,"given":"Julian","family":"Liedtke","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6905-3571","authenticated-orcid":false,"given":"Nicolas","family":"Huber","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1901-3659","authenticated-orcid":false,"given":"Daniel","family":"Rausch","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9071-9312","authenticated-orcid":false,"given":"Ralf","family":"K\u00fcsters","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,1,12]]},"reference":[{"key":"11_CR1","unstructured":"Adida, B.: Helios: web-based Open-Audit Voting. In: Proceedings of the 17th USENIX Security Symposium, pp. 335\u2013348. USENIX Association (2008)"},{"key":"11_CR2","unstructured":"Benaloh, J.: Verifiable secret ballot elections. Ph.D. thesis, Yale University (1987)"},{"key":"11_CR3","unstructured":"Benaloh, J., et al.: Star-vote: a secure, transparent, auditable, and reliable voting system. In: 2013 Electronic Voting Technology Workshop\/Workshop on Trustworthy Elections, EVT\/WOTE \u201913. USENIX Association (2013)"},{"issue":"4","key":"11_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). https:\/\/doi.org\/10.1109\/TIFS.2009.2033757","journal-title":"IEEE Trans. Inf. Forensics Secur."},{"key":"11_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1007\/978-3-319-98989-1_17","volume-title":"Computer Security","author":"S Canard","year":"2018","unstructured":"Canard, S., Pointcheval, D., Santos, Q., Traor\u00e9, J.: Practical strategy-resistant privacy-preserving elections. In: Lopez, J., Zhou, J., Soriano, M. (eds.) ESORICS 2018. LNCS, vol. 11099, pp. 331\u2013349. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-98989-1_17"},{"key":"11_CR6","unstructured":"Chaum, D., Carback, R., Clark, J., Essex, A., Popoveniuc, S., Rivest, R.L., Ryan, P.Y.A., Shen, E., Sherman, A.T.: Scantegrity II: end-to-end verifiability for optical scan election systems using invisible ink confirmation codes. In: 2008 USENIX\/ACCURATE Electronic Voting Workshop, EVT 2008, Proceedings. USENIX Association (2008)"},{"key":"11_CR7","doi-asserted-by":"publisher","unstructured":"Clarkson, M.R., Chong, S., Myers, A.C.: Civitas: toward a secure voting system. In: 2008 IEEE Symposium on Security and Privacy (S&P 2008), pp. 354\u2013368. IEEE Computer Society (2008). https:\/\/doi.org\/10.1109\/SP.2008.32","DOI":"10.1109\/SP.2008.32"},{"key":"11_CR8","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":"11_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"631","DOI":"10.1007\/978-3-031-17146-8_31","volume-title":"Computer Security - ESORICS 2022","author":"V Cortier","year":"2022","unstructured":"Cortier, V., Gaudry, P., Yang, Q.: A toolbox for verifiable tally-hiding e-voting systems. In: Atluri, V., Di Pietro, R., Jensen, C.D., Meng, W. (eds.) ESORICS 2022. LNCS, vol. 13555, pp. 631\u2013652. Springer, Cham (2022)"},{"key":"11_CR10","doi-asserted-by":"publisher","unstructured":"Damg\u00e5rd, I., Jurik, M., Nielsen, J.B.: A generalization of Paillier\u2019s public-key system with applications to electronic voting. Int. J. Inf. Secur. 9(6), 371\u2013385 (2010). https:\/\/doi.org\/10.1007\/s10207-010-0119-9","DOI":"10.1007\/s10207-010-0119-9"},{"key":"11_CR11","unstructured":"Der Bundeswahlleiter: Wahl zum 20. Deutschen Bundestag am 26. September 2021: Heft 3 Endg\u00fcltige Ergebnisse nach Wahlkreisen (2021). https:\/\/bundeswahlleiter.de\/dam\/jcr\/cbceef6c-19ec-437b-a894-3611be8ae886\/btw21_heft3.pdf, https:\/\/www.bundeswahlleiter.de\/bundestagswahlen\/2021\/ergebnisse\/opendata\/csv\/"},{"key":"11_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1007\/978-3-030-41600-3_4","volume-title":"Verified Software. Theories, Tools, and Experiments","author":"T Haines","year":"2020","unstructured":"Haines, T., Pattinson, D., Tiwari, M.: Verifiable homomorphic tallying for the Schulze vote counting scheme. In: Chakraborty, S., Navas, J.A. (eds.) VSTTE 2019. LNCS, vol. 12031, pp. 36\u201353. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-41600-3_4"},{"key":"11_CR13","doi-asserted-by":"publisher","unstructured":"Heather, J.: Implementing STV securely in Pr\u00eat \u00e0 voter. In: IEEE 20th Computer Security Foundations Symposium (CSF 2007), pp. 157\u2013169. IEEE Computer Society (2007). https:\/\/doi.org\/10.1109\/CSF.2007.22","DOI":"10.1109\/CSF.2007.22"},{"key":"11_CR14","unstructured":"Hertel, F., Huber, N., Kittelberger, J., K\u00fcsters, R., Liedtke, J., Rausch, D.: Extending the tally-hiding ordinos system: implementations for Borda, Hare-Niemeyer, condorcet, and instant-runoff voting. In: Electronic Voting - 6th International Joint Conference, E-Vote-ID 2021, Proceedings, pp. 269\u2013284. University of Tartu Press (2021)"},{"key":"11_CR15","doi-asserted-by":"publisher","unstructured":"Huber, N., et al.: Kryvos: publicly tally-hiding verifiable e-voting. In: CCS 2022, pp. 1443\u20131457. ACM (2022). https:\/\/doi.org\/10.1145\/3548606.3560701","DOI":"10.1145\/3548606.3560701"},{"key":"11_CR16","doi-asserted-by":"publisher","unstructured":"Juels, A., Catalano, D., Jakobsson, M.: Coercion-resistant electronic elections. In: Proceedings of the 2005 ACM Workshop on Privacy in the Electronic Society, WPES 2005, pp. 61\u201370. ACM (2005). https:\/\/doi.org\/10.1145\/1102199.1102213","DOI":"10.1145\/1102199.1102213"},{"key":"11_CR17","doi-asserted-by":"publisher","unstructured":"Kiayias, A., Zacharias, T., Zhang, B.: DEMOS-2: scalable E2E verifiable elections without random oracles. In: CCS 2015, pp. 352\u2013363. ACM (2015). https:\/\/doi.org\/10.1145\/2810103.2813727","DOI":"10.1145\/2810103.2813727"},{"key":"11_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"468","DOI":"10.1007\/978-3-662-46803-6_16","volume-title":"Advances in Cryptology - EUROCRYPT 2015","author":"A Kiayias","year":"2015","unstructured":"Kiayias, A., Zacharias, T., Zhang, B.: End-to-end verifiable elections in the standard model. In: Oswald, E., Fischlin, M. (eds.) EUROCRYPT 2015. LNCS, vol. 9057, pp. 468\u2013498. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-46803-6_16"},{"key":"11_CR19","doi-asserted-by":"publisher","unstructured":"K\u00fcsters, R., Liedtke, J., M\u00fcller, J., Rausch, D., Vogt, A.: Ordinos: a verifiable tally-hiding e-voting system. In: 2020 IEEE European Symposium on Security and Privacy (EuroS &P 2020), pp. 216\u2013235. IEEE Computer Society (2020). https:\/\/doi.org\/10.1109\/EuroSP48549.2020.00022","DOI":"10.1109\/EuroSP48549.2020.00022"},{"key":"11_CR20","doi-asserted-by":"publisher","unstructured":"K\u00fcsters, R., M\u00fcller, J., Scapin, E., Truderung, T.: sElect: a lightweight verifiable remote voting system. In: IEEE 29th Computer Security Foundations Symposium (CSF 2016), pp. 341\u2013354. IEEE Computer Society (2016). https:\/\/doi.org\/10.1109\/CSF.2016.31","DOI":"10.1109\/CSF.2016.31"},{"issue":"2","key":"11_CR21","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1017\/S0048840200001908","volume":"13","author":"A Lijphart","year":"1983","unstructured":"Lijphart, A.: Degrees of proportionality of proportional representation formulas. Rivista Italiana Di Scienza Politica 13(2), 295\u2013305 (1983)","journal-title":"Rivista Italiana Di Scienza Politica"},{"key":"11_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"645","DOI":"10.1007\/978-3-642-39212-2_56","volume-title":"Automata, Languages, and Programming","author":"H Lipmaa","year":"2013","unstructured":"Lipmaa, H., Toft, T.: Secure equality and greater-than tests with sublinear online complexity. In: Fomin, F.V., Freivalds, R., Kwiatkowska, M., Peleg, D. (eds.) ICALP 2013. LNCS, vol. 7966, pp. 645\u2013656. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-39212-2_56"},{"key":"11_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1007\/978-3-030-32101-7_19","volume-title":"Financial Cryptography and Data Security","author":"K Ramchen","year":"2019","unstructured":"Ramchen, K., Culnane, C., Pereira, O., Teague, V.: Universally verifiable MPC and IRV ballot counting. In: Goldberg, I., Moore, T. (eds.) FC 2019. LNCS, vol. 11598, pp. 301\u2013319. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-32101-7_19"},{"key":"11_CR24","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":"11_CR25","unstructured":"Wabartha, C., Liedtke, J., Huber, N., Rausch, D., K\u00fcsters, R.: Fully tally-hiding verifiable e-voting for real-world elections with seat-allocations. Cryptology ePrint Archive, Paper 2023\/1289 (2023). https:\/\/eprint.iacr.org\/2023\/1289, Full Version of this Paper"},{"key":"11_CR26","unstructured":"Wabartha, C., Liedtke, J., Huber, N., Rausch, D., K\u00fcsters, R.: Implementation of our System. (2023). https:\/\/github.com\/JulianLiedtke\/ordinos-bundestag"},{"key":"11_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"122","DOI":"10.1007\/978-3-642-04135-8_8","volume-title":"E-Voting and Identity","author":"R Wen","year":"2009","unstructured":"Wen, R., Buckland, R.: Minimum disclosure counting for the alternative vote. In: Ryan, P.Y.A., Schoenmakers, B. (eds.) Vote-ID 2009. LNCS, vol. 5767, pp. 122\u2013140. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-04135-8_8"}],"container-title":["Lecture Notes in Computer Science","Computer Security \u2013 ESORICS 2023"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-50594-2_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,1,11]],"date-time":"2024-01-11T09:08:53Z","timestamp":1704964133000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-50594-2_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031505935","9783031505942"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-50594-2_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"12 January 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ESORICS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"European Symposium on Research in Computer Security","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"The Hague","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"The Netherlands","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":"25 September 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29 September 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"esorics2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/esorics2023.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"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":"478","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":"93","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":"19% - 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-4","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":"10","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)"}}]}}