{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,20]],"date-time":"2025-06-20T04:08:18Z","timestamp":1750392498185,"version":"3.41.0"},"publisher-location":"Cham","reference-count":19,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031957666","type":"print"},{"value":"9783031957673","type":"electronic"}],"license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"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":[[2025]]},"DOI":"10.1007\/978-3-031-95767-3_2","type":"book-chapter","created":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T12:25:21Z","timestamp":1750335921000},"page":"29-49","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["From ElGamal to\u00a0Lattice-Based: Enhancing Helios Voting with\u00a0Quantum-Safe Cryptography"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0009-0005-9055-6073","authenticated-orcid":false,"given":"Jo\u00e3o Pedro","family":"Cardoso Barbosa","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6962-9347","authenticated-orcid":false,"given":"Gustavo","family":"Zambonin","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8836-1104","authenticated-orcid":false,"given":"Tha\u00eds","family":"Bardini Idalino","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9611-5694","authenticated-orcid":false,"given":"Ricardo Felipe","family":"Cust\u00f3dio","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,6,20]]},"reference":[{"key":"2_CR1","doi-asserted-by":"publisher","unstructured":"Adida, B.: Helios: web-based open-audit voting. In: 17th USENIX Security Symposium, pp. 335\u2013348 (2008). https:\/\/doi.org\/10.5555\/1496711.1496734. https:\/\/www.usenix.org\/legacy\/event\/sec08\/tech\/full_papers\/adida\/adida.pdf","DOI":"10.5555\/1496711.1496734"},{"key":"2_CR2","doi-asserted-by":"publisher","unstructured":"Aranha, D.F., Baum, C., Gj\u00f8steen, K., Silde, T.: Verifiable mix-nets and distributed decryption for voting from lattice-based assumptions. In: CCS 2023: Proceedings of the 2023 ACM SIGSAC Conference on Computer and Communications Security, pp. 1467\u20131481 (2023). https:\/\/doi.org\/10.1145\/3576915.3616683. https:\/\/eprint.iacr.org\/2022\/422","DOI":"10.1145\/3576915.3616683"},{"key":"2_CR3","doi-asserted-by":"publisher","unstructured":"Aranha, D.F., Baum, C., Gj\u00f8steen, K., Silde, T., Tunge, T.: Lattice-based proof of shuffle and applications to electronic voting. In: Paterson, K.G. (ed.) Topics in Cryptology \u2013 CT-RSA 2021. LNCS, vol. 12704, pp. 227\u2013251 (2021). https:\/\/doi.org\/10.1007\/978-3-030-75539-3_10. https:\/\/eprint.iacr.org\/2021\/338","DOI":"10.1007\/978-3-030-75539-3_10"},{"key":"2_CR4","doi-asserted-by":"publisher","unstructured":"Baum, C., Damg\u00e5rd, I., Lyubashevsky, V., Oechsner, S., Peikert, C.: More efficient commitments from structured lattice assumptions. In: Catalano, D., de\u00a0Prisco, R. (eds.) Security and Cryptography for Networks (SCN 2018). LNCS, vol. 11035, pp. 368\u2013385 (2018). https:\/\/doi.org\/10.1007\/978-3-319-98113-0_20. https:\/\/eprint.iacr.org\/2016\/997","DOI":"10.1007\/978-3-319-98113-0_20"},{"key":"2_CR5","doi-asserted-by":"publisher","unstructured":"Boyen, X., Haines, T., M\u00fcller, J.: Epoque: practical end-to-end verifiable post-quantum-secure E-voting. In: 2021 IEEE European Symposium on Security and Privacy (EuroS &P), pp. 272\u2013291 (2021). https:\/\/doi.org\/10.1109\/EuroSP51992.2021.00027. https:\/\/eprint.iacr.org\/2021\/304","DOI":"10.1109\/EuroSP51992.2021.00027"},{"issue":"2","key":"2_CR6","doi-asserted-by":"publisher","first-page":"84","DOI":"10.1145\/358549.358563","volume":"24","author":"DL Chaum","year":"1981","unstructured":"Chaum, D.L.: Untraceable electronic mail, return addresses, and digital pseudonyms. Commun. ACM 24(2), 84\u201390 (1981). https:\/\/doi.org\/10.1145\/358549.358563","journal-title":"Commun. ACM"},{"key":"2_CR7","doi-asserted-by":"publisher","unstructured":"Chillotti, I., Gama, N., Georgieva, M., Izabach\u00e8ne, M.: A homomorphic LWE based E-voting scheme. In: Takagi, T. (ed.) Post-Quantum Cryptography (PQCrypto 2016). LNCS, vol. 9606, pp. 245\u2013265 (2016). https:\/\/doi.org\/10.1007\/978-3-319-29360-8_16. https:\/\/ilachill.github.io\/papers\/CGGI16a-An_homomorphic_LWE_based_E-voting_Scheme.pdf","DOI":"10.1007\/978-3-319-29360-8_16"},{"issue":"5","key":"2_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."},{"issue":"4","key":"2_CR9","doi-asserted-by":"publisher","first-page":"469","DOI":"10.1109\/TIT.1985.1057074","volume":"31","author":"T Elgamal","year":"1985","unstructured":"Elgamal, T.: A public key cryptosystem and a signature scheme based on discrete logarithms. IEEE Trans. Inf. Theory 31(4), 469\u2013472 (1985). https:\/\/doi.org\/10.1109\/TIT.1985.1057074","journal-title":"IEEE Trans. Inf. Theory"},{"key":"2_CR10","doi-asserted-by":"publisher","unstructured":"Gj\u00f8steen, K., Lund, A.S.: An experiment on the security of the Norwegian electronic voting protocol. Ann. Telecommun., 299\u2013307 (2016). https:\/\/doi.org\/10.1007\/s12243-016-0509-8","DOI":"10.1007\/s12243-016-0509-8"},{"key":"2_CR11","doi-asserted-by":"publisher","unstructured":"Lyubashevsky, V.: Fiat-Shamir with aborts: applications to lattice and factoring-based signatures. In: Matsui, M. (ed.) Advances in Cryptology \u2013 ASIACRYPT 2009. LNCS, vol. 5912, pp. 598\u2013616 (2009). https:\/\/doi.org\/10.1007\/978-3-642-10366-7_35. https:\/\/iacr.org\/cryptodb\/data\/paper.php?pubkey=18550","DOI":"10.1007\/978-3-642-10366-7_35"},{"key":"2_CR12","doi-asserted-by":"publisher","unstructured":"Lyubashevsky, V., Neven, G.: One-shot verifiable encryption from lattices. In: Coron, J.S., Nielsen, J.B. (eds.) Advances in Cryptology \u2013 EUROCRYPT 2017. LNCS, vol. 10210, pp. 293\u2013323 (2017). https:\/\/doi.org\/10.1007\/978-3-319-56620-7_11. https:\/\/eprint.iacr.org\/2017\/122","DOI":"10.1007\/978-3-319-56620-7_11"},{"key":"2_CR13","doi-asserted-by":"publisher","unstructured":"Lyubashevsky, V., Seiler, G.: Short, invertible elements in partially splitting cyclotomic rings and applications to lattice-based zero-knowledge proofs. In: Nielsen, J.B., Rijmen, V. (eds.) Advances in Cryptology \u2013 EUROCRYPT 2018. LNCS, vol. 10820, pp. 204\u2013224 (2018). https:\/\/doi.org\/10.1007\/978-3-319-78381-9_8. https:\/\/eprint.iacr.org\/2017\/523","DOI":"10.1007\/978-3-319-78381-9_8"},{"key":"2_CR14","unstructured":"Madise, \u00dc., Martens, T.: E-voting in Estonia 2005. The first practice of country-wide binding Internet voting in the world. In: Krimmer, R. (ed.) Electronic Voting 2006 \u2013 2nd International Workshop, Co-organized by Council of Europe, ESF TED, IFIP WG 8.6 and E-Voting.CC, pp. 15\u201326 (2006). https:\/\/dl.gi.de\/items\/b15050c3-a8ea-46f9-8976-1584b3cf499f"},{"key":"2_CR15","doi-asserted-by":"publisher","unstructured":"Moody, D., Perlner, R., Regenscheid, A., Robinson, A., Cooper, D.: Transition to Post-Quantum Cryptography Standards. NIST Internal Report (Initial Public Draft) 8547, National Institute of Standards and Technology (2024). https:\/\/doi.org\/10.6028\/NIST.IR.8547.ipd","DOI":"10.6028\/NIST.IR.8547.ipd"},{"key":"2_CR16","doi-asserted-by":"publisher","unstructured":"del Pino, R., Lyubashevsky, V., Neven, G., Seiler, G.: Practical quantum-safe voting from lattices. In: CCS 2017: Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security, pp. 1565\u20131581 (2017). https:\/\/doi.org\/10.1145\/3133956.3134101. https:\/\/eprint.iacr.org\/2017\/1235","DOI":"10.1145\/3133956.3134101"},{"issue":"11","key":"2_CR17","doi-asserted-by":"publisher","first-page":"612","DOI":"10.1145\/359168.359176","volume":"22","author":"A Shamir","year":"1979","unstructured":"Shamir, A.: How to share a secret. Commun. ACM 22(11), 612\u2013613 (1979). https:\/\/doi.org\/10.1145\/359168.359176","journal-title":"Commun. ACM"},{"issue":"2","key":"2_CR18","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1137\/S0036144598347011","volume":"41","author":"PW Shor","year":"1999","unstructured":"Shor, P.W.: Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer. SIAM Rev. 41(2), 303\u2013332 (1999). https:\/\/doi.org\/10.1137\/S0036144598347011","journal-title":"SIAM Rev."},{"key":"2_CR19","unstructured":"The FLINT team: FLINT: Fast Library for Number Theory (2025). https:\/\/flintlib.org. Version 3.2.1"}],"container-title":["Lecture Notes in Computer Science","Applied Cryptography and Network Security"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-95767-3_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T13:02:01Z","timestamp":1750338121000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-95767-3_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9783031957666","9783031957673"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-95767-3_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025]]},"assertion":[{"value":"20 June 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"The authors have no competing interests to declare that are relevant to the content of this article.","order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Disclosure of Interests"}},{"value":"ACNS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Applied Cryptography and Network Security","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Munich","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Germany","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":"23 June 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26 June 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"acns2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/acns2025.fordaysec.de\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}