{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,10]],"date-time":"2026-08-10T13:31:08Z","timestamp":1786368668876,"version":"build-2736575974"},"publisher-location":"Cham","reference-count":44,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032354266","type":"print"},{"value":"9783032354242","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-35424-2_13","type":"book-chapter","created":{"date-parts":[[2026,8,10]],"date-time":"2026-08-10T13:00:15Z","timestamp":1786366815000},"page":"362-395","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Splitting Bilinear Groups: New Translations from Composite- to Prime-Order with\u00a0Applications to\u00a0Batch Arguments for\u00a0NP"],"prefix":"10.1007","author":[{"given":"David","family":"Balb\u00e1s","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Dario","family":"Fiore","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Duy","family":"Nguyen","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2026,8,11]]},"reference":[{"key":"13_CR1","unstructured":"Afshar, A., Cheng, J., Goyal, R.: Leveled fully-homomorphic signatures from batch arguments. Cryptology ePrint Archive, Report 2024\/931 (2024). https:\/\/eprint.iacr.org\/2024\/931"},{"key":"13_CR2","doi-asserted-by":"publisher","unstructured":"Alborch\u00a0Escobar, F., Canard, S., Laguillaumie, F.: Simulation secure multi-input quadratic functional encryption: applications to differential privacy. Des. Codes Cryptogr. 94(1), 1 (2025). https:\/\/doi.org\/10.1007\/s10623-025-01754-1","DOI":"10.1007\/s10623-025-01754-1"},{"key":"13_CR3","doi-asserted-by":"publisher","unstructured":"Anthoine, G., Balb\u00e1s, D., Fiore, D.: Fully-succinct multi-key homomorphic signatures from standard assumptions. In: Reyzin, L., Stebila, D. (eds.) CRYPTO\u00a02024, Part\u00a0III. LNCS, vol. 14922, pp. 317\u2013351. Springer, Cham (2024). https:\/\/doi.org\/10.1007\/978-3-031-68382-4_10","DOI":"10.1007\/978-3-031-68382-4_10"},{"key":"13_CR4","unstructured":"Balb\u00e1s, D., Fiore, D., Lai, R.W.F.: Circuit-succinct algebraic batch arguments from projective functional commitments. Cryptology ePrint Archive, Report 2025\/1943 (2025). https:\/\/eprint.iacr.org\/2025\/1943"},{"key":"13_CR5","doi-asserted-by":"publisher","unstructured":"Barak, B., et al.: On the (im)possibility of obfuscating programs. In: Kilian, J. (ed.) CRYPTO 2001. LNCS, vol.\u00a02139, pp. 1\u201318. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-44647-8_1","DOI":"10.1007\/3-540-44647-8_1"},{"key":"13_CR6","doi-asserted-by":"publisher","unstructured":"Bishop, A., Jain, A., Kowalczyk, L.: Function-hiding inner product encryption. In: Iwata, T., Cheon, J.H. (eds.) ASIACRYPT\u00a02015, Part\u00a0I. LNCS, vol.\u00a09452, pp. 470\u2013491. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-48797-6_20","DOI":"10.1007\/978-3-662-48797-6_20"},{"key":"13_CR7","doi-asserted-by":"publisher","unstructured":"Boneh, D., Sahai, A., Waters, B.: Functional encryption: definitions and challenges. In: Ishai, Y. (ed.) TCC\u00a02011. LNCS, vol.\u00a06597, pp. 253\u2013273. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-19571-6_16","DOI":"10.1007\/978-3-642-19571-6_16"},{"key":"13_CR8","doi-asserted-by":"publisher","unstructured":"Brakerski, Z., Holmgren, J., Kalai, Y.T.: Non-interactive delegation and batch NP verification from standard computational assumptions. In: Hatami, H., McKenzie, P., King, V. (eds.) 49th ACM STOC, pp. 474\u2013482. ACM Press (2017). https:\/\/doi.org\/10.1145\/3055399.3055497","DOI":"10.1145\/3055399.3055497"},{"key":"13_CR9","doi-asserted-by":"publisher","unstructured":"Brodsky, M.F., Choudhuri, A.R., Jain, A., Paneth, O.: Monotone-policy aggregate signatures. In: Joye, M., Leander, G. (eds.) EUROCRYPT\u00a02024, Part\u00a0IV. LNCS, vol. 14654, pp. 168\u2013195. Springer, Cham (2024). https:\/\/doi.org\/10.1007\/978-3-031-58737-5_7","DOI":"10.1007\/978-3-031-58737-5_7"},{"key":"13_CR10","doi-asserted-by":"publisher","unstructured":"Canetti, R., et al.: Fiat-Shamir: from practice to theory. In: Charikar, M., Cohen, E. (eds.) 51st ACM STOC, pp. 1082\u20131090. ACM Press (2019). https:\/\/doi.org\/10.1145\/3313276.3316380","DOI":"10.1145\/3313276.3316380"},{"key":"13_CR11","doi-asserted-by":"publisher","unstructured":"Canetti, R., Goldreich, O., Halevi, S.: The random oracle methodology, revisited (preliminary version). In: 30th ACM STOC, pp. 209\u2013218. ACM Press (1998). https:\/\/doi.org\/10.1145\/276698.276741","DOI":"10.1145\/276698.276741"},{"key":"13_CR12","doi-asserted-by":"publisher","unstructured":"Chen, B., Elias, N., Wu, D.J.: Pairing-based batch arguments for NP with a linear-size CRS. In: Hanaoka, G., Yang, B.Y. (eds.) ASIACRYPT\u00a02025, Part\u00a0V. LNCS, vol. 16249, pp. 554\u2013577. Springer, Singapore (2025). https:\/\/doi.org\/10.1007\/978-981-95-5116-3_18","DOI":"10.1007\/978-981-95-5116-3_18"},{"key":"13_CR13","doi-asserted-by":"publisher","unstructured":"Choudhuri, A.R., Jain, A., Jin, Z.: Non-interactive batch arguments for NP from standard assumptions. In: Malkin, T., Peikert, C. (eds.) CRYPTO\u00a02021, Part\u00a0IV. LNCS, vol. 12828, pp. 394\u2013423. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-84259-8_14","DOI":"10.1007\/978-3-030-84259-8_14"},{"key":"13_CR14","doi-asserted-by":"publisher","unstructured":"Choudhuri, A.R., Jain, A., Jin, Z.: SNARGs for $$\\cal{P}$$ from LWE. In: 62nd FOCS, pp. 68\u201379. IEEE Computer Society Press (2022). https:\/\/doi.org\/10.1109\/FOCS52979.2021.00016","DOI":"10.1109\/FOCS52979.2021.00016"},{"key":"13_CR15","doi-asserted-by":"publisher","unstructured":"Datta, P., Jain, A., Jin, Z., Korb, A., Mathialagan, S., Sahai, A.: Incrementally verifiable computation for NP from standard assumptions. In: Kalai, Y.T., Kamara, S.F. (eds.) CRYPTO\u00a02025, Part\u00a0VII. LNCS, vol. 16006, pp. 611\u2013642. Springer, Cham (2025). https:\/\/doi.org\/10.1007\/978-3-032-01907-3_20","DOI":"10.1007\/978-3-032-01907-3_20"},{"key":"13_CR16","doi-asserted-by":"publisher","unstructured":"Devadas, L., Goyal, R., Kalai, Y., Vaikuntanathan, V.: Rate-1 non-interactive arguments for batch-NP and applications. In: 63rd FOCS, pp. 1057\u20131068. IEEE Computer Society Press (2022). https:\/\/doi.org\/10.1109\/FOCS54457.2022.00103","DOI":"10.1109\/FOCS54457.2022.00103"},{"key":"13_CR17","doi-asserted-by":"publisher","unstructured":"Escala, A., Herold, G., Kiltz, E., R\u00e0fols, C., Villar, J.: An algebraic framework for Diffie-Hellman assumptions. In: Canetti, R., Garay, J.A. (eds.) CRYPTO\u00a02013, Part\u00a0II. LNCS, vol.\u00a08043, pp. 129\u2013147. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-40084-1_8","DOI":"10.1007\/978-3-642-40084-1_8"},{"key":"13_CR18","doi-asserted-by":"publisher","unstructured":"Freeman, D.M.: Converting pairing-based cryptosystems from composite-order groups to prime-order groups. In: Gilbert, H. (ed.) EUROCRYPT\u00a02010. LNCS, vol.\u00a06110, pp. 44\u201361. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-13190-5_3","DOI":"10.1007\/978-3-642-13190-5_3"},{"key":"13_CR19","doi-asserted-by":"publisher","unstructured":"Garg, R., Lu, G., Waters, B., Wu, D.J.: Reducing the CRS size in registered ABE systems. In: Reyzin, L., Stebila, D. (eds.) CRYPTO\u00a02024, Part\u00a0III. LNCS, vol. 14922, pp. 143\u2013177. Springer, Cham (2024). https:\/\/doi.org\/10.1007\/978-3-031-68382-4_5","DOI":"10.1007\/978-3-031-68382-4_5"},{"key":"13_CR20","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"},{"key":"13_CR21","unstructured":"Goyal, R.: Mutable batch arguments and applications. Cryptology ePrint Archive, Report 2024\/737 (2024). https:\/\/eprint.iacr.org\/2024\/737"},{"key":"13_CR22","doi-asserted-by":"publisher","unstructured":"Groth, J., Sahai, A.: Efficient non-interactive proof systems for bilinear groups. In: Smart, N.P. (ed.) EUROCRYPT\u00a02008. LNCS, vol.\u00a04965, 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":"13_CR23","doi-asserted-by":"publisher","unstructured":"Guillevic, A.: Comparing the pairing efficiency over composite-order and prime-order elliptic curves. In: Jacobson, Jr., M.J., Locasto, M.E., Mohassel, P., Safavi-Naini, R. (eds.) ACNS 2013. LNCS, vol.\u00a07954, pp. 357\u2013372. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-38980-1_22","DOI":"10.1007\/978-3-642-38980-1_22"},{"key":"13_CR24","doi-asserted-by":"publisher","unstructured":"Herold, G., Hesse, J., Hofheinz, D., R\u00e0fols, C., Rupp, A.: Polynomial spaces: a new framework for composite-to-prime-order transformations. In: Garay, J.A., Gennaro, R. (eds.) CRYPTO\u00a02014, Part\u00a0I. LNCS, vol.\u00a08616, pp. 261\u2013279. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-662-44371-2_15","DOI":"10.1007\/978-3-662-44371-2_15"},{"key":"13_CR25","doi-asserted-by":"publisher","unstructured":"Jain, A., Jin, Z.: Non-interactive zero knowledge from sub-exponential DDH. In: Canteaut, A., Standaert, F.X. (eds.) EUROCRYPT\u00a02021, Part\u00a0I. LNCS, vol. 12696, pp. 3\u201332. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-77870-5_1","DOI":"10.1007\/978-3-030-77870-5_1"},{"issue":"4","key":"13_CR26","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1007\/s00145-004-0312-y","volume":"17","author":"A Joux","year":"2004","unstructured":"Joux, A.: A one round protocol for tripartite Diffie\u2013Hellman. J. Cryptol. 17(4), 263\u2013276 (2004). https:\/\/doi.org\/10.1007\/s00145-004-0312-y","journal-title":"J. Cryptol."},{"key":"13_CR27","doi-asserted-by":"publisher","unstructured":"Kalai, Y., Lombardi, A., Vaikuntanathan, V., Wichs, D.: Boosting batch arguments and RAM delegation. In: Saha, B., Servedio, R.A. (eds.) 55th ACM STOC, pp. 1545\u20131552. ACM Press (2023). https:\/\/doi.org\/10.1145\/3564246.3585200","DOI":"10.1145\/3564246.3585200"},{"key":"13_CR28","doi-asserted-by":"publisher","unstructured":"Kalai, Y.T., Paneth, O., Yang, L.: How to delegate computations publicly. In: Charikar, M., Cohen, E. (eds.) 51st ACM STOC, pp. 1115\u20131124. ACM Press (2019). https:\/\/doi.org\/10.1145\/3313276.3316411","DOI":"10.1145\/3313276.3316411"},{"key":"13_CR29","doi-asserted-by":"publisher","unstructured":"Kalai, Y.T., Vaikuntanathan, V., Zhang, R.Y.: Somewhere statistical soundness, post-quantum security, and SNARGs. In: Nissim, K., Waters, B. (eds.) TCC\u00a02021, Part\u00a0I. LNCS, vol. 13042, pp. 330\u2013368. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-90459-3_12","DOI":"10.1007\/978-3-030-90459-3_12"},{"key":"13_CR30","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\u00a02010. 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":"13_CR31","doi-asserted-by":"publisher","unstructured":"Kim, S., Lewi, K., Mandal, A., Montgomery, H., Roy, A., Wu, D.J.: Function-hiding inner product encryption is practical. In: Catalano, D., De Prisco, R. (eds.) SCN 2018. LNCS, vol. 11035, pp. 544\u2013562. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-98113-0_29","DOI":"10.1007\/978-3-319-98113-0_29"},{"key":"13_CR32","doi-asserted-by":"publisher","unstructured":"Lewko, A.B.: Tools for simulating features of composite order bilinear groups in the prime order setting. In: Pointcheval, D., Johansson, T. (eds.) EUROCRYPT\u00a02012. LNCS, vol.\u00a07237, pp. 318\u2013335. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-29011-4_20","DOI":"10.1007\/978-3-642-29011-4_20"},{"key":"13_CR33","doi-asserted-by":"publisher","unstructured":"Lewko, A.B., Meiklejohn, S.: A profitable sub-prime loan: obtaining the advantages of composite order in prime-order bilinear groups. In: Katz, J. (ed.) PKC\u00a02015. LNCS, vol.\u00a09020, pp. 377\u2013398. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-46447-2_17","DOI":"10.1007\/978-3-662-46447-2_17"},{"key":"13_CR34","doi-asserted-by":"publisher","unstructured":"Lin, H.: Indistinguishability obfuscation from SXDH on 5-linear maps and locality-5 PRGs. In: Katz, J., Shacham, H. (eds.) CRYPTO\u00a02017, Part\u00a0I. LNCS, vol. 10401, pp. 599\u2013629. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-63688-7_20","DOI":"10.1007\/978-3-319-63688-7_20"},{"key":"13_CR35","doi-asserted-by":"publisher","unstructured":"Lin, H., Luo, J.: Compact adaptively secure ABE from $$k$$-Lin: beyond NC$$^1$$ and towards NL. In: Canteaut, A., Ishai, Y. (eds.) EUROCRYPT\u00a02020, Part\u00a0III. LNCS, vol. 12107, pp. 247\u2013277. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-45727-3_9","DOI":"10.1007\/978-3-030-45727-3_9"},{"key":"13_CR36","doi-asserted-by":"publisher","unstructured":"Okamoto, T., Takashima, K.: Homomorphic encryption and signatures from vector decomposition. In: Galbraith, S.D., Paterson, K.G. (eds.) PAIRING 2008. LNCS, vol.\u00a05209, pp. 57\u201374. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-85538-5_4","DOI":"10.1007\/978-3-540-85538-5_4"},{"key":"13_CR37","doi-asserted-by":"publisher","unstructured":"Okamoto, T., Takashima, K.: Hierarchical predicate encryption for inner-products. In: Matsui, M. (ed.) ASIACRYPT\u00a02009. LNCS, vol.\u00a05912, pp. 214\u2013231. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-10366-7_13","DOI":"10.1007\/978-3-642-10366-7_13"},{"key":"13_CR38","unstructured":"O\u2019Neill, A.: Definitional issues in functional encryption. Cryptology ePrint Archive, Report 2010\/556 (2010). https:\/\/eprint.iacr.org\/2010\/556"},{"key":"13_CR39","doi-asserted-by":"publisher","unstructured":"Paneth, O., Pass, R.: Incrementally verifiable computation via rate-1 batch arguments. In: 63rd FOCS, pp. 1045\u20131056. IEEE Computer Society Press (2022). https:\/\/doi.org\/10.1109\/FOCS54457.2022.00102","DOI":"10.1109\/FOCS54457.2022.00102"},{"key":"13_CR40","doi-asserted-by":"publisher","unstructured":"Peikert, C., Shiehian, S.: Noninteractive zero knowledge for NP from (plain) learning with errors. In: Boldyreva, A., Micciancio, D. (eds.) CRYPTO\u00a02019, Part\u00a0I. LNCS, vol. 11692, pp. 89\u2013114. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-26948-7_4","DOI":"10.1007\/978-3-030-26948-7_4"},{"key":"13_CR41","doi-asserted-by":"publisher","unstructured":"Sahai, A., Waters, B.R.: Fuzzy identity-based encryption. In: Cramer, R. (ed.) EUROCRYPT\u00a02005. LNCS, vol.\u00a03494, pp. 457\u2013473. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11426639_27","DOI":"10.1007\/11426639_27"},{"key":"13_CR42","doi-asserted-by":"publisher","unstructured":"Seo, J.H., Cheon, J.H.: Beyond the limitation of prime-order bilinear groups, and round optimal blind signatures. In: Cramer, R. (ed.) TCC\u00a02012. LNCS, vol.\u00a07194, pp. 133\u2013150. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-28914-9_8","DOI":"10.1007\/978-3-642-28914-9_8"},{"key":"13_CR43","doi-asserted-by":"publisher","unstructured":"Tomida, J., Abe, M., Okamoto, T.: Efficient functional encryption for inner-product values with full-hiding security. In: Bishop, M., Nascimento, A.C.A. (eds.) ISC\u00a02016. LNCS, vol.\u00a09866, pp. 408\u2013425. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-45871-7_24","DOI":"10.1007\/978-3-319-45871-7_24"},{"key":"13_CR44","doi-asserted-by":"publisher","unstructured":"Waters, B., Wu, D.J.: Batch arguments for $$\\sf NP$$ and more from standard bilinear group assumptions. In: Dodis, Y., Shrimpton, T. (eds.) CRYPTO\u00a02022, Part\u00a0II. LNCS, vol. 13508, pp. 433\u2013463. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-15979-4_15","DOI":"10.1007\/978-3-031-15979-4_15"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 CRYPTO 2026"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-35424-2_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,8,10]],"date-time":"2026-08-10T13:00:16Z","timestamp":1786366816000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-35424-2_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9783032354266","9783032354242"],"references-count":44,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-35424-2_13","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":"11 August 2026","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":"2026","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 August 2026","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 August 2026","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"46","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"crypto2026","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/crypto.iacr.org\/2026\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}