{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,10]],"date-time":"2026-04-10T04:20:52Z","timestamp":1775794852326,"version":"3.50.1"},"publisher-location":"Singapore","reference-count":56,"publisher":"Springer Nature Singapore","isbn-type":[{"value":"9789819550982","type":"print"},{"value":"9789819550999","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-5099-9_8","type":"book-chapter","created":{"date-parts":[[2025,12,7]],"date-time":"2025-12-07T11:38:15Z","timestamp":1765107495000},"page":"233-264","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["GPV Preimage Sampling with\u00a0Weak Smoothness and\u00a0Its Applications to\u00a0Lattice Signatures"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0009-0005-7613-1167","authenticated-orcid":false,"given":"Shiduo","family":"Zhang","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9289-5918","authenticated-orcid":false,"given":"Huiwen","family":"Jia","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0009-0003-2630-2680","authenticated-orcid":false,"given":"Delong","family":"Ran","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0120-0648","authenticated-orcid":false,"given":"Yang","family":"Yu","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9278-4521","authenticated-orcid":false,"given":"Yu","family":"Yu","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7846-269X","authenticated-orcid":false,"given":"Xiaoyun","family":"Wang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,12,8]]},"reference":[{"key":"8_CR1","doi-asserted-by":"crossref","unstructured":"Ajtai, M.: Generating hard instances of lattice problems. In: Proceedings of the Twenty-Eighth Annual ACM Symposium on Theory of Computing, pp. 99\u2013108 (1996)","DOI":"10.1145\/237814.237838"},{"key":"8_CR2","doi-asserted-by":"publisher","unstructured":"Bootle, J., Lyubashevsky, V., Nguyen, N.K., Sorniotti, A.: A framework for practical anonymous credentials from lattices. In: Annual International Cryptology Conference, pp. 384\u2013417. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-38545-2_13","DOI":"10.1007\/978-3-031-38545-2_13"},{"key":"8_CR3","doi-asserted-by":"crossref","unstructured":"Brakerski, Z., Langlois, A., Peikert, C., Regev, O., Stehl\u00e9, D.: Classical hardness of learning with errors. In: Proceedings of the forty-fifth annual ACM symposium on Theory of computing, pp. 575\u2013584 (2013)","DOI":"10.1145\/2488608.2488680"},{"key":"8_CR4","doi-asserted-by":"publisher","first-page":"610","DOI":"10.1007\/s00145-017-9265-9","volume":"31","author":"S Bai","year":"2018","unstructured":"Bai, S., Lepoint, T., Roux-Langlois, A., Sakzad, A., Stehl\u00e9, D., Steinfeld, R.: Improved security proofs in lattice-based cryptography: using the r\u00e9nyi divergence rather than the statistical distance. J. Cryptol. 31, 610\u2013640 (2018)","journal-title":"J. Cryptol."},{"key":"8_CR5","unstructured":"Bonfield, J.: jkbonfield\/rans_static. https:\/\/github.com\/jkbonfield\/rans_static (2022). Accessed 31 Aug 2023"},{"key":"8_CR6","doi-asserted-by":"crossref","unstructured":"Cheon, J.H., et al.: Shorter lattice-based fiat-shamir signatures. Cryptology ePrint Archive, Haetae (2023)","DOI":"10.46586\/tches.v2024.i3.25-75"},{"key":"8_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-030-34618-8_1","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2019","author":"Y Chen","year":"2019","unstructured":"Chen, Y., Genise, N., Mukherjee, P.: Approximate trapdoors for lattices and\u00a0smaller hash-and-sign signatures. In: Galbraith, S.D., Moriai, S. (eds.) ASIACRYPT 2019. LNCS, vol. 11923, pp. 3\u201332. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-34618-8_1"},{"key":"8_CR8","unstructured":"Collet, Y.: Cyan4973\/finitestateentropy. https:\/\/github.com\/Cyan4973\/FiniteStateEntropy\/ (2022). Accessed 31 Aug 2023"},{"key":"8_CR9","unstructured":"Identification Cards Integrated\u00a0Circuit Cards-Part. 4: organization, security and commands for interchange (2013)"},{"key":"8_CR10","doi-asserted-by":"publisher","unstructured":"Ducas, L., Espitau, T., Postlethwaite, E.W.: Finding short integer solutions when the modulus is small. In: Annual International Cryptology Conference, pp. 150\u2013176. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-38548-3_6","DOI":"10.1007\/978-3-031-38548-3_6"},{"key":"8_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"608","DOI":"10.1007\/978-3-030-45724-2_21","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2020","author":"L Ducas","year":"2020","unstructured":"Ducas, L., Galbraith, S., Prest, T., Yu, Y.: Integral matrix gram root and lattice gaussian sampling without floats. In: Canteaut, A., Ishai, Y. (eds.) EUROCRYPT 2020. LNCS, vol. 12106, pp. 608\u2013637. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-45724-2_21"},{"key":"8_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"22","DOI":"10.1007\/978-3-662-45608-8_2","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2014","author":"L Ducas","year":"2014","unstructured":"Ducas, L., Lyubashevsky, V., Prest, T.: Efficient identity-based encryption over NTRU lattices. In: Sarkar, P., Iwata, T. (eds.) ASIACRYPT 2014. LNCS, vol. 8874, pp. 22\u201341. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-662-45608-8_2"},{"key":"8_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"433","DOI":"10.1007\/978-3-642-34961-4_27","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2012","author":"L Ducas","year":"2012","unstructured":"Ducas, L., Nguyen, P.Q.: Learning a Zonotope and More: cryptanalysis of NTRUSign countermeasures. In: Wang, X., Sako, K. (eds.) ASIACRYPT 2012. LNCS, vol. 7658, pp. 433\u2013450. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-34961-4_27"},{"key":"8_CR14","unstructured":"Ducas, L., Prest, T.: A hybrid gaussian sampler for lattices over rings. IACR Cryptology ePrint Archive, p. 660 (2015)"},{"key":"8_CR15","first-page":"191","volume":"2016","author":"L Ducas","year":"2016","unstructured":"Ducas, L., Prest, T.: Fast fourier orthogonalization. ISSAC 2016, 191\u2013198 (2016)","journal-title":"ISSAC"},{"key":"8_CR16","unstructured":"Ducas, L., Pulles, L.N.: Accurate score prediction for dual-sieve attacks. Cryptology ePrint Archive (2023)"},{"key":"8_CR17","doi-asserted-by":"publisher","unstructured":"Ducas, L., Postlethwaite, E.W., Pulles, L.N., van Woerden, W.: Hawk: module lip makes lattice signatures fast, compact and simple. In: International Conference on the Theory and Application of Cryptology and Information Security, pp. 65\u201394. Springer (2022). https:\/\/doi.org\/10.1007\/978-3-031-22972-5_3","DOI":"10.1007\/978-3-031-22972-5_3"},{"key":"8_CR18","unstructured":"Duda, J.: Asymmetric numeral systems. arXiv preprint arXiv:0902.0271 (2009)"},{"key":"8_CR19","unstructured":"Duda, J.: Asymmetric numeral systems: entropy coding combining speed of huffman coding with compression rate of arithmetic coding. arXiv preprint arXiv:1311.2540 (2013)"},{"key":"8_CR20","doi-asserted-by":"publisher","unstructured":"Ducas, L., van Woerden, W.: On the lattice isomorphism problem, quadratic forms, remarkable lattices, and cryptography. In: Annual International Conference on the Theory and Applications of Cryptographic Techniques, pp. 643\u2013673. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-07082-2_23","DOI":"10.1007\/978-3-031-07082-2_23"},{"key":"8_CR21","doi-asserted-by":"crossref","unstructured":"Espitau, T., et al.: MITAKA: a Simpler, Parallelizable, Maskable Variant of FALCON. In: Eurocrypt 2022 (2022)","DOI":"10.1007\/978-3-031-07082-2_9"},{"key":"8_CR22","doi-asserted-by":"publisher","unstructured":"Espitau, T., Nguyen, T.T.Q., Sun, C., Tibouchi, M., Wallet, A.: Antrag: Annular NTRU trapdoor generation: making mitaka as secure as falcon. In: International Conference on the Theory and Application of Cryptology and Information Security, pp. 3\u201336. Springer, Singapore (2023). https:\/\/doi.org\/10.1007\/978-981-99-8739-9_1","DOI":"10.1007\/978-981-99-8739-9_1"},{"key":"8_CR23","doi-asserted-by":"publisher","unstructured":"Espitau, T., Tibouchi, M., Wallet, A., Yu, Y.: Shorter hash-and-sign lattice-based signatures. In: Annual International Cryptology Conference, pp. 245\u2013275. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-15979-4_9","DOI":"10.1007\/978-3-031-15979-4_9"},{"key":"8_CR24","doi-asserted-by":"crossref","unstructured":"Esgin, M.F., Zhao, R.K., Steinfeld, R., Liu, J.K., Liu, D.: Matrict: efficient, scalable and post-quantum blockchain confidential transactions protocol. In: Proceedings of the 2019 ACM SIGSAC Conference on Computer and Communications Security, pp. 567\u2013584 (2019)","DOI":"10.1145\/3319535.3354200"},{"key":"8_CR25","first-page":"34","volume":"2020","author":"P-A Fouque","year":"2020","unstructured":"Fouque, P.-A., Kirchner, P., Tibouchi, M., Wallet, A., Yang, Yu.: Key recovery from Gram-Schmidt norm leakage in hash-and-sign signatures over NTRU lattices. In EUROCRYPT 2020, 34\u201363 (2020)","journal-title":"In EUROCRYPT"},{"key":"8_CR26","doi-asserted-by":"crossref","unstructured":"Gentry, C.: Fully homomorphic encryption using ideal lattices. In: Proceedings of the Forty-First Annual ACM Symposium on Theory of Computing, pp. 169\u2013178 (2009)","DOI":"10.1145\/1536414.1536440"},{"key":"8_CR27","unstructured":"Giesen, F.: Rans notes. https:\/\/fgiesen.wordpress.com\/2014\/02\/02\/rans-notes\/ (2014). Accessed 17 Aug 2023"},{"key":"8_CR28","first-page":"197","volume":"2008","author":"C Gentry","year":"2008","unstructured":"Gentry, C., Peikert, C., Vaikuntanathan, V.: Trapdoors for hard lattices and new cryptographic constructions. In STOC 2008, 197\u2013206 (2008)","journal-title":"In STOC"},{"issue":"6","key":"8_CR29","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2824233","volume":"62","author":"S Gorbunov","year":"2015","unstructured":"Gorbunov, S., Vaikuntanathan, V., Wee, H.: Attribute-based encryption for circuits. J. ACM (JACM) 62(6), 1\u201333 (2015)","journal-title":"J. ACM (JACM)"},{"key":"8_CR30","doi-asserted-by":"publisher","unstructured":"Hoffstein, J., Howgrave-Graham, N., Pipher, J., Silverman, J.H., Whyte, W.: NTRUsign: digital signatures using the NTRU lattice. In: Cryptographers, track at the RSA Conference, pp. 122\u2013140. Springer, Berlin, Heidelberg (2003). https:\/\/doi.org\/10.1007\/3-540-36563-X_9","DOI":"10.1007\/3-540-36563-X_9"},{"key":"8_CR31","doi-asserted-by":"crossref","unstructured":"Howe, J., Prest, T., Ricosset, T., Rossi, M.: Isochronous gaussian sampling: from inception to implementation. In: PQCrypto, vol. 2020, pp. 53\u201371 (2020)","DOI":"10.1007\/978-3-030-44223-1_4"},{"key":"8_CR32","doi-asserted-by":"crossref","unstructured":"Jin, H., Liu, F.-H., Wang, Z., Gu, D.: Discrete gaussians modulo sub-lattices: new leftover hash lemmas for discrete gaussians. Cryptology ePrint Archive, Paper 2024\/1695 (2024)","DOI":"10.1007\/978-3-031-91823-0_10"},{"key":"8_CR33","unstructured":"Johnson, J.: Dietgpu: GPU-based lossless compression for numerical data. https:\/\/github.com\/facebookresearch\/dietgpu (2022). Accessed 31 Aug 2023"},{"key":"8_CR34","doi-asserted-by":"publisher","unstructured":"Jeudy, C., Roux-Langlois, A., Sanders, O.: Lattice signature with efficient protocols, application to anonymous credentials. In: Annual International Cryptology Conference, pp. 351\u2013383. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-38545-2_12","DOI":"10.1007\/978-3-031-38545-2_12"},{"key":"8_CR35","first-page":"937","volume":"2000","author":"PN Klein","year":"2000","unstructured":"Klein, P.N.: Finding the closest lattice vector when it\u2019s unusually close. SODA 2000, 937\u2013941 (2000)","journal-title":"SODA"},{"key":"8_CR36","unstructured":"Lyubashevsky, V., et al.: Submission to the NIST\u2019s post-quantum cryptography standardization process, CRYSTALS-DILITHIUM (2022)"},{"key":"8_CR37","doi-asserted-by":"publisher","unstructured":"Lin, X., et al.: Cryptanalysis of the peregrine lattice-based signature scheme. In: IACR International Conference on Public-Key Cryptography, pp. 387\u2013412. Springer, Cham (2024). https:\/\/doi.org\/10.1007\/978-3-031-57718-5_13","DOI":"10.1007\/978-3-031-57718-5_13"},{"key":"8_CR38","doi-asserted-by":"publisher","unstructured":"Micciancio , D., Peikert, C.: Trapdoors for lattices: simpler, tighter, faster, smaller. In: Annual International Conference on the Theory and Applications of Cryptographic Techniques, pp. 700\u2013718. Springer, Berlin, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-29011-4_41","DOI":"10.1007\/978-3-642-29011-4_41"},{"key":"8_CR39","doi-asserted-by":"publisher","unstructured":"Micciancio, D., Peikert, C.: Hardness of SIS and LWE with small parameters. In: Annual cryptology conference, pp. 21\u201339. Springer, Berlin, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-40041-4_2","DOI":"10.1007\/978-3-642-40041-4_2"},{"issue":"1","key":"8_CR40","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1137\/S0097539705447360","volume":"37","author":"D Micciancio","year":"2007","unstructured":"Micciancio, D., Regev, O.: Worst-case to average-case reductions based on gaussian measures. SIAM J. Comput. 37(1), 267\u2013302 (2007)","journal-title":"SIAM J. Comput."},{"key":"8_CR41","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"455","DOI":"10.1007\/978-3-319-63715-0_16","volume-title":"Advances in Cryptology \u2013 CRYPTO 2017","author":"D Micciancio","year":"2017","unstructured":"Micciancio, D., Walter, M.: Gaussian sampling over the integers: efficient, generic, constant-time. In: Katz, J., Shacham, H. (eds.) CRYPTO 2017. LNCS, vol. 10402, pp. 455\u2013485. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-63715-0_16"},{"key":"8_CR42","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1007\/11761679_17","volume-title":"Advances in Cryptology - EUROCRYPT 2006","author":"PQ Nguyen","year":"2006","unstructured":"Nguyen, P.Q., Regev, O.: Learning a parallelepiped: cryptanalysis of GGH and NTRU signatures. In: Vaudenay, S. (ed.) EUROCRYPT 2006. LNCS, vol. 4004, pp. 271\u2013288. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11761679_17"},{"key":"8_CR43","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1007\/978-3-642-14623-7_5","volume-title":"Advances in Cryptology \u2013 CRYPTO 2010","author":"C Peikert","year":"2010","unstructured":"Peikert, C.: An efficient and parallel gaussian sampler for lattices. In: Rabin, T. (ed.) CRYPTO 2010. LNCS, vol. 6223, pp. 80\u201397. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-14623-7_5"},{"key":"8_CR44","doi-asserted-by":"crossref","unstructured":"Peikert, C.: A decade of lattice cryptography (2016)","DOI":"10.1561\/9781680831139"},{"key":"8_CR45","unstructured":"Prest, T., et al.: Submission to the NIST\u2019s post-quantum cryptography standardization process, Falcon (2022)"},{"key":"8_CR46","unstructured":"Prest, T.: Gaussian Sampling in Lattice-Based Cryptography. PhD thesis, \u00c9cole Normale Sup\u00e9rieure, Paris, France (2015)"},{"key":"8_CR47","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"347","DOI":"10.1007\/978-3-319-70694-8_13","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2017","author":"T Prest","year":"2017","unstructured":"Prest, T.: Sharper bounds in lattice-based cryptography using the R\u00e9nyi divergence. In: Takagi, T., Peyrin, T. (eds.) ASIACRYPT 2017. LNCS, vol. 10624, pp. 347\u2013374. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-70694-8_13"},{"key":"8_CR48","doi-asserted-by":"publisher","unstructured":"Peikert, C., Shiehian, S.: Noninteractive zero knowledge for np from (plain) learning with errors. In: Annual International Cryptology Conference, 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":"8_CR49","unstructured":"Bos, J., et al.: CRYSTALS-KYBER: Submission to the NIST\u2019s post-quantum cryptography standardization process (2022)"},{"issue":"2","key":"8_CR50","doi-asserted-by":"publisher","first-page":"749","DOI":"10.1137\/15M1052226","volume":"31","author":"O Regev","year":"2017","unstructured":"Regev, O., Stephens-Davidowitz, N.: An inequality for gaussians on lattices. SIAM J. Discret. Math. 31(2), 749\u2013757 (2017)","journal-title":"SIAM J. Discret. Math."},{"key":"8_CR51","unstructured":"Saarinen, M.-J.O.: Buffer overflows in haetae\/on crypto vs implementation errors (2023). https:\/\/groups.google.com\/a\/list.nist.gov\/g\/pqc-forum\/c\/ImcSqGLFdoo. Accessed 31 Aug 2023"},{"key":"8_CR52","unstructured":"Saarinen, M.-J.O.: Hufu: Big-flipping forgeries and buffer overflows (2023). https:\/\/groups.google.com\/a\/list.nist.gov\/g\/pqc-forum\/c\/Hq-wRFDbIaU. Accessed 31 Aug 2023"},{"key":"8_CR53","unstructured":"Stein, E.M., Shakarchi, R.: Complex Analysis, vol. 2. Princeton University Press (2010)"},{"key":"8_CR54","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"525","DOI":"10.1007\/978-3-030-03329-3_18","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2018","author":"Y Yu","year":"2018","unstructured":"Yu, Y., Ducas, L.: Learning strikes again: the case of the DRS signature scheme. In: Peyrin, T., Galbraith, S. (eds.) ASIACRYPT 2018. LNCS, vol. 11273, pp. 525\u2013543. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-030-03329-3_18"},{"key":"8_CR55","unstructured":"Yang, Y., et al.: Hash-and-sign signatures from powerful gadgets. Algorithm Specifications and Supporting Documentation, Hufu (2023)"},{"key":"8_CR56","doi-asserted-by":"publisher","unstructured":"Yu, Y., Jia, H., Wang, X.: Compact lattice gadget and its applications to hash-and-sign signatures. In Annual International Cryptology Conference, pp. 390\u2013420. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-38554-4_13","DOI":"10.1007\/978-3-031-38554-4_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-5099-9_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,2,9]],"date-time":"2026-02-09T17:49:12Z","timestamp":1770659352000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-95-5099-9_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,12,8]]},"ISBN":["9789819550982","9789819550999"],"references-count":56,"URL":"https:\/\/doi.org\/10.1007\/978-981-95-5099-9_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"}}]}}