{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,11]],"date-time":"2025-09-11T22:07:02Z","timestamp":1757628422897,"version":"3.44.0"},"publisher-location":"Cham","reference-count":23,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032050359","type":"print"},{"value":"9783032050366","type":"electronic"}],"license":[{"start":{"date-parts":[[2025,9,11]],"date-time":"2025-09-11T00:00:00Z","timestamp":1757548800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2025,9,11]],"date-time":"2025-09-11T00:00:00Z","timestamp":1757548800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2026]]},"abstract":"<jats:title>Abstract<\/jats:title>\n          <jats:p>In 2024, Harrison and Haines examined the applicability of STARKs in the context of homomorphically tallied elections.\u00a0While their work ensures the Recorded-as-Cast and Tallied-as-Recorded properties of a voting system, it lacks Cast-as-Intended verification and does not provide a coercion mitigation mechanism. In this work, we address these challenges and propose an updated voting protocol that achieves all three verification properties,\u00a0at the same time providing coercion resistance by allowing re-voting. Our approach leverages vector commitment schemes with update mechanisms. We implement our protocol and provide comparative benchmarks to the Harrison and Haines solution. Our approach significantly outperforms the latter, allowing processing\u00a0a considerably larger number of votes within the same hardware limits.<\/jats:p>","DOI":"10.1007\/978-3-032-05036-6_5","type":"book-chapter","created":{"date-parts":[[2025,9,10]],"date-time":"2025-09-10T07:22:19Z","timestamp":1757488939000},"page":"73-89","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["End-To-End Verifiable Internet Voting with\u00a0Partially Private Bulletin Boards"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0009-0007-9513-9812","authenticated-orcid":false,"given":"Valeh","family":"Farzaliyev","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6290-2099","authenticated-orcid":false,"given":"Jan","family":"Willemson","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,9,11]]},"reference":[{"key":"5_CR1","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1007\/978-3-031-68376-3_3","volume-title":"Advances in Cryptology - CRYPTO 2024","author":"MA Aardal","year":"2024","unstructured":"Aardal, M.A., Aranha, D.F., Boudgoust, K., Kolby, S., Takahashi, A.: Aggregating falcon signatures with LaBRADOR. In: Reyzin, L., Stebila, D. (eds.) Advances in Cryptology - CRYPTO 2024, pp. 71\u2013106. Springer, Cham (2024)"},{"key":"5_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"701","DOI":"10.1007\/978-3-030-26954-8_23","volume-title":"Advances in Cryptology \u2013 CRYPTO 2019","author":"E Ben-Sasson","year":"2019","unstructured":"Ben-Sasson, E., Bentov, I., Horesh, Y., Riabzev, M.: Scalable zero knowledge with no trusted setup. In: Boldyreva, A., Micciancio, D. (eds.) CRYPTO 2019. LNCS, vol. 11694, pp. 701\u2013732. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-26954-8_23"},{"key":"5_CR3","unstructured":"Benaloh, J., Naehrig, M.: Electionguard design specification (version 2.0.0), Technical report, Microsoft Research (2023)"},{"key":"5_CR4","doi-asserted-by":"publisher","first-page":"518","DOI":"10.1007\/978-3-031-38554-4_17","volume-title":"Advances in Cryptology - CRYPTO 2023","author":"W Beullens","year":"2023","unstructured":"Beullens, W., Seiler, G.: LaBRADOR: compact proofs for R1CS from module-SIS. In: Handschuh, H., Lysyanskaya, A. (eds.) Advances in Cryptology - CRYPTO 2023, pp. 518\u2013548. Springer, Cham (2023)"},{"key":"5_CR5","unstructured":"Brakerski, Z., Gentry, C., Vaikuntanathan, V.: Fully homomorphic encryption without bootstrapping. Electron. Colloquium Comput. Complex. TR11 (2011). https:\/\/api.semanticscholar.org\/CorpusID:2182541"},{"key":"5_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1007\/978-3-642-36362-7_5","volume-title":"Public-Key Cryptography \u2013 PKC 2013","author":"D Catalano","year":"2013","unstructured":"Catalano, D., Fiore, D.: Vector commitments and their applications. In: Kurosawa, K., Hanaoka, G. (eds.) PKC 2013. LNCS, vol. 7778, pp. 55\u201372. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-36362-7_5"},{"key":"5_CR7","doi-asserted-by":"publisher","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, SP 2016, San Jose, CA, USA, May 22\u201326, 2016, pp. 779\u2013798. IEEE Computer Society (2016). https:\/\/doi.org\/10.1109\/SP.2016.52","DOI":"10.1109\/SP.2016.52"},{"issue":"5","key":"5_CR8","doi-asserted-by":"publisher","first-page":"481","DOI":"10.1002\/ETT.4460080506","volume":"8","author":"R Cramer","year":"1997","unstructured":"Cramer, R., Gennaro, R., Schoenmakers, B.: A secure and optimally efficient multi-authority election scheme. Eur. Trans. Telecommun. 8(5), 481\u2013490 (1997). https:\/\/doi.org\/10.1002\/ETT.4460080506","journal-title":"Eur. Trans. Telecommun."},{"key":"5_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"481","DOI":"10.1007\/978-3-642-40203-6_27","volume-title":"Computer Security \u2013 ESORICS 2013","author":"\u00c9 Cuvelier","year":"2013","unstructured":"Cuvelier, \u00c9., Pereira, O., Peters, T.: Election verifiability or ballot privacy: do we need to choose? In: Crampton, J., Jajodia, S., Mayes, K. (eds.) ESORICS 2013. LNCS, vol. 8134, pp. 481\u2013498. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-40203-6_27"},{"key":"5_CR10","first-page":"186","volume-title":"Advances in Cryptology \u2013 CRYPTO\u2019 86","author":"A Fiat","year":"1987","unstructured":"Fiat, A., Shamir, A.: How to prove yourself: practical solutions to identification and signature problems. In: Odlyzko, A.M. (ed.) Advances in Cryptology \u2013 CRYPTO\u2019 86, pp. 186\u2013194. Springer, Berlin, Heidelberg (1987)"},{"key":"5_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"626","DOI":"10.1007\/978-3-642-38348-9_37","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2013","author":"R Gennaro","year":"2013","unstructured":"Gennaro, R., Gentry, C., Parno, B., Raykova, M.: Quadratic span programs and succinct NIZKs without PCPs. In: Johansson, T., Nguyen, P.Q. (eds.) EUROCRYPT 2013. LNCS, vol. 7881, pp. 626\u2013645. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-38348-9_37"},{"key":"5_CR12","doi-asserted-by":"publisher","unstructured":"Haines, T., M\u00fcller, J., Querejeta-Azurmendi, I.: Scalable coercion-resistant e-voting under weaker trust assumptions. In: Proceedings of the 38th ACM\/SIGAPP Symposium on Applied Computing, pp. 1576\u20131584. SAC \u201923, Association for Computing Machinery, New York, NY, USA (2023). https:\/\/doi.org\/10.1145\/3555776.3578730","DOI":"10.1145\/3555776.3578730"},{"key":"5_CR13","doi-asserted-by":"crossref","unstructured":"Harrison, M., Haines, T.: On the applicability of starks to counted-as-collected verification in existing homomorphic e-voting systems. In: Financial Cryptography and Data Security. FC 2024 International Workshops, pp. 50\u201365. Springer, Cham (2025)","DOI":"10.1007\/978-3-031-69231-4_4"},{"key":"5_CR14","doi-asserted-by":"publisher","unstructured":"Heiberg, S., Willemson, J.: Verifiable Internet voting in Estonia. In: Krimmer, R., Volkamer, M. (eds.) 6th International Conference on Electronic Voting: Verifying the Vote, EVOTE 2014, Lochau \/ Bregenz, Austria, October 29\u201331, 2014, pp.\u00a01\u20138. IEEE (2014). https:\/\/doi.org\/10.1109\/EVOTE.2014.7001135","DOI":"10.1109\/EVOTE.2014.7001135"},{"key":"5_CR15","unstructured":"Hopwood, D., Bowe, S., Hornby, T., Wilcox, N.: Zcash protocol specification 2022.3.8 [nu5], Technical report, Electric Coin Company (2022)"},{"issue":"1","key":"5_CR16","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1007\/S102070100002","volume":"1","author":"D Johnson","year":"2001","unstructured":"Johnson, D., Menezes, A., Vanstone, S.A.: The elliptic curve digital signature algorithm (ECDSA). Int. J. Inf. Sec. 1(1), 36\u201363 (2001). https:\/\/doi.org\/10.1007\/S102070100002","journal-title":"Int. J. Inf. Sec."},{"key":"5_CR17","doi-asserted-by":"publisher","unstructured":"Kilian, J.: A note on efficient zero-knowledge proofs and arguments (extended abstract). In: Proceedings of the Twenty-Fourth Annual ACM Symposium on Theory of Computing, pp. 723\u2013732. STOC \u201992, Association for Computing Machinery, New York, NY, USA (1992). https:\/\/doi.org\/10.1145\/129712.129782","DOI":"10.1145\/129712.129782"},{"key":"5_CR18","unstructured":"Lueks, W., Querejeta-Azurmendi, I., Troncoso, C.: VoteAgain: a scalable coercion-resistant voting system. In: 29th USENIX Security Symposium (USENIX Security 20), pp. 1553\u20131570. USENIX Association (2020). https:\/\/www.usenix.org\/conference\/usenixsecurity20\/presentation\/lueks"},{"key":"5_CR19","doi-asserted-by":"publisher","unstructured":"Micali, S.: Cs proofs. In: Proceedings 35th Annual Symposium on Foundations of Computer Science, pp. 436\u2013453 (1994). https:\/\/doi.org\/10.1109\/SFCS.1994.365746","DOI":"10.1109\/SFCS.1994.365746"},{"key":"5_CR20","unstructured":"Mueller, J., Pejo, B., Pryvalov, I.: DeVoS: deniable yet verifiable vote updating. Cryptology ePrint Archive, Paper 2023\/1616 (2023). https:\/\/eprint.iacr.org\/2023\/1616"},{"key":"5_CR21","unstructured":"StarkEx: STARK curve (2025). https:\/\/docs.starkware.co\/starkex\/crypto\/stark-curve.html"},{"issue":"4","key":"5_CR22","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1080\/19393555.2024.2410332","volume":"34","author":"J Vakarjuk","year":"2024","unstructured":"Vakarjuk, J., Snetkov, N., Willemson, J.: Comparing security levels of postal and Internet voting. Inf. Secur. J. Glob. Perspect. 34(4), 265\u2013285 (2024). https:\/\/doi.org\/10.1080\/19393555.2024.2410332","journal-title":"Inf. Secur. J. Glob. Perspect."},{"key":"5_CR23","first-page":"1","volume-title":"Theory of Cryptography","author":"P Valiant","year":"2008","unstructured":"Valiant, P.: Incrementally verifiable computation or proofs of knowledge imply time\/space efficiency. In: Canetti, R. (ed.) Theory of Cryptography, pp. 1\u201318. Springer, Berlin, Heidelberg (2008)"}],"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-032-05036-6_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,10]],"date-time":"2025-09-10T07:22:21Z","timestamp":1757488941000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-05036-6_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,9,11]]},"ISBN":["9783032050359","9783032050366"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-05036-6_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,9,11]]},"assertion":[{"value":"11 September 2025","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":"Nancy","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"France","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"1 October 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3 October 2025","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":"evoteid2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/e-vote-id-2025.inria.fr\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}