{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,7]],"date-time":"2025-12-07T15:44:05Z","timestamp":1765122245425,"version":"3.46.0"},"publisher-location":"Singapore","reference-count":40,"publisher":"Springer Nature Singapore","isbn-type":[{"value":"9789819551125","type":"print"},{"value":"9789819551132","type":"electronic"}],"license":[{"start":{"date-parts":[[2025,12,8]],"date-time":"2025-12-08T00:00:00Z","timestamp":1765152000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,12,8]],"date-time":"2025-12-08T00:00:00Z","timestamp":1765152000000},"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-981-95-5113-2_8","type":"book-chapter","created":{"date-parts":[[2025,12,7]],"date-time":"2025-12-07T15:43:30Z","timestamp":1765122210000},"page":"239-271","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Attention is still what you need: Another Round of\u00a0Exploring Shoup\u2019s GGM"],"prefix":"10.1007","author":[{"given":"Taiyu","family":"Wang","sequence":"first","affiliation":[]},{"given":"Cong","family":"Zhang","sequence":"additional","affiliation":[]},{"given":"Hong-Sheng","family":"Zhou","sequence":"additional","affiliation":[]},{"given":"Xin","family":"Wang","sequence":"additional","affiliation":[]},{"given":"Pengfei","family":"Chen","sequence":"additional","affiliation":[]},{"given":"Wenli","family":"Wang","sequence":"additional","affiliation":[]},{"given":"Kui","family":"Ren","sequence":"additional","affiliation":[]},{"given":"Chun","family":"Chen","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,12,8]]},"reference":[{"key":"8_CR1","series-title":"Part I, volume 8042 of LNCS","doi-asserted-by":"publisher","first-page":"531","DOI":"10.1007\/978-3-642-40041-4_29","volume-title":"CRYPTO 2013","author":"E Andreeva","year":"2013","unstructured":"Andreeva, E., Bogdanov, A., Dodis, Y., Mennink, B., Steinberger, J.P.: On the indifferentiability of key-alternating ciphers. In: Canetti, R., Garay, J.A. (eds.) CRYPTO 2013. Part I, volume 8042 of LNCS, pp. 531\u2013550. Springer, Berlin, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-40041-4_29"},{"key":"8_CR2","doi-asserted-by":"crossref","unstructured":"Adleman, L.: A subexponential algorithm for the discrete logarithm problem with applications to cryptography. In: 20th Annual Symposium on Foundations of Computer Science (SFCS 1979), pp. 55\u201360. IEEE Computer Society (1979)","DOI":"10.1109\/SFCS.1979.2"},{"key":"8_CR3","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"56","DOI":"10.1007\/978-3-540-24676-3_4","volume-title":"EUROCRYPT 2004","author":"D Boneh","year":"2004","unstructured":"Boneh, D., Boyen, X.: Short signatures without random oracles. In: Cachin, C., Camenisch, J. (eds.) EUROCRYPT 2004. LNCS, vol. 3027, pp. 56\u201373. Springer, Berlin, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-24676-3_4"},{"key":"8_CR4","doi-asserted-by":"crossref","unstructured":"B\u00fcnz, B., Bootle, J., Boneh, D., Poelstra, A., Wuille, P., Maxwell, G.: Bulletproofs: Short proofs for confidential transactions and more. In: 2018 IEEE Symposium on Security and Privacy, pp. 315\u2013334. IEEE Computer Society Press (May 2018)","DOI":"10.1109\/SP.2018.00020"},{"key":"8_CR5","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1007\/978-3-642-14623-7_13","volume-title":"CRYPTO 2010","author":"E Brier","year":"2010","unstructured":"Brier, E., Coron, J.-S., Icart, T., Madore, D., Randriam, H., Tibouchi, M.: Efficient indifferentiable hashing into ordinary elliptic curves. In: Rabin, T. (ed.) CRYPTO 2010. LNCS, vol. 6223, pp. 237\u2013254. Springer, Berlin, Heidelberg (2010)"},{"issue":"3","key":"8_CR6","doi-asserted-by":"publisher","first-page":"586","DOI":"10.1137\/S0097539701398521","volume":"32","author":"D Boneh","year":"2003","unstructured":"Boneh, D., Franklin, M.K.: Identity-based encryption from the weil pairing. SIAM J. Comput. 32(3), 586\u2013615 (2003)","journal-title":"SIAM J. Comput."},{"key":"8_CR7","series-title":"Part I, volume 10991 of LNCS","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1007\/978-3-319-96884-1_7","volume-title":"CRYPTO 2018","author":"M Barbosa","year":"2018","unstructured":"Barbosa, M., Farshim, P.: Indifferentiable authenticated encryption. In: Shacham, H., Boldyreva, A. (eds.) CRYPTO 2018. Part I, volume 10991 of LNCS, pp. 187\u2013220. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-96884-1_7"},{"key":"8_CR8","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. DCC 42(3), 239\u2013271 (2007)","DOI":"10.1007\/s10623-006-9033-6"},{"key":"8_CR9","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"559","DOI":"10.1007\/978-3-642-19571-6_34","volume-title":"TCC 2011","author":"Z Brakerski","year":"2011","unstructured":"Brakerski, Z., Katz, J., Segev, G., Yerukhimovich, A.: Limits on the power of zero-knowledge proofs in cryptographic constructions. In: Ishai, Y. (ed.) TCC 2011. LNCS, vol. 6597, pp. 559\u2013578. Springer, Berlin, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-19571-6_34"},{"key":"8_CR10","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"430","DOI":"10.1007\/11535218_26","volume-title":"CRYPTO 2005","author":"J-S Coron","year":"2005","unstructured":"Coron, J.-S., Dodis, Y., Malinaud, C., Puniya, P.: Merkle-Damg\u00e5rd revisited: how to construct a hash function. In: Shoup, V. (ed.) CRYPTO 2005. LNCS, vol. 3621, pp. 430\u2013448. Springer, Berlin, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11535218_26"},{"key":"8_CR11","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1007\/978-3-642-11799-2_17","volume-title":"TCC 2010","author":"J-S Coron","year":"2010","unstructured":"Coron, J.-S., Dodis, Y., Mandal, A., Seurin, Y.: A domain extender for the ideal cipher. In: Micciancio, D. (ed.) TCC 2010. LNCS, vol. 5978, pp. 273\u2013289. Springer, Berlin, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-11799-2_17"},{"issue":"1","key":"8_CR12","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1007\/s00145-014-9189-6","volume":"29","author":"J-S Coron","year":"2016","unstructured":"Coron, J.-S., Holenstein, T., K\u00fcnzler, R., Patarin, J., Seurin, Y., Tessaro, S.: How to build an ideal cipher: the indifferentiability of the Feistel construction. J. Cryptol. 29(1), 61\u2013114 (2016)","journal-title":"J. Cryptol."},{"key":"8_CR13","doi-asserted-by":"crossref","unstructured":"Chen, L., Moody, D., Randall, K., Regenscheid, A., Robinson, A.: Recommendations for discrete logarithm-based cryptography: Elliptic curve domain parameters (2023). https:\/\/doi.org\/10.6028\/NIST.SP.800-186","DOI":"10.6028\/NIST.SP.800-186"},{"issue":"6","key":"8_CR14","doi-asserted-by":"publisher","first-page":"644","DOI":"10.1109\/TIT.1976.1055638","volume":"22","author":"W Diffie","year":"1976","unstructured":"Diffie, W., Hellman, M.E.: New directions in cryptography. IEEE Trans. Inf. Theory 22(6), 644\u2013654 (1976)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"8_CR15","series-title":"Part III, volume 13044 of LNCS","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1007\/978-3-030-90456-2_1","volume-title":"TCC 2021","author":"N D\u00f6ttling","year":"2021","unstructured":"D\u00f6ttling, N., Hartmann, D., Hofheinz, D., Kiltz, E., Sch\u00e4ge, S., Ursu, B.: On the impossibility of purely algebraic signatures. In: Nissim, K., Waters, B. (eds.) TCC 2021. Part III, volume 13044 of LNCS, pp. 317\u2013349. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-90456-2_1"},{"key":"8_CR16","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"371","DOI":"10.1007\/978-3-642-01001-9_22","volume-title":"EUROCRYPT 2009","author":"Y Dodis","year":"2009","unstructured":"Dodis, Y., Ristenpart, T., Shrimpton, T.: Salvaging Merkle-Damg\u00e5rd for practical applications. In: Joux, A. (ed.) EUROCRYPT 2009. LNCS, vol. 5479, pp. 371\u2013388. Springer, Berlin, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-01001-9_22"},{"key":"8_CR17","series-title":"Part II, volume 9666 of LNCS","doi-asserted-by":"publisher","first-page":"679","DOI":"10.1007\/978-3-662-49896-5_24","volume-title":"EUROCRYPT 2016","author":"Y Dodis","year":"2016","unstructured":"Dodis, Y., Stam, M., Steinberger, J.P., Liu, T.: Indifferentiability of confusion-diffusion networks. In: Fischlin, M., Coron, J.-S. (eds.) EUROCRYPT 2016. Part II, volume 9666 of LNCS, pp. 679\u2013704. Springer, Berlin, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-49896-5_24"},{"issue":"4","key":"8_CR18","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)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"206","key":"8_CR19","first-page":"865","volume":"62","author":"G Frey","year":"1994","unstructured":"Frey, G., R\u00fcck, H.-G.: A remark concerning $$m$$-divisibility and the discrete logarithm in the divisor class group of curves. Math. Comput. 62(206), 865\u2013874 (1994)","journal-title":"Math. Comput."},{"key":"8_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1007\/978-3-642-14712-8_5","volume-title":"Progress in Cryptology \u2013 LATINCRYPT 2010","author":"P-A Fouque","year":"2010","unstructured":"Fouque, P.-A., Tibouchi, M.: Estimating the size of the image of deterministic hash functions to elliptic curves. In: Abdalla, M., Barreto, P.S.L.M. (eds.) LATINCRYPT 2010. LNCS, vol. 6212, pp. 81\u201391. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-14712-8_5"},{"key":"8_CR21","series-title":"Part II, volume 9666 of LNCS","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1007\/978-3-662-49896-5_11","volume-title":"EUROCRYPT 2016","author":"J Groth","year":"2016","unstructured":"Groth, J.: On the size of pairing-based non-interactive arguments. In: Fischlin, M., Coron, J.-S. (eds.) EUROCRYPT 2016. Part II, volume 9666 of LNCS, pp. 305\u2013326. Springer, Berlin, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-49896-5_11"},{"key":"8_CR22","doi-asserted-by":"publisher","unstructured":"Groth, J., Shoup, V.: On the security of ECDSA with additive key derivation and presignatures. In: Dunkelman, O., Dziembowski, S. (eds.) Advances in Cryptology \u2013 EUROCRYPT 2022. EUROCRYPT 2022. LNCS, vol. 13275. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-06944-4_13","DOI":"10.1007\/978-3-031-06944-4_13"},{"key":"8_CR23","series-title":"Part IV, volume 14007 of LNCS","doi-asserted-by":"publisher","first-page":"408","DOI":"10.1007\/978-3-031-30634-1_14","volume-title":"EUROCRYPT 2023","author":"C Guo","year":"2023","unstructured":"Guo, C., Wang, L., Lin, D.: Impossibility of indifferentiable iterated blockciphers from 3 or less primitive calls. In: Hazay, C., Stam, M. (eds.) EUROCRYPT 2023. Part IV, volume 14007 of LNCS, pp. 408\u2013439. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-30634-1_14"},{"key":"8_CR24","doi-asserted-by":"publisher","unstructured":"Hajiabadi, M., Mahmoody, M., Qi, W., Sarfaraz, S.: Lower bounds on assumptions behind registration-based encryption. In: Rothblum, G., Wee, H. (eds.) Theory of Cryptography. TCC 2023. LNCS, vol. 14370. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-48618-0_11","DOI":"10.1007\/978-3-031-48618-0_11"},{"key":"8_CR25","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1007\/978-3-642-03356-8_18","volume-title":"CRYPTO 2009","author":"T Icart","year":"2009","unstructured":"Icart, T.: How to hash into elliptic curves. In: Halevi, S. (ed.) CRYPTO 2009. LNCS, vol. 5677, pp. 303\u2013316. Springer, Berlin, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-03356-8_18"},{"key":"8_CR26","doi-asserted-by":"crossref","unstructured":"Impagliazzo, R., Rudich, S.: Limits on the provable consequences of one-way permutations. In: 21st ACM STOC, pp. 44\u201361. ACM Press (May 1989)","DOI":"10.1145\/73007.73012"},{"key":"8_CR27","series-title":"Part VII, volume 15490 of LNCS","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-981-96-0941-3_1","volume-title":"ASIACRYPT 2024","author":"K Ji","year":"2024","unstructured":"Ji, K., Zhang, C., Wang, T., Zhang, B., Zhou, H.-S., Wang, X., Ren, K.: On the complexity of cryptographic groups and generic group models. In: Chung, K.-M., Sasaki, Yu. (eds.) ASIACRYPT 2024. Part VII, volume 15490 of LNCS, pp. 3\u201335. Springer, Singapore (2024). https:\/\/doi.org\/10.1007\/978-981-96-0941-3_1"},{"issue":"177","key":"8_CR28","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1090\/S0025-5718-1987-0866109-5","volume":"48","author":"N Koblitz","year":"1987","unstructured":"Koblitz, N.: Elliptic curve cryptosystems. Math. Comput. 48(177), 203\u2013209 (1987)","journal-title":"Math. Comput."},{"key":"8_CR29","doi-asserted-by":"publisher","unstructured":"Lipmaa, H., Parisella, R., Siim, J.: Algebraic group model with oblivious sampling. In: Rothblum, G., Wee, H. (eds.) Theory of Cryptography. TCC 2023. LNCS, vol. 14372. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-48624-1_14","DOI":"10.1007\/978-3-031-48624-1_14"},{"key":"8_CR30","series-title":"Part V, volume 14924 of LNCS","doi-asserted-by":"publisher","first-page":"46","DOI":"10.1007\/978-3-031-68388-6_3","volume-title":"CRYPTO 2024","author":"L George","year":"2024","unstructured":"George, L., Zhandry, M.: Limits on the power of prime-order groups: Separating Q-type from static assumptions. In: Reyzin, L., Stebila, D. (eds.) CRYPTO 2024. Part V, volume 14924 of LNCS, pp. 46\u201374. Springer, Cham (2024). https:\/\/doi.org\/10.1007\/978-3-031-68388-6_3"},{"key":"8_CR31","doi-asserted-by":"publisher","unstructured":"Maurer, U.: Abstract models of computation in cryptography (invited paper). In: Smart, N.P. (ed.) 10th IMA International Conference on Cryptography and Coding. LNCS, vol. 3796, pp. 1\u201312. Springer, Berlin, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11586821_1","DOI":"10.1007\/11586821_1"},{"key":"8_CR32","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"417","DOI":"10.1007\/3-540-39799-X_31","volume-title":"CRYPTO\u201985","author":"VS Miller","year":"1986","unstructured":"Miller, V.S.: Use of elliptic curves in cryptography. In: Williams, H.C. (ed.) CRYPTO\u201985. LNCS, vol. 218, pp. 417\u2013426. Springer, Berlin, Heidelberg (1986). https:\/\/doi.org\/10.1007\/3-540-39799-X_31"},{"key":"8_CR33","doi-asserted-by":"crossref","unstructured":"Masny, D., Rindal, P.: Endemic oblivious transfer. In: Cavallaro, L., Kinder, J., Wang, X., Katz, J. (eds.) ACM CCS 2019, pp. 309\u2013326. ACM Press (November 2019)","DOI":"10.1145\/3319535.3354210"},{"key":"8_CR34","doi-asserted-by":"publisher","unstructured":"Maurer, U., Renner, R., Holenstein, C.: Indifferentiability, impossibility results on reductions, and applications to the random oracle methodology. In: Naor, M. (ed.) TCC 2004. LNCS, vol. 2951, pp. 21\u201339. Springer, Berlin, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-24638-1_2","DOI":"10.1007\/978-3-540-24638-1_2"},{"key":"8_CR35","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"487","DOI":"10.1007\/978-3-642-20465-4_27","volume-title":"EUROCRYPT 2011","author":"T Ristenpart","year":"2011","unstructured":"Ristenpart, T., Shacham, H., Shrimpton, T.: Careful with composition: Limitations of the indifferentiability framework. In: Paterson, K.G. (ed.) EUROCRYPT 2011. LNCS, vol. 6632, pp. 487\u2013506. Springer, Berlin, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-20465-4_27"},{"key":"8_CR36","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-540-24638-1_1","volume-title":"TCC 2004","author":"O Reingold","year":"2004","unstructured":"Reingold, O., Trevisan, L., Vadhan, S.P.: Notions of reducibility between cryptographic primitives. In: Naor, M. (ed.) TCC 2004. LNCS, vol. 2951, pp. 1\u201320. Springer, Berlin, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-24638-1_1"},{"key":"8_CR37","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"256","DOI":"10.1007\/3-540-69053-0_18","volume-title":"EUROCRYPT\u201997","author":"V Shoup","year":"1997","unstructured":"Shoup, V.: Lower bounds for discrete logarithms and related problems. In: Fumy, W. (ed.) EUROCRYPT\u201997. LNCS, vol. 1233, pp. 256\u2013266. Springer, Berlin, Heidelberg (1997). https:\/\/doi.org\/10.1007\/3-540-69053-0_18"},{"key":"8_CR38","series-title":"Part III, volume 13509 of LNCS","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1007\/978-3-031-15982-4_3","volume-title":"CRYPTO 2022","author":"M Zhandry","year":"2022","unstructured":"Zhandry, M.: To label, or not to label (in generic groups). In: Dodis, Y., Shrimpton, T. (eds.) CRYPTO 2022. Part III, volume 13509 of LNCS, pp. 66\u201396. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-15982-4_3"},{"key":"8_CR39","series-title":"Part I, volume 12170 of LNCS","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1007\/978-3-030-56784-2_3","volume-title":"CRYPTO 2020","author":"M Zhandry","year":"2020","unstructured":"Zhandry, M., Zhang, C.: Indifferentiability for public key cryptosystems. In: Micciancio, D., Ristenpart, T. (eds.) CRYPTO 2020. Part I, volume 12170 of LNCS, pp. 63\u201393. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-56784-2_3"},{"key":"8_CR40","series-title":"Part VI, volume 14443 of LNCS","doi-asserted-by":"publisher","first-page":"390","DOI":"10.1007\/978-981-99-8736-8_13","volume-title":"ASIACRYPT 2023","author":"C Zhang","year":"2023","unstructured":"Zhang, C., Zhandry, M.: The relationship between idealized models under computationally bounded adversaries. In: Guo, J., Steinfeld, R. (eds.) ASIACRYPT 2023. Part VI, volume 14443 of LNCS, pp. 390\u2013419. Springer, Singapore (2023). https:\/\/doi.org\/10.1007\/978-981-99-8736-8_13"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 ASIACRYPT 2025"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-95-5113-2_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,12,7]],"date-time":"2025-12-07T15:43:42Z","timestamp":1765122222000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-95-5113-2_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,12,8]]},"ISBN":["9789819551125","9789819551132"],"references-count":40,"URL":"https:\/\/doi.org\/10.1007\/978-981-95-5113-2_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,12,8]]},"assertion":[{"value":"8 December 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ASIACRYPT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on the Theory and Application of Cryptology and Information Security","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Melbourne, VIC","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Australia","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":"8 December 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12 December 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"31","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"asiacrypt2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/asiacrypt.iacr.org\/2025\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}