{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,7]],"date-time":"2025-12-07T12:00:43Z","timestamp":1765108843066,"version":"3.46.0"},"publisher-location":"Singapore","reference-count":38,"publisher":"Springer Nature Singapore","isbn-type":[{"value":"9789819550173","type":"print"},{"value":"9789819550180","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-5018-0_17","type":"book-chapter","created":{"date-parts":[[2025,12,7]],"date-time":"2025-12-07T11:57:03Z","timestamp":1765108623000},"page":"514-545","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Revisiting Time-Space Tradeoffs in\u00a0Collision Search and\u00a0Decision Problems"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-8847-6748","authenticated-orcid":false,"given":"Jian","family":"Guo","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0009-0001-5187-7035","authenticated-orcid":false,"given":"Wenjie","family":"Nan","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0009-0009-0347-8230","authenticated-orcid":false,"given":"Yiran","family":"Yao","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,12,8]]},"reference":[{"issue":"4","key":"17_CR1","doi-asserted-by":"publisher","first-page":"595","DOI":"10.1145\/1008731.1008735","volume":"51","author":"S Aaronson","year":"2004","unstructured":"Aaronson, S., Shi, Y.: Quantum lower bounds for the collision and the element distinctness problems. J. ACM (JACM) 51(4), 595\u2013605 (2004). https:\/\/doi.org\/10.1145\/1008731.1008735","journal-title":"J. ACM (JACM)"},{"issue":"1","key":"17_CR2","doi-asserted-by":"publisher","first-page":"210","DOI":"10.1137\/S0097539705447311","volume":"37","author":"A Ambainis","year":"2007","unstructured":"Ambainis, A.: Quantum walk algorithm for element distinctness. SIAM J. Comput. 37(1), 210\u2013239 (2007). https:\/\/doi.org\/10.1137\/S0097539705447311","journal-title":"SIAM J. Comput."},{"issue":"5","key":"17_CR3","doi-asserted-by":"publisher","first-page":"1755","DOI":"10.1137\/17M1158203","volume":"47","author":"N Bansal","year":"2018","unstructured":"Bansal, N., et al.: Faster space-efficient algorithms for subset sum, k-sum, and related problems. SIAM J. Comput. 47(5), 1755\u20131777 (2018). https:\/\/doi.org\/10.1137\/17M1158203","journal-title":"SIAM J. Comput."},{"key":"17_CR4","doi-asserted-by":"publisher","unstructured":"Beame, P., Clifford, R., Machmouchi, W.: Element distinctness, frequency moments, and sliding windows. In: 54th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2013, Berkeley, CA, USA, 26\u201329 October 2013, pp. 290\u2013299. IEEE Computer Society (2013). https:\/\/doi.org\/10.1109\/FOCS.2013.39","DOI":"10.1109\/FOCS.2013.39"},{"key":"17_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"401","DOI":"10.1007\/978-3-540-24676-3_24","volume-title":"Advances in Cryptology - EUROCRYPT 2004","author":"M Bellare","year":"2004","unstructured":"Bellare, M., Kohno, T.: Hash function balance and its impact on birthday attacks. In: Cachin, C., Camenisch, J.L. (eds.) EUROCRYPT 2004. LNCS, vol. 3027, pp. 401\u2013418. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-24676-3_24"},{"key":"17_CR6","doi-asserted-by":"publisher","unstructured":"Belovs, A.: Learning-graph-based quantum algorithm for k-distinctness. In: 53rd Annual IEEE Symposium on Foundations of Computer Science, FOCS 2012, New Brunswick, NJ, USA, 20\u201323 October 2012, pp. 207\u2013216. IEEE Computer Society (2012). https:\/\/doi.org\/10.1109\/FOCS.2012.18","DOI":"10.1109\/FOCS.2012.18"},{"key":"17_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1007\/978-3-642-39206-1_10","volume-title":"Automata, Languages, and Programming","author":"A Belovs","year":"2013","unstructured":"Belovs, A., Childs, A.M., Jeffery, S., Kothari, R., Magniez, F.: Time-efficient quantum walks for 3-distinctness. In: Fomin, F.V., Freivalds, R., Kwiatkowska, M., Peleg, D. (eds.) ICALP 2013. LNCS, vol. 7965, pp. 105\u2013122. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-39206-1_10"},{"key":"17_CR8","doi-asserted-by":"publisher","unstructured":"Bennett, H., Ghentiyala, S., Stephens-Davidowitz, N.: The more the merrier! on total coding and lattice problems and the complexity of finding multicollisions. In: 16th Innovations in Theoretical Computer Science Conference (ITCS 2025). Schloss Dagstuhl\u2013Leibniz-Zentrum f\u00fcr Informatik, pp. 14\u20131 (2025). https:\/\/doi.org\/10.4230\/LIPIcs.ITCS.2025.14","DOI":"10.4230\/LIPIcs.ITCS.2025.14"},{"key":"17_CR9","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1007\/978-3-031-30589-4_8","volume-title":"EUROCRYPT 2023","author":"X Bonnetain","year":"2023","unstructured":"Bonnetain, X., Chailloux, A., Schrottenloher, A., Shen, Y.: Finding many collisions via reusable quantum walks. In: Hazay, C., Stam, M. (eds.) EUROCRYPT 2023. LNCS, vol. 14008, pp. 221\u2013251. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-30589-4_8"},{"issue":"1","key":"17_CR10","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1137\/0216007","volume":"16","author":"A Borodin","year":"1987","unstructured":"Borodin, A., et al.: A time-space tradeoff for element distinctness. SIAM J. Comput. 16(1), 97\u201399 (1987). https:\/\/doi.org\/10.1137\/0216007","journal-title":"SIAM J. Comput."},{"key":"17_CR11","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"429","DOI":"10.1007\/978-3-031-68388-6_15","volume-title":"CRYPTO 2024","author":"J Buzek","year":"2024","unstructured":"Buzek, J., Tessaro, S.: Collision resistance from multi-collision resistance for all constant parameters. In: Reyzin, L., Stebila, D. (eds.) CRYPTO 2024. LNCS, vol. 14924, pp. 429\u2013458. Springer, Cham (2024). https:\/\/doi.org\/10.1007\/978-3-031-68388-6_15"},{"key":"17_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1007\/978-3-319-70697-9_8","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2017","author":"A Chailloux","year":"2017","unstructured":"Chailloux, A., Naya-Plasencia, M., Schrottenloher, A.: An efficient quantum collision search algorithm and implications on symmetric cryptography. In: Takagi, T., Peyrin, T. (eds.) ASIACRYPT 2017. LNCS, vol. 10625, pp. 211\u2013240. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-70697-9_8"},{"key":"17_CR13","doi-asserted-by":"publisher","unstructured":"Chen, L., et al.: Truly low-space element distinctness and subset sum via pseudorandom hash functions. In: Naor, J., Buchbinder, N. (eds.) Proceedings of the 2022 ACMSIAM Symposium on Discrete Algorithms, SODA 2022, Virtual Conference\/Alexandria, VA, USA, 9\u201312 January 2022, pp. 1661\u20131678. SIAM (2022). https:\/\/doi.org\/10.1137\/1.9781611977073.67","DOI":"10.1137\/1.9781611977073.67"},{"key":"17_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1007\/978-3-030-64381-2_12","volume-title":"Theory of Cryptography","author":"W Dai","year":"2020","unstructured":"Dai, W., Tessaro, S., Zhang, X.: Super-linear time-memory trade-offs for symmetric encryption. In: Pass, R., Pietrzak, K. (eds.) TCC 2020. LNCS, vol. 12552, pp. 335\u2013365. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-64381-2_12"},{"key":"17_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"405","DOI":"10.1007\/978-3-030-45721-1_15","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2020","author":"I Dinur","year":"2020","unstructured":"Dinur, I.: Tight time-space lower bounds for finding multiple collision pairs and their applications. In: Canteaut, A., Ishai, Y. (eds.) EUROCRYPT 2020. LNCS, vol. 12105, pp. 405\u2013434. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-45721-1_15"},{"key":"17_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1007\/978-3-662-53008-5_7","volume-title":"Advances in Cryptology \u2013 CRYPTO 2016","author":"I Dinur","year":"2016","unstructured":"Dinur, I., Dunkelman, O., Keller, N., Shamir, A.: Memory-efficient algorithms for finding needles in haystacks. In: Robshaw, M., Katz, J. (eds.) CRYPTO 2016. LNCS, vol. 9815, pp. 185\u2013206. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-53008-5_7"},{"key":"17_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1007\/3-540-46885-4_34","volume-title":"Advances in Cryptology \u2014 EUROCRYPT \u201989","author":"P Flajolet","year":"1990","unstructured":"Flajolet, P., Odlyzko, A.M.: Random mapping statistics. In: Quisquater, J.-J., Vandewalle, J. (eds.) EUROCRYPT 1989. LNCS, vol. 434, pp. 329\u2013354. Springer, Heidelberg (1990). https:\/\/doi.org\/10.1007\/3-540-46885-4_34"},{"key":"17_CR18","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"706","DOI":"10.1007\/978-3-031-07085-3_24","volume-title":"EUROCRYPT 2022","author":"A Ghoshal","year":"2022","unstructured":"Ghoshal, A., Ghosal, R., Jaeger, J., Tessaro, S.: Hiding in plain sight: memory-tight proofs via randomness programming. In: Dunkelman, O., Dziembowski, S. (eds.) EUROCRYPT 2022. LNCS, vol. 13276, pp. 706\u2013735. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-07085-3_24"},{"key":"17_CR19","unstructured":"Guo, J., Nan, W., Yao, Y.: Revisiting time-space tradeoffs in collision search and decision problems. Cryptology ePrint Archive, Paper 2025\/1550 (2025)"},{"issue":"4","key":"17_CR20","doi-asserted-by":"publisher","first-page":"401","DOI":"10.1109\/TIT.1980.1056220","volume":"26","author":"M Hellman","year":"2003","unstructured":"Hellman, M.: A cryptanalytic time-memory trade-off. IEEE Trans. Inf. Theory 26(4), 401\u2013406 (2003). https:\/\/doi.org\/10.1109\/TIT.1980.1056220","journal-title":"IEEE Trans. Inf. Theory"},{"key":"17_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"350","DOI":"10.1007\/978-3-030-25510-7_19","volume-title":"Post-Quantum Cryptography","author":"A Hosoyamada","year":"2019","unstructured":"Hosoyamada, A., Sasaki, Yu., Tani, S., Xagawa, K.: Improved quantum multicollision-finding algorithm. In: Ding, J., Steinwandt, R. (eds.) PQCrypto 2019. LNCS, vol. 11505, pp. 350\u2013367. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-25510-7_19"},{"key":"17_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"467","DOI":"10.1007\/978-3-030-17653-2_16","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2019","author":"J Jaeger","year":"2019","unstructured":"Jaeger, J., Tessaro, S.: Tight time-memory trade-offs for symmetric encryption. In: Ishai, Y., Rijmen, V. (eds.) EUROCRYPT 2019. LNCS, vol. 11476, pp. 467\u2013497. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-17653-2_16"},{"key":"17_CR23","doi-asserted-by":"publisher","unstructured":"Jain, S., et al.: On pigeonhole principles and Ramsey in TFNP. In: 2024 IEEE 65th Annual Symposium on Foundations of Computer Science (FOCS), pp. 406\u2013428. IEEE (2024). https:\/\/doi.org\/10.48550\/arXiv.2401.12604","DOI":"10.48550\/arXiv.2401.12604"},{"key":"17_CR24","doi-asserted-by":"publisher","unstructured":"Jeffery, S., Zur, S.: Multidimensional quantum walks. In: Proceedings of the 55th Annual ACM Symposium on Theory of Computing, pp. 1125\u20131130 (2023). https:\/\/doi.org\/10.48550\/arXiv.2208.13492","DOI":"10.48550\/arXiv.2208.13492"},{"key":"17_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"306","DOI":"10.1007\/978-3-540-28628-8_19","volume-title":"Advances in Cryptology \u2013 CRYPTO 2004","author":"A Joux","year":"2004","unstructured":"Joux, A.: Multicollisions in iterated hash functions. Application to cascaded constructions. In: Franklin, M. (ed.) CRYPTO 2004. LNCS, vol. 3152, pp. 306\u2013316. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-28628-8_19"},{"key":"17_CR26","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"347","DOI":"10.1007\/978-3-642-10366-7_21","volume-title":"ASIACRYPT 2009","author":"A Joux","year":"2009","unstructured":"Joux, A., Lucks, S.: Improved generic algorithms for 3-collisions. In: Matsui, M. (ed.) ASIACRYPT 2009. LNCS, vol. 5912, pp. 347\u2013363. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-10366-7_21"},{"key":"17_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1007\/978-3-030-17659-4_7","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2019","author":"Q Liu","year":"2019","unstructured":"Liu, Q., Zhandry, M.: On finding quantum multi-collisions. In: Ishai, Y., Rijmen, V. (eds.) EUROCRYPT 2019. LNCS, vol. 11478, pp. 189\u2013218. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-17659-4_7"},{"key":"17_CR28","doi-asserted-by":"publisher","unstructured":"Lyu, X., Zhu, W.: Time-space tradeoffs for element distinctness and set intersection via pseudorandomness. In: Bansal, N., Nagarajan, V. (eds.) Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, SODA 2023, Florence, Italy, 22\u201325 January 2023, pp. 5243\u20135281. SIAM (2023). https:\/\/doi.org\/10.1137\/1.9781611977554.CH190","DOI":"10.1137\/1.9781611977554.CH190"},{"key":"17_CR29","doi-asserted-by":"publisher","unstructured":"Mande, N.S., Thaler, J., Zhu, S.: Improved approximate degree bounds for k-distinctness. In: Flammia, S.T. (eds.) 15th Conference on the Theory of Quantum Computation, Communication and Cryptography, TQC 2020, Riga, Latvia, 9\u201312 June 2020, vol. 158. LIPIcs. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik, pp. 2:1\u20132:22 (2020). https:\/\/doi.org\/10.4230\/LIPICS.TQC.2020.2","DOI":"10.4230\/LIPICS.TQC.2020.2"},{"issue":"2","key":"17_CR30","doi-asserted-by":"publisher","first-page":"759","DOI":"10.1109\/TIT.2006.889721","volume":"53","author":"M Nandi","year":"2007","unstructured":"Nandi, M., Stinson, D.R.: Multicollision attacks on some generalized sequential hash functions. IEEE Trans. Inf. Theory 53(2), 759\u2013767 (2007). https:\/\/doi.org\/10.1109\/TIT.2006.889721","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"1","key":"17_CR31","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/PL00003816","volume":"12","author":"PC van Oorschot","year":"1999","unstructured":"van Oorschot, P.C., Wiener, M.J.: Parallel collision search with cryptanalytic applications. J. Cryptol. 12(1), 1\u201328 (1999). https:\/\/doi.org\/10.1007\/PL00003816","journal-title":"J. Cryptol."},{"issue":"143","key":"17_CR32","doi-asserted-by":"publisher","first-page":"918","DOI":"10.2307\/2006496","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). https:\/\/doi.org\/10.2307\/2006496","journal-title":"Math. Comput."},{"issue":"7","key":"17_CR33","doi-asserted-by":"publisher","first-page":"4798","DOI":"10.1109\/TIT.2011.2146570","volume":"57","author":"SC Ramanna","year":"2011","unstructured":"Ramanna, S.C., Sarkar, P.: On quantifying the resistance of concrete hash functions to generic multicollision attacks. IEEE Trans. Inf. Theory 57(7), 4798\u20134816 (2011). https:\/\/doi.org\/10.1109\/TIT.2011.2146570","journal-title":"IEEE Trans. Inf. Theory"},{"key":"17_CR34","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"503","DOI":"10.1007\/978-3-031-15982-4_17","volume-title":"CRYPTO 2022","author":"RD Rothblum","year":"2022","unstructured":"Rothblum, R.D., Vasudevan, P.N.: Collision-resistance from multi-collision-resistance. In: Dodis, Y., Shrimpton, T. (eds.) CRYPTO 2022. LNCS, vol. 13509, pp. 503\u2013529. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-15982-4_17"},{"key":"17_CR35","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-030-03807-6_1","volume-title":"Theory of Cryptography","author":"S Tessaro","year":"2018","unstructured":"Tessaro, S., Thiruvengadam, A.: Provable time-memory trade-offs: symmetric cryptography against memory-bounded adversaries. In: Beimel, A., Dziembowski, S. (eds.) TCC 2018. LNCS, vol. 11239, pp. 3\u201332. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-030-03807-6_1"},{"issue":"5","key":"17_CR36","doi-asserted-by":"publisher","first-page":"966","DOI":"10.1137\/S0097539788148959","volume":"23","author":"AC-C Yao","year":"1994","unstructured":"Yao, A.C.-C.: Near-optimal time-space tradeoff for element distinctness. SIAM J. Comput. 23(5), 966\u2013975 (1994). https:\/\/doi.org\/10.1137\/S0097539788148959","journal-title":"SIAM J. Comput."},{"key":"17_CR37","doi-asserted-by":"publisher","unstructured":"Yu, H., Zhan, W.: Randomized vs. deterministic separation in time-space tradeoffs of multi-output functions. In: Guruswami, V. (ed.) 15th Innovations in Theoretical Computer Science Conference (ITCS 2024), Leibniz International Proceedings in Informatics (LIPIcs). Dagstuhl, Germany: Schloss Dagstuhl \u2013 Leibniz-Zentrum f\u00fcr Informatik, vol. 287, pp. 99:1\u201399:15 (2024). https:\/\/doi.org\/10.4230\/LIPIcs.ITCS.2024.99. ISBN 978-3-95977-309-6","DOI":"10.4230\/LIPIcs.ITCS.2024.99"},{"key":"17_CR38","doi-asserted-by":"publisher","first-page":"181619","DOI":"10.1109\/ACCESS.2020.3028736","volume":"8","author":"J Zou","year":"2020","unstructured":"Zou, J., Liu, Y., Dong, L.: An efficient quantum multi-collision search algorithm. IEEE Access 8, 181619\u2013181628 (2020). https:\/\/doi.org\/10.1109\/ACCESS.2020.3028736","journal-title":"IEEE Access"}],"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-5018-0_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,12,7]],"date-time":"2025-12-07T11:57:05Z","timestamp":1765108625000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-95-5018-0_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,12,8]]},"ISBN":["9789819550173","9789819550180"],"references-count":38,"URL":"https:\/\/doi.org\/10.1007\/978-981-95-5018-0_17","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"}}]}}