{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,27]],"date-time":"2026-01-27T22:03:36Z","timestamp":1769551416597,"version":"3.49.0"},"publisher-location":"Cham","reference-count":31,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032067531","type":"print"},{"value":"9783032067548","type":"electronic"}],"license":[{"start":{"date-parts":[[2025,10,2]],"date-time":"2025-10-02T00:00:00Z","timestamp":1759363200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,10,2]],"date-time":"2025-10-02T00:00:00Z","timestamp":1759363200000},"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":[[2026]]},"DOI":"10.1007\/978-3-032-06754-8_4","type":"book-chapter","created":{"date-parts":[[2025,10,1]],"date-time":"2025-10-01T08:24:24Z","timestamp":1759307064000},"page":"109-129","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Fast Elliptic Curve Scalar Multiplications in\u00a0SN(T)ARK Circuits"],"prefix":"10.1007","author":[{"given":"Liam","family":"Eagen","sequence":"first","affiliation":[]},{"given":"Youssef El","family":"Housni","sequence":"additional","affiliation":[]},{"given":"Simon","family":"Masson","sequence":"additional","affiliation":[]},{"given":"Thomas","family":"Piellard","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,10,2]]},"reference":[{"key":"4_CR1","unstructured":"Ambrona, M., Firsov, D., Querejeta-Azurmendi, I.: Efficient foreign-field arithmetic in PLONK. Cryptology ePrint Archive, Paper 2025\/695 (2025). https:\/\/eprint.iacr.org\/2025\/695"},{"key":"4_CR2","doi-asserted-by":"publisher","unstructured":"Antipa, A., Brown, D.R.L., Gallant, R., Lambert, R., Struik, R., Vanstone, S.A.: Accelerated verification of ECDSA signatures. In: Preneel, B., Tavares, S. (eds.) SAC 2005. LNCS, vol. 3897, pp. 307\u2013318. Springer, Berlin, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11693383_21","DOI":"10.1007\/11693383_21"},{"issue":"11","key":"4_CR3","doi-asserted-by":"publisher","first-page":"3333","DOI":"10.1007\/s10623-022-01135-y","volume":"91","author":"DF Aranha","year":"2023","unstructured":"Aranha, D.F., El Housni, Y., Guillevic, A.: A survey of elliptic curves for proof systems. DCC 91(11), 3333\u20133378 (2023). https:\/\/doi.org\/10.1007\/s10623-022-01135-y","journal-title":"DCC"},{"key":"4_CR4","doi-asserted-by":"publisher","unstructured":"Bernstein, D.J., Doumen, J., Lange, T., Oosterwijk, J.J.: Faster batch forgery identification. In: Galbraith, S.D., Nandi, M. (eds.) INDOCRYPT 2012. LNCS, vol. 7668, pp. 454\u2013473. Springer, Berlin, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-34931-7_26","DOI":"10.1007\/978-3-642-34931-7_26"},{"key":"4_CR5","doi-asserted-by":"publisher","unstructured":"Bitansky, N., Canetti, R., Chiesa, A., Tromer, E.: From extractable collision resistance to succinct non-interactive arguments of knowledge, and back again. In: Goldwasser, S. (ed.) ITCS 2012, pp. 326\u2013349. ACM (January 2012). https:\/\/doi.org\/10.1145\/2090236.2090263","DOI":"10.1145\/2090236.2090263"},{"key":"4_CR6","doi-asserted-by":"publisher","unstructured":"Botrel, G., Piellard, T., El\u00a0Housni, Y., Kubjas, I.: Consensys\/gnark: v0.12.0 (January 2025). https:\/\/doi.org\/10.5281\/zenodo.5819104","DOI":"10.5281\/zenodo.5819104"},{"key":"4_CR7","unstructured":"Bowe, S.: BLS12-381: new zk-SNARK elliptic curve construction. Zcash blog (2017). https:\/\/blog.z.cash\/new-snark-curve\/"},{"key":"4_CR8","doi-asserted-by":"publisher","unstructured":"Bowe, S., Chiesa, A., Green, M., Miers, I., Mishra, P., Wu, H.: ZEXE: enabling decentralized private computation. In: 2020 IEEE Symposium on Security and Privacy, pp. 947\u2013964. IEEE Computer Society Press (May 2020). https:\/\/doi.org\/10.1109\/SP40000.2020.00050","DOI":"10.1109\/SP40000.2020.00050"},{"key":"4_CR9","unstructured":"Bowe, S., Grigg, J., Hopwood, D.: Halo: recursive proof composition without a trusted setup. Cryptology ePrint Archive, Report 2019\/1021 (2019). https:\/\/eprint.iacr.org\/2019\/1021"},{"key":"4_CR10","doi-asserted-by":"publisher","unstructured":"Eisentr\u00e4ger, K., Lauter, K., Montgomery, P.L.: Fast elliptic curve arithmetic and improved Weil pairing evaluation. In: Joye, M. (ed.) CT-RSA 2003. LNCS, vol. 2612, pp. 343\u2013354. Springer, Berlin, Heidelberg (2003). https:\/\/doi.org\/10.1007\/3-540-36563-X_24","DOI":"10.1007\/3-540-36563-X_24"},{"key":"4_CR11","doi-asserted-by":"publisher","unstructured":"El Housni, Y., Guillevic, A.: Optimized and secure pairing-friendly elliptic curves suitable for one layer proof composition. In: Krenn, S., Shulman, H., Vaudenay, S. (eds.) CANS 20. LNCS, vol. 12579, pp. 259\u2013279. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-65411-5_13","DOI":"10.1007\/978-3-030-65411-5_13"},{"key":"4_CR12","doi-asserted-by":"publisher","unstructured":"ElGamal, T.: On computing logarithms over finite fields. In: Williams, H.C. (ed.) CRYPTO\u201985. LNCS, vol. 218, pp. 396\u2013402. Springer, Berlin, Heidelberg (1986). https:\/\/doi.org\/10.1007\/3-540-39799-X_28","DOI":"10.1007\/3-540-39799-X_28"},{"key":"4_CR13","unstructured":"Gabizon, A., Williamson, Z.J., Ciobotaru, O.: PLONK: permutations over Lagrange-bases for oecumenical noninteractive arguments of knowledge. Cryptology ePrint Archive, Report 2019\/953 (2019). https:\/\/eprint.iacr.org\/2019\/953"},{"key":"4_CR14","doi-asserted-by":"publisher","unstructured":"Galbraith, S.D., Lin, X., Scott, M.: Endomorphisms for faster elliptic curve cryptography on a large class of curves. In: Joux, A. (ed.) EUROCRYPT 2009. LNCS, vol. 5479, pp. 518\u2013535. Springer, Berlin, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-01001-9_30","DOI":"10.1007\/978-3-642-01001-9_30"},{"issue":"3","key":"4_CR15","doi-asserted-by":"publisher","first-page":"446","DOI":"10.1007\/s00145-010-9065-y","volume":"24","author":"SD Galbraith","year":"2010","unstructured":"Galbraith, S.D., Lin, X., Scott, M.: Endomorphisms for faster elliptic curve cryptography on a large class of curves. J. Cryptol. 24(3), 446\u2013469 (2010). https:\/\/doi.org\/10.1007\/s00145-010-9065-y","journal-title":"J. Cryptol."},{"key":"4_CR16","doi-asserted-by":"publisher","unstructured":"Gallant, R.P., Lambert, R.J., Vanstone, S.A.: Faster point multiplication on elliptic curves with efficient endomorphisms. In: Kilian, J. (ed.) CRYPTO 2001. LNCS, vol. 2139, pp. 190\u2013200. Springer, Berlin, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-44647-8_11","DOI":"10.1007\/3-540-44647-8_11"},{"key":"4_CR17","doi-asserted-by":"publisher","unstructured":"Gentry, C., Wichs, D.: Separating succinct non-interactive arguments from all falsifiable assumptions. In: Fortnow, L., Vadhan, S.P. (eds.) 43rd ACM STOC, pp. 99\u2013108. ACM Press (2011).https:\/\/doi.org\/10.1145\/1993636.1993651","DOI":"10.1145\/1993636.1993651"},{"issue":"1","key":"4_CR18","doi-asserted-by":"publisher","first-page":"186","DOI":"10.1137\/0218012","volume":"18","author":"S Goldwasser","year":"1989","unstructured":"Goldwasser, S., Micali, S., Rackoff, C.: The knowledge complexity of interactive proof systems. SIAM J. Comput. 18(1), 186\u2013208 (1989). https:\/\/doi.org\/10.1137\/0218012","journal-title":"SIAM J. Comput."},{"key":"4_CR19","doi-asserted-by":"publisher","unstructured":"Groth, J.: On the size of pairing-based non-interactive arguments. In: Fischlin, M., Coron, J.-S. (eds.) EUROCRYPT 2016. LNCS, vol. 9666, pp. 305\u2013326. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-49896-5_11","DOI":"10.1007\/978-3-662-49896-5_11"},{"key":"4_CR20","doi-asserted-by":"publisher","unstructured":"Kilian, J.: A note on efficient zero-knowledge proofs and arguments (extended abstract). In: 24th ACM STOC, pp. 723\u2013732. ACM Press (May 1992). https:\/\/doi.org\/10.1145\/129712.129782","DOI":"10.1145\/129712.129782"},{"key":"4_CR21","unstructured":"Kosba, A., et al.: C$$\\emptyset $$c$$\\emptyset $$: a framework for building composable zero-knowledge proofs. Cryptology ePrint Archive, Report 2015\/1093 (2015). https:\/\/eprint.iacr.org\/2015\/1093"},{"key":"4_CR22","unstructured":"Kubjas, I.: Notes about optimizing emulated pairing (part 1) (2023). https:\/\/hackmd.io\/@ivokub\/SyJRV7ye2"},{"key":"4_CR23","doi-asserted-by":"crossref","unstructured":"Lenstra, H.j., Lenstra, A., Lov\u00e1sz, L.: Factoring polynomials with rational coefficients. Math. Annal. 261, 515\u2013534 (1982). http:\/\/eudml.org\/doc\/182903","DOI":"10.1007\/BF01457454"},{"issue":"12","key":"4_CR24","doi-asserted-by":"publisher","first-page":"4131","DOI":"10.1007\/s10623-024-01472-0","volume":"92","author":"S Masson","year":"2024","unstructured":"Masson, S., Sanso, A., Zhang, Z.: Bandersnatch: a fast elliptic curve built over the bls12-381 scalar field. DCC 92(12), 4131\u20134143 (2024). https:\/\/doi.org\/10.1007\/s10623-024-01472-0","journal-title":"DCC"},{"key":"4_CR25","doi-asserted-by":"publisher","unstructured":"Micali, S.: CS proofs (extended abstracts). In: 35th FOCS, pp. 436\u2013453. IEEE Computer Society Press (1994). https:\/\/doi.org\/10.1109\/SFCS.1994.365746","DOI":"10.1109\/SFCS.1994.365746"},{"key":"4_CR26","doi-asserted-by":"publisher","unstructured":"Nguyen, P.Q., Stehl\u00e9, D.: Low-dimensional lattice basis reduction revisited. ACM Trans. Algorithms 5(4) (2009). https:\/\/doi.org\/10.1145\/1597036.1597050","DOI":"10.1145\/1597036.1597050"},{"key":"4_CR27","unstructured":"Prover, L.: Linea prover documentation. Cryptology ePrint Archive, Paper 2022\/1633 (2022). https:\/\/eprint.iacr.org\/2022\/1633"},{"key":"4_CR28","doi-asserted-by":"publisher","unstructured":"de Rooij, P.: Efficient exponentiation using procomputation and vector addition chains, pp. 389\u2013399 (1995). https:\/\/doi.org\/10.1007\/BFb0053453","DOI":"10.1007\/BFb0053453"},{"key":"4_CR29","doi-asserted-by":"publisher","unstructured":"Silverman, J.H.: The Arithmetic of Elliptic Curves, Graduate Texts in Mathematics, vol.\u00a0106. Springer, New York (1986). https:\/\/doi.org\/10.1007\/978-0-387-09494-6","DOI":"10.1007\/978-0-387-09494-6"},{"issue":"114","key":"4_CR30","first-page":"806","volume":"70","author":"EG Strauss","year":"1964","unstructured":"Strauss, E.G.: Addition chains of vectors (problem 5125). Amer. Math. Monthly 70(114), 806\u2013808 (1964)","journal-title":"Amer. Math. Monthly"},{"key":"4_CR31","unstructured":"ZCash: What is jubjub? (2021). https:\/\/z.cash\/technology\/jubjub\/"}],"container-title":["Lecture Notes in Computer Science","Progress in Cryptology \u2013 LATINCRYPT 2025"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-06754-8_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,1]],"date-time":"2025-10-01T08:24:31Z","timestamp":1759307071000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-06754-8_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,10,2]]},"ISBN":["9783032067531","9783032067548"],"references-count":31,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-06754-8_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,10,2]]},"assertion":[{"value":"2 October 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"LATINCRYPT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Cryptology and Information Security in Latin America","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Medell\u00edn","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Colombia","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":"9","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"latincrypt2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/ciencias.medellin.unal.edu.co\/eventos\/latincrypt\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}