{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,20]],"date-time":"2026-05-20T14:07:40Z","timestamp":1779286060775,"version":"3.51.4"},"publisher-location":"Cham","reference-count":48,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032267368","type":"print"},{"value":"9783032267375","type":"electronic"}],"license":[{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"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-26737-5_4","type":"book-chapter","created":{"date-parts":[[2026,5,20]],"date-time":"2026-05-20T13:17:12Z","timestamp":1779283032000},"page":"92-120","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Revisiting Subgroup Membership Testing on\u00a0Pairing-Friendly Curves via\u00a0the\u00a0Tate Pairing"],"prefix":"10.1007","author":[{"given":"Yu","family":"Dai","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Debiao","family":"He","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dimitri","family":"Koshelev","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Cong","family":"Peng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhijian","family":"Yang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2026,5,21]]},"reference":[{"key":"4_CR1","unstructured":"Aranha, D.F., Gouv\u00eaa, C.P.L.: RELIC is an efficient library for cryptography. https:\/\/github.com\/relic-toolkit\/relic"},{"key":"4_CR2","doi-asserted-by":"publisher","unstructured":"Aranha, D.F., Fotiadis, G., Guillevic, A.: A short-list of pairing-friendly curves resistant to the special TNFS algorithm at the 192-bit security level. IACR Communications in Cryptology 1(3) (2024). https:\/\/doi.org\/10.62056\/angyl86bm","DOI":"10.62056\/angyl86bm"},{"key":"4_CR3","doi-asserted-by":"publisher","unstructured":"Aranha, D.F., Hvass, B.S., Spitters, B., Tibouchi, M.: Faster constant-time evaluation of the Kronecker symbol with application to elliptic curve hashing. In: ACM SIGSAC Conference on Computer and Communications Security \u2013 CCS 2023, pp. 3228\u20133238. Association for Computing Machinery, New York (2023). https:\/\/doi.org\/10.1145\/3576915.3616597","DOI":"10.1145\/3576915.3616597"},{"issue":"6","key":"4_CR4","doi-asserted-by":"publisher","first-page":"605","DOI":"10.1109\/TDSC.2015.2507120","volume":"14","author":"R Azarderakhsh","year":"2017","unstructured":"Azarderakhsh, R., Fishbein, D., Grewal, G., Hu, S., Jao, D., Longa, P., Verma, R.: Fast software implementations of bilinear pairings. IEEE Trans. Dependable Secure Comput. 14(6), 605\u2013619 (2017). https:\/\/doi.org\/10.1109\/TDSC.2015.2507120","journal-title":"IEEE Trans. Dependable Secure Comput."},{"key":"4_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1007\/978-3-662-48800-3_2","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2015","author":"R Barbulescu","year":"2015","unstructured":"Barbulescu, R., Gaudry, P., Kleinjung, T.: The tower number field sieve. In: Iwata, T., Cheon, J.H. (eds.) ASIACRYPT 2015. LNCS, vol. 9453, pp. 31\u201355. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-48800-3_2"},{"key":"4_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1007\/978-3-319-22174-8_14","volume-title":"Progress in Cryptology \u2013 LATINCRYPT 2015","author":"PSLM Barreto","year":"2015","unstructured":"Barreto, P.S.L.M., Costello, C., Misoczki, R., Naehrig, M., Pereira, G.C.C.F., Zanon, G.: Subgroup security in pairing-based cryptography. In: Lauter, K., Rodr\u00edguez-Henr\u00edquez, F. (eds.) LATINCRYPT 2015. LNCS, vol. 9230, pp. 245\u2013265. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-22174-8_14"},{"key":"4_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"354","DOI":"10.1007\/3-540-45708-9_23","volume-title":"Advances in Cryptology \u2014 CRYPTO 2002","author":"PSLM Barreto","year":"2002","unstructured":"Barreto, P.S.L.M., Kim, H.Y., Lynn, B., Scott, M.: Efficient algorithms for pairing-based cryptosystems. In: Yung, M. (ed.) CRYPTO 2002. LNCS, vol. 2442, pp. 354\u2013369. Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/3-540-45708-9_23"},{"key":"4_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1007\/978-3-540-24654-1_2","volume-title":"Selected Areas in Cryptography","author":"PSLM Barreto","year":"2004","unstructured":"Barreto, P.S.L.M., Lynn, B., Scott, M.: On the selection of pairing-friendly groups. In: Matsui, M., Zuccherato, R.J. (eds.) SAC 2003. LNCS, vol. 3006, pp. 17\u201325. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-24654-1_2"},{"key":"4_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"417","DOI":"10.1007\/978-3-642-17455-1_26","volume-title":"Pairing-Based Cryptography - Pairing 2010","author":"J Boxall","year":"2010","unstructured":"Boxall, J., El Mrabet, N., Laguillaumie, F., Le, D.-P.: A variant of miller\u2019s formula and algorithm. In: Joye, M., Miyaji, A., Otsuka, A. (eds.) Pairing 2010. LNCS, vol. 6487, pp. 417\u2013434. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-17455-1_26"},{"issue":"1","key":"4_CR10","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1007\/s10623-004-3808-4","volume":"37","author":"F Brezing","year":"2005","unstructured":"Brezing, F., Weng, A.: Elliptic curves suitable for pairing based cryptography. Des. Codes Crypt. 37(1), 133\u2013141 (2005). https:\/\/doi.org\/10.1007\/s10623-004-3808-4","journal-title":"Des. Codes Crypt."},{"key":"4_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"280","DOI":"10.1007\/978-3-030-65411-5_14","volume-title":"Cryptology and Network Security","author":"R Clarisse","year":"2020","unstructured":"Clarisse, R., Duquesne, S., Sanders, O.: Curves with fast computations in the first pairing group. In: Krenn, S., Shulman, H., Vaudenay, S. (eds.) CANS 2020. LNCS, vol. 12579, pp. 280\u2013298. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-65411-5_14"},{"key":"4_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"92","DOI":"10.1007\/978-3-642-14712-8_6","volume-title":"Progress in Cryptology \u2013 LATINCRYPT 2010","author":"C Costello","year":"2010","unstructured":"Costello, C., Stebila, D.: Fixed argument pairings. In: Abdalla, M., Barreto, P.S.L.M. (eds.) LATINCRYPT 2010. LNCS, vol. 6212, pp. 92\u2013108. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-14712-8_6"},{"key":"4_CR13","doi-asserted-by":"publisher","unstructured":"Dai, Y., He, D., Peng, C., Yang, Z., Zhao, C.A.: Revisiting pairing-friendly curves with embedding degrees 10 and 14. In: Chung, K.M., Sasaki, Y. (eds.) Advances in Cryptology \u2013 ASIACRYPT 2024. LNCS,vol. 15485, pp. 454\u2013485. Springer, Singapore (2025). https:\/\/doi.org\/10.1007\/978-981-96-0888-1_15","DOI":"10.1007\/978-981-96-0888-1_15"},{"issue":"10","key":"4_CR14","doi-asserted-by":"publisher","first-page":"3141","DOI":"10.1007\/s10623-023-01223-7","volume":"91","author":"Y Dai","year":"2023","unstructured":"Dai, Y., Lin, K., Zhao, C.A., Zhou, Z.: Fast subgroup membership testings for $$\\mathbb{G} _1$$, $$\\mathbb{G} _2$$ and $$\\mathbb{G} _{T}$$ on pairing-friendly curves. Des. Codes Crypt. 91(10), 3141\u20133166 (2023). https:\/\/doi.org\/10.1007\/s10623-023-01223-7","journal-title":"Des. Codes Crypt."},{"key":"4_CR15","doi-asserted-by":"publisher","unstructured":"Dai, Y., Zhang, F., Zhao, C.A.: Don\u2019t forget pairing-friendly curves with odd prime embedding degrees. IACR Trans. Cryptographic Hardware Embedded Syst. 2023(4), 393\u2013419 (2023). https:\/\/doi.org\/10.46586\/tches.v2023.i4.393-419","DOI":"10.46586\/tches.v2023.i4.393-419"},{"issue":"5","key":"4_CR16","doi-asserted-by":"publisher","first-page":"858","DOI":"10.1587\/transfun.2021EAP1115","volume":"105","author":"Y Dai","year":"2022","unstructured":"Dai, Y., Zhou, Z., Zhang, F., Zhao, C.A.: Software implementation of optimal pairings on elliptic curves with odd prime embedding degrees. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 105(5), 858\u2013870 (2022). https:\/\/doi.org\/10.1587\/transfun.2021EAP1115","journal-title":"IEICE Trans. Fundam. Electron. Commun. Comput. Sci."},{"key":"4_CR17","unstructured":"de Valence, H., Lovecruft, I., Arcieri, T.: Why Ristretto? https:\/\/ristretto.group\/why_ristretto.html"},{"key":"4_CR18","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.\u00a02612, pp. 343\u2013354. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/3-540-36563-X_24","DOI":"10.1007\/3-540-36563-X_24"},{"key":"4_CR19","doi-asserted-by":"publisher","unstructured":"El\u00a0Housni, Y., Guillevic, A.: Families of SNARK-friendly 2-chains of elliptic 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":"4_CR20","doi-asserted-by":"publisher","unstructured":"El\u00a0Housni, Y., Guillevic, A., Piellard, T.: Co-factor clearing and subgroup membership testing on pairing-friendly curves. In: Batina, L., Daemen, J. (eds.) AFRICACRYPT 2022. LNCS, vol. 13503, pp. 518\u2013536. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-17433-9_22","DOI":"10.1007\/978-3-031-17433-9_22"},{"key":"4_CR21","unstructured":"Electric Coin Company: What is Jubjub? https:\/\/bitzecbzc.github.io\/technology\/jubjub"},{"issue":"2","key":"4_CR22","doi-asserted-by":"publisher","first-page":"224","DOI":"10.1007\/s00145-009-9048-z","volume":"23","author":"D Freeman","year":"2010","unstructured":"Freeman, D., Scott, M., Teske, E.: A taxonomy of pairing-friendly elliptic curves. J. Cryptol. 23(2), 224\u2013280 (2010). https:\/\/doi.org\/10.1007\/s00145-009-9048-z","journal-title":"J. Cryptol."},{"key":"4_CR23","unstructured":"Gabizon, A., Williamson, Z.J., Ciobotaru, O.: PLONK: permutations over Lagrange-bases for oecumenical noninteractive arguments of knowledge (2019). https:\/\/eprint.iacr.org\/2019\/953"},{"key":"4_CR24","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.\u00a02139, pp. 190\u2013200. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-44647-8_11","DOI":"10.1007\/3-540-44647-8_11"},{"key":"4_CR25","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.\u00a09666, 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_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"535","DOI":"10.1007\/978-3-030-45388-6_19","volume-title":"Public-Key Cryptography \u2013 PKC 2020","author":"A Guillevic","year":"2020","unstructured":"Guillevic, A.: A short-list of pairing-friendly curves resistant to special TNFS at the 128-bit security level. In: Kiayias, A., Kohlweiss, M., Wallden, P., Zikas, V. (eds.) PKC 2020. LNCS, vol. 12111, pp. 535\u2013564. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-45388-6_19"},{"key":"4_CR27","unstructured":"Guillevic, A.: Pairing-friendly curves (2021). https:\/\/members.loria.fr\/AGuillevic\/pairing-friendly-curves"},{"key":"4_CR28","doi-asserted-by":"publisher","unstructured":"Hamburg, M.: Decaf: eliminating cofactors through point compression. In: Gennaro, R., Robshaw, M. (eds.) CRYPTO 2015, pp. 705\u2013723. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-47989-6_34","DOI":"10.1007\/978-3-662-47989-6_34"},{"key":"4_CR29","unstructured":"Hamburg, M.: Ed448-Goldilocks, a new elliptic curve (2015). https:\/\/eprint.iacr.org\/2015\/625"},{"key":"4_CR30","unstructured":"Hamburg, M.: Computing the Jacobi symbol using Bernstein\u2013Yang (2021). https:\/\/eprint.iacr.org\/2021\/1271"},{"key":"4_CR31","doi-asserted-by":"publisher","unstructured":"Joux, A., Pierrot, C.: The special number field sieve in $$\\mathbb{F}_{p^{n}}$$. In: Cao, Z., Zhang, F. (eds.) Pairing-Based Cryptography \u2013 Pairing 2013. LNCS, vol.\u00a08365, pp. 45\u201361. Springer, Cham (2014).https:\/\/doi.org\/10.1007\/978-3-319-04873-4_3","DOI":"10.1007\/978-3-319-04873-4_3"},{"issue":"1","key":"4_CR32","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1515\/jmc-2020-0077","volume":"15","author":"M Joye","year":"2020","unstructured":"Joye, M., Lapiha, O., Nguyen, K., Naccache, D.: The eleventh power residue symbol. J. Math. Cryptology 15(1), 111\u2013122 (2020). https:\/\/doi.org\/10.1515\/jmc-2020-0077","journal-title":"J. Math. Cryptology"},{"key":"4_CR33","doi-asserted-by":"publisher","unstructured":"Kate, A., Zaverucha, G.M., Goldberg, I.: Constant-size commitments to polynomials and their applications. In: Abe, M. (ed.) ASIACRYPT 2010. LNCS, vol.\u00a06477, pp. 177\u2013194. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-17373-8_11","DOI":"10.1007\/978-3-642-17373-8_11"},{"key":"4_CR34","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"543","DOI":"10.1007\/978-3-662-53018-4_20","volume-title":"Advances in Cryptology \u2013 CRYPTO 2016","author":"T Kim","year":"2016","unstructured":"Kim, T., Barbulescu, R.: Extended tower number field sieve: a new complexity for the medium prime case. In: Robshaw, M., Katz, J. (eds.) CRYPTO 2016. LNCS, vol. 9814, pp. 543\u2013571. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-53018-4_20"},{"key":"4_CR35","unstructured":"Koshelev, D., El Housni, Y., Fotiadis, G.: Batch subgroup membership testing on pairing-friendly curves (2025). https:\/\/eprint.iacr.org\/2025\/1311"},{"issue":"1","key":"4_CR36","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1007\/s13389-022-00296-9","volume":"13","author":"D Koshelev","year":"2023","unstructured":"Koshelev, D.: Subgroup membership testing on elliptic curves via the Tate pairing. J. Cryptogr. Eng. 13(1), 125\u2013128 (2023). https:\/\/doi.org\/10.1007\/s13389-022-00296-9","journal-title":"J. Cryptogr. Eng."},{"issue":"1","key":"4_CR37","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1007\/s13389-023-00331-3","volume":"14","author":"D Koshelev","year":"2024","unstructured":"Koshelev, D.: Correction to: Subgroup membership testing on elliptic curves via the Tate pairing. J. Cryptogr. Eng. 14(1), 127\u2013128 (2024). https:\/\/doi.org\/10.1007\/s13389-023-00331-3","journal-title":"J. Cryptogr. Eng."},{"issue":"12","key":"4_CR38","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. Des. Codes Crypt. 92(12), 4131\u20134143 (2024). https:\/\/doi.org\/10.1007\/s10623-024-01472-0","journal-title":"Des. Codes Crypt."},{"issue":"1","key":"4_CR39","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1504\/IJACT.2020.107167","volume":"4","author":"NB Mbiang","year":"2020","unstructured":"Mbiang, N.B., Aranha, D.F., Fouotsa, E.: Computing the optimal ate pairing over elliptic curves with embedding degrees 54 and 48 at the 256-bit security level. Int. J. Appl. Cryptography 4(1), 45\u201359 (2020). https:\/\/doi.org\/10.1504\/IJACT.2020.107167","journal-title":"Int. J. Appl. Cryptography"},{"issue":"4","key":"4_CR40","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1007\/s00145-004-0315-8","volume":"17","author":"VS Miller","year":"2004","unstructured":"Miller, V.S.: The weil pairing, and its efficient calculation. J. Cryptol. 17(4), 235\u2013261 (2004). https:\/\/doi.org\/10.1007\/s00145-004-0315-8","journal-title":"J. Cryptol."},{"issue":"177","key":"4_CR41","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). https:\/\/doi.org\/10.1090\/S0025-5718-1987-0866113-7","journal-title":"Math. Comput."},{"key":"4_CR42","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1007\/978-3-030-34621-8_9","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2019","author":"M Naehrig","year":"2019","unstructured":"Naehrig, M., Renes, J.: Dual isogenies and their application to public-key compression for isogeny-based cryptography. In: Galbraith, S.D., Moriai, S. (eds.) ASIACRYPT 2019. LNCS, vol. 11922, pp. 243\u2013272. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-34621-8_9"},{"key":"4_CR43","unstructured":"Robert, D.: Fast pairings via biextensions and cubical arithmetic (2024). https:\/\/eprint.iacr.org\/2024\/517"},{"issue":"2","key":"4_CR44","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1016\/0097-3165(87)90003-3","volume":"46","author":"R Schoof","year":"1987","unstructured":"Schoof, R.: Nonsingular plane cubic curves over finite fields. J. Combinatorial Theory, Ser. A 46(2), 183\u2013211 (1987). https:\/\/doi.org\/10.1016\/0097-3165(87)90003-3","journal-title":"J. Combinatorial Theory, Ser. A"},{"key":"4_CR45","unstructured":"Scott, M.: MIRACL: multiprecision integer and rational arithmetic C\/C++ library. https:\/\/github.com\/miracl\/core"},{"key":"4_CR46","unstructured":"Scott, M.: A note on group membership tests for $$\\mathbb{G}_{1}$$, $$\\mathbb{G}_{2}$$ and $$\\mathbb{G}_{T}$$ on BLS pairing-friendly curves (2021). https:\/\/eprint.iacr.org\/2021\/1130"},{"issue":"1","key":"4_CR47","doi-asserted-by":"publisher","first-page":"455","DOI":"10.1109\/TIT.2009.2034881","volume":"56","author":"F Vercauteren","year":"2009","unstructured":"Vercauteren, F.: Optimal pairings. IEEE Trans. Inf. Theory 56(1), 455\u2013461 (2009). https:\/\/doi.org\/10.1109\/TIT.2009.2034881","journal-title":"IEEE Trans. Inf. Theory"},{"key":"4_CR48","doi-asserted-by":"publisher","unstructured":"Washington, L.C.: Elliptic curves: number theory and cryptography, Discrete Mathematics and Its Applications, vol.\u00a050. CRC Press, Boca Raton, 2 edn. (2008). https:\/\/doi.org\/10.1201\/9781420071474","DOI":"10.1201\/9781420071474"}],"container-title":["Lecture Notes in Computer Science","Public-Key Cryptography \u2013 PKC 2026"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-26737-5_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,5,20]],"date-time":"2026-05-20T13:17:15Z","timestamp":1779283035000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-26737-5_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9783032267368","9783032267375"],"references-count":48,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-26737-5_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026]]},"assertion":[{"value":"21 May 2026","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"PKC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"IACR International Conference on Public-Key Cryptography","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"West Palm Beach, FL","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":"2026","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25 May 2026","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28 May 2026","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"pkc2026","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/pkc.iacr.org\/2026\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}