{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,14]],"date-time":"2026-01-14T15:29:37Z","timestamp":1768404577577,"version":"3.49.0"},"publisher-location":"Singapore","reference-count":39,"publisher":"Springer Nature Singapore","isbn-type":[{"value":"9789819551156","type":"print"},{"value":"9789819551163","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-5116-3_11","type":"book-chapter","created":{"date-parts":[[2025,12,7]],"date-time":"2025-12-07T11:22:25Z","timestamp":1765106545000},"page":"327-360","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Fuzzy Private Set Intersection from\u00a0VOLE"],"prefix":"10.1007","author":[{"given":"Aron","family":"van Baarsen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0003-2056-6079","authenticated-orcid":false,"given":"Sihang","family":"Pu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,12,8]]},"reference":[{"key":"11_CR1","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"340","DOI":"10.1007\/978-3-031-58740-5_12","volume-title":"EUROCRYPT 2024, Part V","author":"A van Baarsen","year":"2024","unstructured":"van Baarsen, A., Pu, S.: Fuzzy private set intersection with large hyperballs. In: Joye, M., Leander, G. (eds.) EUROCRYPT 2024, Part V. LNCS, vol. 14655, pp. 340\u2013369. Springer, Cham (2024). https:\/\/doi.org\/10.1007\/978-3-031-58740-5_12"},{"key":"11_CR2","unstructured":"van Baarsen, A., Pu, S.: Fuzzy private set intersection from VOLE. Cryptology ePrint Archive, Paper 2025\/911 (2025). https:\/\/eprint.iacr.org\/2025\/911"},{"key":"11_CR3","doi-asserted-by":"publisher","unstructured":"van Baarsen, A., Stevens, M.: Amortizing circuit-PSI in the multiple sender\/receiver setting. IACR Communications in Cryptology 1(3) (2024). https:\/\/doi.org\/10.62056\/a0fhsgvtw","DOI":"10.62056\/a0fhsgvtw"},{"key":"11_CR4","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1007\/978-3-031-30589-4_2","volume-title":"EUROCRYPT 2023, Part V","author":"J Bartusek","year":"2023","unstructured":"Bartusek, J., Garg, S., Jain, A., Policharla, G.V.: End-to-end secure messaging with traceability only for illegal content. In: Hazay, C., Stam, M. (eds.) EUROCRYPT 2023, Part V. LNCS, vol. 14008, pp. 35\u201366. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-30589-4_2"},{"key":"11_CR5","doi-asserted-by":"publisher","unstructured":"Bellare, M., Hoang, V.T., Rogaway, P.: Foundations of garbled circuits. In: Yu, T., Danezis, G., Gligor, V.D. (eds.) ACM CCS 2012: 19th Conference on Computer and Communications Security, pp. 784\u2013796. ACM Press, Raleigh, NC, USA (2012). https:\/\/doi.org\/10.1145\/2382196.2382279","DOI":"10.1145\/2382196.2382279"},{"key":"11_CR6","unstructured":"Bienstock, A., Patel, S., Seo, J.Y., Yeo, K.: Near-optimal oblivious key-value stores for efficient PSI, PSU and volume-hiding multi-maps. In: Calandrino, J.A., Troncoso, C. (eds.) USENIX Security 2023: 32nd USENIX Security Symposium, pp. 301\u2013318. USENIX Association, Anaheim, CA, USA (2023). https:\/\/www.usenix.org\/conference\/usenixsecurity23\/presentation\/bienstock"},{"key":"11_CR7","unstructured":"Blass, E.O., Noubir, G.: Assumption-free fuzzy PSI via predicate encryption. Cryptology ePrint Archive, Paper 2025\/217 (2025). https:\/\/eprint.iacr.org\/2025\/217"},{"key":"11_CR8","doi-asserted-by":"publisher","unstructured":"Boyle, E., et al.: Efficient two-round OT extension and silent non-interactive secure computation. In: Cavallaro, L., Kinder, J., Wang, X., Katz, J. (eds.) ACM CCS 2019: 26th Conference on Computer and Communications Security, pp. 291\u2013308. ACM Press, London, UK (2019). https:\/\/doi.org\/10.1145\/3319535.3354255","DOI":"10.1145\/3319535.3354255"},{"key":"11_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"489","DOI":"10.1007\/978-3-030-26954-8_16","volume-title":"Advances in Cryptology \u2013 CRYPTO 2019","author":"E Boyle","year":"2019","unstructured":"Boyle, E., Couteau, G., Gilboa, N., Ishai, Y., Kohl, L., Scholl, P.: Efficient pseudorandom correlation generators: silent OT extension and more. In: Boldyreva, A., Micciancio, D. (eds.) CRYPTO 2019, Part III. LNCS, vol. 11694, pp. 489\u2013518. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-26954-8_16"},{"key":"11_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1007\/978-3-662-46803-6_12","volume-title":"Advances in Cryptology - EUROCRYPT 2015","author":"E Boyle","year":"2015","unstructured":"Boyle, E., Gilboa, N., Ishai, Y.: Function secret sharing. In: Oswald, E., Fischlin, M. (eds.) EUROCRYPT 2015, Part II. LNCS, vol. 9057, pp. 337\u2013367. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-46803-6_12"},{"key":"11_CR11","doi-asserted-by":"publisher","unstructured":"Boyle, E., Gilboa, N., Ishai, Y.: Function secret sharing: improvements and extensions. In: Weippl, E.R., Katzenbeisser, S., Kruegel, C., Myers, A.C., Halevi, S. (eds.) ACM CCS 2016: 23rd Conference on Computer and Communications Security, pp. 1292\u20131303. ACM Press, Vienna, Austria (2016). https:\/\/doi.org\/10.1145\/2976749.2978429","DOI":"10.1145\/2976749.2978429"},{"key":"11_CR12","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"190","DOI":"10.1007\/978-3-031-31371-4_7","volume-title":"PKC 2023, Part II","author":"D Bui","year":"2023","unstructured":"Bui, D., Couteau, G.: Improved private set intersection for sets with small entries. In: Boldyreva, A., Kolesnikov, V. (eds.) PKC 2023, Part II. LNCS, vol. 13941, pp. 190\u2013220. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-31371-4_7"},{"key":"11_CR13","unstructured":"Chakraborti, A., Fanti, G., Reiter, M.K.: Distance-aware private set intersection. In: Calandrino, J.A., Troncoso, C. (eds.) USENIX Security 2023: 32nd USENIX Security Symposium, pp. 319\u2013336. USENIX Association, Anaheim, CA, USA (2023). https:\/\/www.usenix.org\/conference\/usenixsecurity23\/presentation\/chakraborti-intersection"},{"key":"11_CR14","doi-asserted-by":"publisher","unstructured":"Chen, H., Huang, Z., Laine, K., Rindal, P.: Labeled PSI from fully homomorphic encryption with malicious security. In: Lie, D., Mannan, M., Backes, M., Wang, X. (eds.) ACM CCS 2018: 25th Conference on Computer and Communications Security, pp. 1223\u20131237. ACM Press, Toronto, ON, Canada (2018). https:\/\/doi.org\/10.1145\/3243734.3243836","DOI":"10.1145\/3243734.3243836"},{"key":"11_CR15","unstructured":"Chongchitmate, W., Lu, S., Ostrovsky, R.: Approximate PSI with near-linear communication. Cryptology ePrint Archive, Paper 2024\/682 (2024). https:\/\/eprint.iacr.org\/2024\/682"},{"key":"11_CR16","doi-asserted-by":"publisher","unstructured":"Cong, K., et al.: Labeled PSI from homomorphic encryption with reduced computation and communication. In: Vigna, G., Shi, E. (eds.) ACM CCS 2021: 28th Conference on Computer and Communications Security, pp. 1135\u20131150. ACM Press, Virtual Event, Republic of Korea (2021). https:\/\/doi.org\/10.1145\/3460120.3484760","DOI":"10.1145\/3460120.3484760"},{"key":"11_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"10","DOI":"10.1007\/3-540-39568-7_2","volume-title":"Advances in Cryptology","author":"T ElGamal","year":"1985","unstructured":"ElGamal, T.: A public key cryptosystem and a signature scheme based on discrete logarithms. In: Blakley, G.R., Chaum, D. (eds.) CRYPTO 1984. LNCS, vol. 196, pp. 10\u201318. Springer, Heidelberg (1985). https:\/\/doi.org\/10.1007\/3-540-39568-7_2"},{"key":"11_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-540-24676-3_1","volume-title":"Advances in Cryptology - EUROCRYPT 2004","author":"MJ Freedman","year":"2004","unstructured":"Freedman, M.J., Nissim, K., Pinkas, B.: Efficient private matching and set intersection. In: Cachin, C., Camenisch, J.L. (eds.) EUROCRYPT 2004. LNCS, vol. 3027, pp. 1\u201319. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-24676-3_1"},{"key":"11_CR19","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1007\/978-981-96-0938-3_2","volume-title":"ASIACRYPT 2024, Part VI","author":"Y Gao","year":"2024","unstructured":"Gao, Y., Qi, L., Liu, X., Luo, Y., Wang, L.: Efficient fuzzy private set intersection from fuzzy mapping. In: Chung, K.M., Sasaki, Y. (eds.) ASIACRYPT 2024, Part VI. LNCS, vol. 15489, pp. 36\u201368. Springer, Singapore (2024). https:\/\/doi.org\/10.1007\/978-981-96-0938-3_2"},{"key":"11_CR20","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1007\/978-3-031-68397-8_10","volume-title":"CRYPTO 2024, Part VIII","author":"G Garimella","year":"2024","unstructured":"Garimella, G., Goff, B., Miao, P.: Computation efficient structure-aware PSI from incremental function secret sharing. In: Reyzin, L., Stebila, D. (eds.) CRYPTO 2024, Part VIII. LNCS, vol. 14927, pp. 309\u2013345. Springer, Cham (2024). https:\/\/doi.org\/10.1007\/978-3-031-68397-8_10"},{"key":"11_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"395","DOI":"10.1007\/978-3-030-84245-1_14","volume-title":"Advances in Cryptology \u2013 CRYPTO 2021","author":"G Garimella","year":"2021","unstructured":"Garimella, G., Pinkas, B., Rosulek, M., Trieu, N., Yanai, A.: Oblivious key-value stores and amplification for private set intersection. In: Malkin, T., Peikert, C. (eds.) CRYPTO 2021, Part II. LNCS, vol. 12826, pp. 395\u2013425. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-84245-1_14"},{"key":"11_CR22","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1007\/978-3-031-15802-5_12","volume-title":"CRYPTO 2022, Part I","author":"G Garimella","year":"2022","unstructured":"Garimella, G., Rosulek, M., Singh, J.: Structure-aware private set intersection, with applications to fuzzy matching. In: Dodis, Y., Shrimpton, T. (eds.) CRYPTO 2022, Part I. LNCS, vol. 13507, pp. 323\u2013352. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-15802-5_12"},{"key":"11_CR23","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"577","DOI":"10.1007\/978-3-031-38557-5_19","volume-title":"CRYPTO 2023, Part I","author":"G Garimella","year":"2023","unstructured":"Garimella, G., Rosulek, M., Singh, J.: Malicious secure, structure-aware private set intersection. In: Handschuh, H., Lysyanskaya, A. (eds.) CRYPTO 2023, Part I. LNCS, vol. 14081, pp. 577\u2013610. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-38557-5_19"},{"key":"11_CR24","doi-asserted-by":"publisher","unstructured":"Gentry, C.: Fully homomorphic encryption using ideal lattices. In: Mitzenmacher, M. (ed.) 41st Annual ACM Symposium on Theory of Computing, pp. 169\u2013178. ACM Press, Bethesda, MD, USA (2009). https:\/\/doi.org\/10.1145\/1536414.1536440","DOI":"10.1145\/1536414.1536440"},{"issue":"2","key":"11_CR25","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1145\/321812.321823","volume":"21","author":"E Horowitz","year":"1974","unstructured":"Horowitz, E., Sahni, S.: Computing partitions with applications to the knapsack problem. J. ACM 21(2), 277\u2013292 (1974). https:\/\/doi.org\/10.1145\/321812.321823","journal-title":"J. ACM"},{"key":"11_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1007\/11681878_13","volume-title":"Theory of Cryptography","author":"P Indyk","year":"2006","unstructured":"Indyk, P., Woodruff, D.: Polylogarithmic private approximations and efficient matching. In: Halevi, S., Rabin, T. (eds.) TCC 2006. LNCS, vol. 3876, pp. 245\u2013264. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11681878_13"},{"key":"11_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1007\/978-3-540-45146-4_9","volume-title":"Advances in Cryptology - CRYPTO 2003","author":"Y Ishai","year":"2003","unstructured":"Ishai, Y., Kilian, J., Nissim, K., Petrank, E.: Extending oblivious transfers efficiently. In: Boneh, D. (ed.) CRYPTO 2003. LNCS, vol. 2729, pp. 145\u2013161. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/978-3-540-45146-4_9"},{"key":"11_CR28","doi-asserted-by":"publisher","unstructured":"Katsumata, S., Matsuda, T., Nakamura, W., Ohara, K., Takahashi, K.: Revisiting fuzzy signatures: Towards a more risk-free cryptographic authentication system based on biometrics. In: Vigna, G., Shi, E. (eds.) ACM CCS 2021: 28th Conference on Computer and Communications Security, pp. 2046\u20132065. ACM Press, Virtual Event, Republic of Korea (2021). https:\/\/doi.org\/10.1145\/3460120.3484586","DOI":"10.1145\/3460120.3484586"},{"key":"11_CR29","doi-asserted-by":"publisher","unstructured":"Kolesnikov, V., Kumaresan, R., Rosulek, M., Trieu, N.: Efficient batched oblivious PRF with applications to private set intersection. In: Weippl, E.R., Katzenbeisser, S., Kruegel, C., Myers, A.C., Halevi, S. (eds.) ACM CCS 2016: 23rd Conference on Computer and Communications Security, pp. 818\u2013829. ACM Press, Vienna, Austria (2016). https:\/\/doi.org\/10.1145\/2976749.2978381","DOI":"10.1145\/2976749.2978381"},{"key":"11_CR30","doi-asserted-by":"publisher","unstructured":"Kolesnikov, V., Matania, N., Pinkas, B., Rosulek, M., Trieu, N.: Practical multi-party private set intersection from symmetric-key techniques. In: Thuraisingham, B.M., Evans, D., Malkin, T., Xu, D. (eds.) ACM CCS 2017: 24th Conference on Computer and Communications Security, pp. 1257\u20131272. ACM Press, Dallas, TX, USA (2017). https:\/\/doi.org\/10.1145\/3133956.3134065","DOI":"10.1145\/3133956.3134065"},{"key":"11_CR31","doi-asserted-by":"publisher","unstructured":"Meadows, C.A.: A more efficient cryptographic matchmaking protocol for use in the absence of a continuously available third party. In: S &P, pp. 134\u2013137. IEEE Computer Society (1986). https:\/\/doi.org\/10.1109\/SP.1986.10022","DOI":"10.1109\/SP.1986.10022"},{"key":"11_CR32","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"122","DOI":"10.1007\/978-3-030-17659-4_5","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2019","author":"B Pinkas","year":"2019","unstructured":"Pinkas, B., Schneider, T., Tkachenko, O., Yanai, A.: Efficient circuit-based PSI with linear communication. In: Ishai, Y., Rijmen, V. (eds.) EUROCRYPT 2019, Part III. LNCS, vol. 11478, pp. 122\u2013153. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-17659-4_5"},{"key":"11_CR33","doi-asserted-by":"publisher","unstructured":"Raghuraman, S., Rindal, P.: Blazing fast PSI from improved OKVS and subfield VOLE. In: Yin, H., Stavrou, A., Cremers, C., Shi, E. (eds.) ACM CCS 2022: 29th Conference on Computer and Communications Security, pp. 2505\u20132517. ACM Press, Los Angeles, CA, USA (2022). https:\/\/doi.org\/10.1145\/3548606.3560658","DOI":"10.1145\/3548606.3560658"},{"key":"11_CR34","unstructured":"Richardson, D., Rosulek, M., Xu, J.: Fuzzy PSI via oblivious protocol routing. Cryptology ePrint Archive, Paper 2024\/1642 (2024). https:\/\/eprint.iacr.org\/2024\/1642"},{"key":"11_CR35","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"901","DOI":"10.1007\/978-3-030-77886-6_31","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2021","author":"P Rindal","year":"2021","unstructured":"Rindal, P., Schoppmann, P.: VOLE-PSI: fast OPRF and circuit-PSI from vector-OLE. In: Canteaut, A., Standaert, F.-X. (eds.) EUROCRYPT 2021, Part II. LNCS, vol. 12697, pp. 901\u2013930. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-77886-6_31"},{"key":"11_CR36","doi-asserted-by":"publisher","unstructured":"Schoppmann, P., Gasc\u00f3n, A., Reichert, L., Raykova, M.: Distributed vector-OLE: improved constructions and implementation. In: Cavallaro, L., Kinder, J., Wang, X., Katz, J. (eds.) ACM CCS 2019: 26th Conference on Computer and Communications Security, pp. 1055\u20131072. ACM Press, London, UK (2019). https:\/\/doi.org\/10.1145\/3319535.3363228","DOI":"10.1145\/3319535.3363228"},{"key":"11_CR37","unstructured":"Son, H., Paik, S., Kim, Y., Kim, S., Chung, H., Seo, J.H.: Doubly efficient fuzzy private set intersection for high-dimensional data with cosine similarity. Cryptology ePrint Archive, Paper 2025\/054 (2025). https:\/\/eprint.iacr.org\/2025\/054"},{"key":"11_CR38","unstructured":"Uzun, E., Chung, S.P., Kolesnikov, V., Boldyreva, A., Lee, W.: Fuzzy labeled private set intersection with applications to private real-time biometric search. In: Bailey, M., Greenstadt, R. (eds.) USENIX Security 2021: 30th USENIX Security Symposium, pp. 911\u2013928. USENIX Association (2021). https:\/\/www.usenix.org\/conference\/usenixsecurity21\/presentation\/uzun"},{"key":"11_CR39","doi-asserted-by":"publisher","unstructured":"Yao, A.C.C.: How to generate and exchange secrets (extended abstract). In: 27th Annual Symposium on Foundations of Computer Science, pp. 162\u2013167. IEEE Computer Society Press, Toronto, Ontario, Canada (1986). https:\/\/doi.org\/10.1109\/SFCS.1986.25","DOI":"10.1109\/SFCS.1986.25"}],"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-5116-3_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,1,14]],"date-time":"2026-01-14T09:33:23Z","timestamp":1768383203000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-95-5116-3_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,12,8]]},"ISBN":["9789819551156","9789819551163"],"references-count":39,"URL":"https:\/\/doi.org\/10.1007\/978-981-95-5116-3_11","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"}}]}}