{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T22:33:21Z","timestamp":1777674801754,"version":"3.51.4"},"publisher-location":"Cham","reference-count":64,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031683992","type":"print"},{"value":"9783031684005","type":"electronic"}],"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-68400-5_7","type":"book-chapter","created":{"date-parts":[[2024,8,15]],"date-time":"2024-08-15T23:02:37Z","timestamp":1723762957000},"page":"221-253","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["On Cycles of\u00a0Pairing-Friendly Abelian Varieties"],"prefix":"10.1007","author":[{"given":"Maria","family":"Corte-Real Santos","sequence":"first","affiliation":[]},{"given":"Craig","family":"Costello","sequence":"additional","affiliation":[]},{"given":"Michael","family":"Naehrig","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,8,16]]},"reference":[{"key":"7_CR1","doi-asserted-by":"crossref","unstructured":"Aranha, D.F., El Housni, Y., Guillevic, A.: A survey of elliptic curves for proof systems. Des. Codes Cryptogr. 91(11), 3333\u20133378 (2023)","DOI":"10.1007\/s10623-022-01135-y"},{"key":"7_CR2","doi-asserted-by":"crossref","unstructured":"Barreto, P.S.L.M., Galbraith, S.D., O\u2019hEigeartaigh, C., Scott, M.: Efficient pairing computation on supersingular abelian varieties. Des. Codes Cryptogr. 42(3), 239\u2013271 (2007)","DOI":"10.1007\/s10623-006-9033-6"},{"key":"7_CR3","doi-asserted-by":"publisher","unstructured":"Barreto, P.S.L.M., Lynn, B., Scott, M.: Constructing elliptic curves with prescribed embedding degrees. In: Cimato, S., Persiano, G., Galdi, C. (eds.) SCN 2002. LNCS, vol. 2576, pp. 257\u2013267. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/3-540-36413-7_19","DOI":"10.1007\/3-540-36413-7_19"},{"key":"7_CR4","doi-asserted-by":"publisher","unstructured":"Barreto, P.S.L.M., Naehrig, M.: Pairing-friendly elliptic curves of prime order. In: Preneel, B., Tavares, S. (eds.) SAC 2005. LNCS, vol. 3897, pp. 319\u2013331. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11693383_22","DOI":"10.1007\/11693383_22"},{"key":"7_CR5","doi-asserted-by":"publisher","unstructured":"Bell\u00e9s-Mu\u00f1oz, M., Jim\u00e9nez Urroz, J., Silva, J.: Revisiting cycles of pairing-friendly elliptic curves. In: CRYPTO 2023. LNCS, vol. 14082, pp. 3\u201337. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-38545-2_1","DOI":"10.1007\/978-3-031-38545-2_1"},{"key":"7_CR6","doi-asserted-by":"crossref","unstructured":"Ben-Sasson, E., Chiesa, A., Tromer, E., Virza, M.: Scalable zero knowledge via cycles of elliptic curves. In: CRYPTO 2014. LNCS, vol. 8617, pp. 276\u2013294. Springer, Cham (2014)","DOI":"10.1007\/978-3-662-44381-1_16"},{"key":"7_CR7","doi-asserted-by":"crossref","unstructured":"Bernstein, D.J., Birkner, P., Joye, M., Lange, T., Peters, C.: Twisted Edwards curves. In: AFRICACRYPT 2008. LNCS, vol. 5023, pp. 389\u2013405. Springer, Cham (2008)","DOI":"10.1007\/978-3-540-68164-9_26"},{"key":"7_CR8","doi-asserted-by":"crossref","unstructured":"Bitansky, N., Canetti, R., Chiesa, A., Tromer, E.: Recursive composition and bootstrapping for SNARKS and proof-carrying data. In: STOC 2013, pp. 111\u2013120. ACM (2013)","DOI":"10.1145\/2488608.2488623"},{"key":"7_CR9","doi-asserted-by":"crossref","unstructured":"Blake, I.F., Seroussi, G., Smart, N.P.: Elliptic Curves in Cryptography, vol. 265. Cambridge University Press (1999)","DOI":"10.1017\/CBO9781107360211"},{"key":"7_CR10","doi-asserted-by":"crossref","unstructured":"Blake, I.F., Seroussi, G., Smart, N.P.: Advances in Elliptic Curve Cryptography, vol. 317. Cambridge University Press (2005)","DOI":"10.1017\/CBO9780511546570"},{"key":"7_CR11","doi-asserted-by":"publisher","unstructured":"Boneh, D., Franklin, M.: Identity-based encryption from the Weil pairing. In: Kilian, J. (ed.) CRYPTO 2001. LNCS, vol. 2139, pp. 213\u2013229. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-44647-8_13","DOI":"10.1007\/3-540-44647-8_13"},{"key":"7_CR12","unstructured":"Bowe, S., Grigg, J., Hopwood, D.: Recursive proof composition without a trusted setup (2019). https:\/\/eprint.iacr.org\/2019\/1021"},{"issue":"3","key":"7_CR13","first-page":"269","volume":"1","author":"R Br\u00f6ker","year":"2009","unstructured":"Br\u00f6ker, R.: Constructing supersingular elliptic curves. J. Comb. Number Theory 1(3), 269\u2013273 (2009)","journal-title":"J. Comb. Number Theory"},{"issue":"260","key":"7_CR14","doi-asserted-by":"publisher","first-page":"2161","DOI":"10.1090\/S0025-5718-07-01980-1","volume":"76","author":"R Br\u00f6ker","year":"2007","unstructured":"Br\u00f6ker, R., Stevenhagen, P.: Efficient cm-constructions of elliptic curves over finite fields. Math. Comput. 76(260), 2161\u20132179 (2007)","journal-title":"Math. Comput."},{"key":"7_CR15","doi-asserted-by":"publisher","unstructured":"Cheon, J.H.: Security analysis of the strong Diffie-Hellman problem. In: Vaudenay, S. (ed.) EUROCRYPT 2006. LNCS, vol. 4004, pp. 1\u201311. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11761679_1","DOI":"10.1007\/11761679_1"},{"issue":"2","key":"7_CR16","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1137\/18M1173708","volume":"3","author":"A Chiesa","year":"2019","unstructured":"Chiesa, A., Chua, L., Weidner, M.: On cycles of pairing-friendly elliptic curves. SIAM J. Appl. Algebra Geomet. 3(2), 175\u2013192 (2019)","journal-title":"SIAM J. Appl. Algebra Geomet."},{"key":"7_CR17","doi-asserted-by":"crossref","unstructured":"Costello, C., et al.: Geppetto: versatile verifiable computation. In: IEEE SP, pp. 253\u2013270. IEEE Comp. Soc. (2015)","DOI":"10.1109\/SP.2015.23"},{"key":"7_CR18","doi-asserted-by":"publisher","unstructured":"Freeman, D.: Constructing pairing-friendly elliptic curves with embedding degree 10. In: Hess, F., Pauli, S., Pohst, M. (eds.) ANTS 2006. LNCS, vol. 4076, pp. 452\u2013465. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11792086_32","DOI":"10.1007\/11792086_32"},{"key":"7_CR19","doi-asserted-by":"publisher","unstructured":"Freeman, D.: A generalized Brezing-Weng algorithm for constructing pairing-friendly ordinary Abelian varieties. In: Galbraith, S.D., Paterson, K.G. (eds.) Pairing 2008. LNCS, vol. 5209, pp. 146\u2013163. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-85538-5_11","DOI":"10.1007\/978-3-540-85538-5_11"},{"key":"7_CR20","doi-asserted-by":"publisher","unstructured":"Frey, G.: Applications of arithmetical geometry to cryptographic constructions. In: Jungnickel, D., Niederreiter, H. (eds.) Finite Fields and Applications, pp. 128\u2013161. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/978-3-642-56755-1_13","DOI":"10.1007\/978-3-642-56755-1_13"},{"issue":"5","key":"7_CR21","doi-asserted-by":"publisher","first-page":"1717","DOI":"10.1109\/18.771254","volume":"45","author":"G Frey","year":"1999","unstructured":"Frey, G., M\u00fcller, M., R\u00fcck, H.G.: The Tate pairing and the discrete logarithm applied to elliptic curve cryptosystems. IEEE Tr. Inf. Theory 45(5), 1717\u20131719 (1999)","journal-title":"IEEE Tr. Inf. Theory"},{"key":"7_CR22","doi-asserted-by":"crossref","unstructured":"S. D. Galbraith. Supersingular curves in cryptography. In: ASIACRYPT 2001. LNCS, vol. 2248, pp. 495\u2013513. Springer, Cham (2001)","DOI":"10.1007\/3-540-45682-1_29"},{"key":"7_CR23","doi-asserted-by":"crossref","unstructured":"Galbraith, S.D., Lin, X., Scott, M.: Endomorphisms for faster elliptic curve cryptography on a large class of curves. In: EUROCRYPT 2009. LNCS, vol. 5479, pp. 518\u2013535. Springer, Cham (2009)","DOI":"10.1007\/978-3-642-01001-9_30"},{"key":"7_CR24","doi-asserted-by":"crossref","unstructured":"Galbraith, S.D., Pujol\u00e0s, J., Ritzenthaler, C., Smith, B.: Distortion maps for supersingular genus two curves. J. Math. Cryptol. 3(1), 1\u201318 (2009)","DOI":"10.1515\/JMC.2009.001"},{"key":"7_CR25","doi-asserted-by":"crossref","unstructured":"Galbraith, S.D., Scott, M.: Exponentiation in pairing-friendly groups using homomorphisms. In: Pairing 2008. LNCS, vol. 5209, pp. 211\u2013224. Springer, Cham (2008)","DOI":"10.1007\/978-3-540-85538-5_15"},{"issue":"257","key":"7_CR26","doi-asserted-by":"publisher","first-page":"475","DOI":"10.1090\/S0025-5718-06-01900-4","volume":"76","author":"P Gaudry","year":"2007","unstructured":"Gaudry, P., Thom\u00e9, E., Th\u00e9riault, N., Diem, C.: A double large prime variation for small genus hyperelliptic index calculus. Math. Comput. 76(257), 475\u2013492 (2007)","journal-title":"Math. Comput."},{"key":"7_CR27","doi-asserted-by":"publisher","unstructured":"Groth, J.: Simulation-sound NIZK proofs for a practical language and constant size group signatures. In: Lai, X., Chen, K. (eds.) ASIACRYPT 2006. LNCS, vol. 4284, pp. 444\u2013459. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11935230_29","DOI":"10.1007\/11935230_29"},{"key":"7_CR28","doi-asserted-by":"publisher","unstructured":"Groth, J.: Short pairing-based non-interactive zero-knowledge arguments. In: Abe, M. (ed.) ASIACRYPT 2010. LNCS, vol. 6477, pp. 321\u2013340. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-17373-8_19","DOI":"10.1007\/978-3-642-17373-8_19"},{"key":"7_CR29","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":"7_CR30","doi-asserted-by":"publisher","unstructured":"Groth, J., Ostrovsky, R., Sahai, A.: Non-interactive zaps and new techniques for NIZK. In: Dwork, C. (ed.) CRYPTO 2006. LNCS, vol. 4117, pp. 97\u2013111. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11818175_6","DOI":"10.1007\/11818175_6"},{"key":"7_CR31","doi-asserted-by":"publisher","unstructured":"Groth, J., Sahai, A.: Efficient non-interactive proof systems for bilinear groups. In: Smart, N. (ed.) EUROCRYPT 2008. LNCS, vol. 4965, pp. 415\u2013432. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-78967-3_24","DOI":"10.1007\/978-3-540-78967-3_24"},{"key":"7_CR32","unstructured":"IEEE P1363\u00a0Working Group. Standard specifications for public-key cryptography. IEEE Std 1363-2000 (2000)"},{"key":"7_CR33","unstructured":"Guillevic, A.: Pairing-friendly curves (2021). https:\/\/members.loria.fr\/AGuillevic\/pairing-friendly-curves\/"},{"issue":"1\u20132","key":"7_CR34","first-page":"83","volume":"20","author":"T Honda","year":"1968","unstructured":"Honda, T.: Isogeny classes of abelian varieties over finite fields. J. Math. Soc. Japan 20(1\u20132), 83\u201395 (1968)","journal-title":"J. Math. Soc. Japan"},{"key":"7_CR35","doi-asserted-by":"publisher","unstructured":"El Housni, Y., Guillevic, A.: Families of\u00a0SNARK-friendly 2-chains of\u00a0elliptic curves. In: Dunkelman, O., Dziembowski, S. (eds.) EUROCRYPT 2022. LNCS, vol. 13276, pp. 367\u2013396. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-07085-3_13","DOI":"10.1007\/978-3-031-07085-3_13"},{"key":"7_CR36","doi-asserted-by":"publisher","first-page":"239","DOI":"10.5802\/aif.2430","volume":"59","author":"EW Howe","year":"2009","unstructured":"Howe, E.W., Nart, E., Ritzenthaler, C.: Jacobians in isogeny classes of abelian surfaces over finite fields. Annal. l\u2019Institut Fourier 59, 239\u2013289 (2009)","journal-title":"Annal. l\u2019Institut Fourier"},{"key":"7_CR37","doi-asserted-by":"publisher","unstructured":"Joux, A.: A one round protocol for tripartite Diffie\u2013Hellman. In: Bosma, W. (ed.) ANTS 2000. LNCS, vol. 1838, pp. 385\u2013393. Springer, Heidelberg (2000). https:\/\/doi.org\/10.1007\/10722028_23","DOI":"10.1007\/10722028_23"},{"issue":"4","key":"7_CR38","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1007\/s00145-003-0052-4","volume":"16","author":"A Joux","year":"2003","unstructured":"Joux, A., Nguyen, K.: Separating decision Diffie-Hellman from computational Diffie-Hellman in cryptographic groups. J. Cryptol. 16(4), 239\u2013247 (2003)","journal-title":"J. Cryptol."},{"key":"7_CR39","doi-asserted-by":"publisher","unstructured":"Karabina, K., Teske, E.: On prime-order elliptic curves with embedding degrees k\u2009=\u20093, 4, and 6. In: van der Poorten, A.J., Stein, A. (eds.) ANTS 2008. LNCS, vol. 5011, pp. 102\u2013117. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-79456-1_6","DOI":"10.1007\/978-3-540-79456-1_6"},{"key":"7_CR40","doi-asserted-by":"crossref","unstructured":"Koblitz, N.: Hyperelliptic cryptosystems. J. Cryptol. 1, 139\u2013150 (1989)","DOI":"10.1007\/BF02252872"},{"key":"7_CR41","doi-asserted-by":"publisher","unstructured":"Koblitz, N., Menezes, A.: Pairing-based cryptography at high security levels. In: Smart, N.P. (ed.) Cryptography and Coding 2005. LNCS, vol. 3796, pp. 13\u201336. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11586821_2","DOI":"10.1007\/11586821_2"},{"key":"7_CR42","doi-asserted-by":"publisher","unstructured":"Lee, J.: Dory: efficient, transparent arguments for generalised inner products and polynomial commitments. In: Nissim, K., Waters, B. (eds.) TCC 2021. LNCS, vol. 13043, pp. 1\u201334. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-90453-1_1","DOI":"10.1007\/978-3-030-90453-1_1"},{"issue":"3","key":"7_CR43","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1080\/10586458.2002.10504478","volume":"11","author":"D Maisner","year":"2002","unstructured":"Maisner, D., Nart, E., Howe, E.W.: Abelian surfaces over finite fields as jacobians. Exp. Math. 11(3), 321\u2013337 (2002)","journal-title":"Exp. Math."},{"key":"7_CR44","doi-asserted-by":"crossref","unstructured":"Menezes, A., Vanstone, S.A., Okamoto, T.: Reducing elliptic curve logarithms to logarithms in a finite field. In: STOC, pp. 80\u201389. ACM (1991)","DOI":"10.1145\/103418.103434"},{"key":"7_CR45","doi-asserted-by":"publisher","unstructured":"Miyaji, A., Nakabayashi, M., Takano, S.: Characterization of elliptic curve traces under FR-reduction. In: Won, D. (ed.) ICISC 2000. LNCS, vol. 2015, pp. 90\u2013108. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-45247-8_8","DOI":"10.1007\/3-540-45247-8_8"},{"issue":"177","key":"7_CR46","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1090\/S0025-5718-1987-0866113-7","volume":"48","author":"PL Montgomery","year":"1987","unstructured":"Montgomery, P.L.: Speeding the Pollard and elliptic curve methods of factorization. Math. Comput. 48(177), 243\u2013264 (1987)","journal-title":"Math. Comput."},{"key":"7_CR47","unstructured":"Morain, F.: Classes d\u2019isomorphismes des courbes elliptiques supersinguli\u00e8res en caract\u00e9ristique $$\\ge 3$$. Utilitas Math. 52 (1997)"},{"issue":"143","key":"7_CR48","first-page":"918","volume":"32","author":"JM Pollard","year":"1978","unstructured":"Pollard, J.M.: Monte Carlo methods for index computation (mod $$p$$). Math. Comput. 32(143), 918\u2013924 (1978)","journal-title":"Math. Comput."},{"key":"7_CR49","doi-asserted-by":"crossref","unstructured":"Rubin, K., Silverberg, A.: Supersingular abelian varieties in cryptology. In: CRYPTO 2002. LNCS, vol. 2442, pp. 336\u2013353. Springer, Cham (2002)","DOI":"10.1007\/3-540-45708-9_22"},{"issue":"3","key":"7_CR50","doi-asserted-by":"publisher","first-page":"330","DOI":"10.1007\/s00145-008-9022-1","volume":"22","author":"K Rubin","year":"2009","unstructured":"Rubin, K., Silverberg, A.: Using abelian varieties to improve pairing-based cryptography. J. Cryptol. 22(3), 330\u2013364 (2009)","journal-title":"J. Cryptol."},{"key":"7_CR51","unstructured":"Sakai, R., Ohgishi, K., Kasahara, M.: Cryptosystems based on pairing. In: SCIS (2000)"},{"key":"7_CR52","doi-asserted-by":"publisher","unstructured":"Scott, M., Benger, N., Charlemagne, M., Dominguez Perez, L.J., Kachisa, E.J.: Fast Hashing to G <Subscript>2<\/Subscript> on pairing-friendly curves. In: Shacham, H., Waters, B. (eds.) Pairing 2009. LNCS, vol. 5671, pp. 102\u2013113. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-03298-1_8","DOI":"10.1007\/978-3-642-03298-1_8"},{"key":"7_CR53","doi-asserted-by":"publisher","unstructured":"Scott, M., Benger, N., Charlemagne, M., Dominguez Perez, L.J., Kachisa, E.J.: On the final exponentiation for calculating pairings on ordinary elliptic curves. In: Shacham, H., Waters, B. (eds.) Pairing 2009. LNCS, vol. 5671, pp. 78\u201388. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-03298-1_6","DOI":"10.1007\/978-3-642-03298-1_6"},{"key":"7_CR54","doi-asserted-by":"crossref","unstructured":"Silverman, J.H.: The Arithmetic of Elliptic Curves, vol. 106. Springer, New York (2009)","DOI":"10.1007\/978-0-387-09494-6"},{"issue":"3","key":"7_CR55","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1080\/10586458.2011.565253","volume":"20","author":"JH Silverman","year":"2011","unstructured":"Silverman, J.H., Stange, K.E.: Amicable pairs and aliquot cycles for elliptic curves. Exp. Math. 20(3), 329\u2013357 (2011)","journal-title":"Exp. Math."},{"key":"7_CR56","doi-asserted-by":"publisher","unstructured":"Stam, M., Lenstra, A.K.: Efficient subgroup exponentiation in quadratic and sixth degree extensions. In: Kaliski, B.S., Ko\u00e7, K., Paar, C. (eds.) CHES 2002. LNCS, vol. 2523, pp. 318\u2013332. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/3-540-36400-5_24","DOI":"10.1007\/3-540-36400-5_24"},{"issue":"273","key":"7_CR57","doi-asserted-by":"publisher","first-page":"501","DOI":"10.1090\/S0025-5718-2010-02373-7","volume":"80","author":"AV Sutherland","year":"2011","unstructured":"Sutherland, A.V.: Computing hilbert class polynomials with the Chinese remainder theorem. Math. Comput. 80(273), 501\u2013538 (2011)","journal-title":"Math. Comput."},{"key":"7_CR58","doi-asserted-by":"publisher","unstructured":"Tate, J.: Classes d\u2019isog\u00e9nie des vari\u00e9t\u00e9s ab\u00e9liennes sur un corps fini (d\u2019apr\u00e8s t. honda). In: S\u00e9minaire Bourbaki, vol. 1968\/69 Expos\u00e9s 347\u2013363, pp. 95\u2013110. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/BFb0058807","DOI":"10.1007\/BFb0058807"},{"key":"7_CR59","doi-asserted-by":"publisher","unstructured":"Teruya, T., Saito, K., Kanayama, N., Kawahara, Y., Kobayashi, T., Okamoto, E.: Constructing symmetric pairings over supersingular elliptic curves with embedding degree three. In: Pairing 2013. LNCS, vol. 8365, pp. 97\u2013112. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-319-04873-4_6","DOI":"10.1007\/978-3-319-04873-4_6"},{"key":"7_CR60","doi-asserted-by":"crossref","unstructured":"Thaler, J.: Proofs, arguments, and zero-knowledge (2023). https:\/\/people.cs.georgetown.edu\/jthaler\/ProofsArgsAndZK.pdf","DOI":"10.1561\/9781638281252"},{"key":"7_CR61","doi-asserted-by":"crossref","unstructured":"Valiant, P.: Incrementally verifiable computation or proofs of knowledge imply time\/space efficiency. In: TCC. LNCS, vol. 4948, pp. 1\u201318. Springer, Heidelberg (2008)","DOI":"10.1007\/978-3-540-78524-8_1"},{"issue":"4","key":"7_CR62","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1007\/s00145-004-0313-x","volume":"17","author":"ER Verheul","year":"2004","unstructured":"Verheul, E.R.: Evidence that XTR is more secure than supersingular elliptic curve cryptosystems. J. Cryptol. 17(4), 277\u2013296 (2004)","journal-title":"J. Cryptol."},{"key":"7_CR63","doi-asserted-by":"publisher","first-page":"521","DOI":"10.24033\/asens.1183","volume":"2","author":"WC Waterhouse","year":"1969","unstructured":"Waterhouse, W.C.: Abelian varieties over finite fields. Annales Scientifiques de l\u2019\u00c9cole Normale Sup\u00e9rieure 2, 521\u2013560 (1969)","journal-title":"Annales Scientifiques de l\u2019\u00c9cole Normale Sup\u00e9rieure"},{"issue":"2","key":"7_CR64","doi-asserted-by":"publisher","first-page":"292","DOI":"10.1006\/jnth.1999.2463","volume":"81","author":"HJ Zhu","year":"2000","unstructured":"Zhu, H.J.: Group structures of elementary supersingular abelian varieties over finite fields. J. Number Theory 81(2), 292\u2013309 (2000)","journal-title":"J. Number Theory"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 CRYPTO 2024"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-68400-5_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,8,15]],"date-time":"2024-08-15T23:04:11Z","timestamp":1723763051000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-68400-5_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031683992","9783031684005"],"references-count":64,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-68400-5_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"16 August 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CRYPTO","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Annual International Cryptology Conference","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Santa Barbara, CA","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18 August 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22 August 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"44","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"crypto2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/crypto.iacr.org\/2024\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}