{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,7]],"date-time":"2025-12-07T11:46:04Z","timestamp":1765107964699,"version":"3.46.0"},"publisher-location":"Singapore","reference-count":45,"publisher":"Springer Nature Singapore","isbn-type":[{"value":"9789819551248","type":"print"},{"value":"9789819551255","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-5125-5_19","type":"book-chapter","created":{"date-parts":[[2025,12,7]],"date-time":"2025-12-07T11:42:26Z","timestamp":1765107746000},"page":"582-613","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Game Changer: A Modular Framework for\u00a0OPRF Security"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-2308-9111","authenticated-orcid":false,"given":"Karla","family":"Friedrichs","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2872-7899","authenticated-orcid":false,"given":"Anja","family":"Lehmann","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5000-7655","authenticated-orcid":false,"given":"Cavit","family":"\u00d6zbay","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,12,8]]},"reference":[{"key":"19_CR1","doi-asserted-by":"publisher","first-page":"447","DOI":"10.1007\/978-3-031-58751-1_16","volume-title":"EUROCRYPT 2024","author":"MR Albrecht","year":"2024","unstructured":"Albrecht, M.R., Davidson, A., Deo, A., Gardham, D.: Crypto dark matter on the torus. In: Joye, M., Leander, G. (eds.) EUROCRYPT 2024, pp. 447\u2013476. Springer, Cham (2024)"},{"key":"19_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1007\/978-3-030-75248-4_10","volume-title":"Public-Key Cryptography \u2013 PKC 2021","author":"MR Albrecht","year":"2021","unstructured":"Albrecht, M.R., Davidson, A., Deo, A., Smart, N.P.: Round-optimal verifiable oblivious pseudorandom functions from ideal lattices. In: Garay, J.A. (ed.) PKC 2021. LNCS, vol. 12711, pp. 261\u2013289. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-75248-4_10"},{"key":"19_CR3","first-page":"205","volume-title":"ASIACRYPT 2024","author":"MR Albrecht","year":"2024","unstructured":"Albrecht, M.R., Gur, K.D.: Verifiable oblivious pseudorandom functions from lattices: Practical-ish and thresholdisable. In: Chung, K.M., Sasaki, Y. (eds.) ASIACRYPT 2024, pp. 205\u2013237. Springer, Singapore (2024)"},{"key":"19_CR4","doi-asserted-by":"publisher","unstructured":"Backendal, M., Davis, H., G\u00fcnther, F., Haller, M., Paterson, K.G.: A formal treatment of end-to-end encrypted cloud storage. In: Advances in Cryptology \u2013 CRYPTO 2024, pp. 40\u201374. Springer, Cham (2024). https:\/\/doi.org\/10.1007\/978-3-031-68379-4_2","DOI":"10.1007\/978-3-031-68379-4_2"},{"key":"19_CR5","unstructured":"Basso, A.: A post-quantum round-optimal oblivious PRF from isogenies. Cryptology ePrint Archive, Paper 2023\/225 (2023). https:\/\/eprint.iacr.org\/2023\/225"},{"key":"19_CR6","doi-asserted-by":"publisher","unstructured":"Baum, C., et al.: Efficient maliciously secure oblivious exponentiations. IACR Commun. Cryptol. 1(3) (2024). https:\/\/doi.org\/10.62056\/a66cy7qiu","DOI":"10.62056\/a66cy7qiu"},{"key":"19_CR7","doi-asserted-by":"publisher","unstructured":"Baum, C., Frederiksen, T., Hesse, J., Lehmann, A., Yanai, A.: Pesto: proactively secure distributed single sign-on, or how to trust a hacked server. In: 2020 IEEE European Symposium on Security and Privacy (EuroS &P). IEEE (2020). https:\/\/doi.org\/10.1109\/eurosp48549.2020.00044","DOI":"10.1109\/eurosp48549.2020.00044"},{"key":"19_CR8","first-page":"328","volume-title":"ASIACRYPT 2024","author":"M Bellare","year":"2024","unstructured":"Bellare, M., Ranjan, R., Riepel, D., Aldakheel, A.: The concrete security of two-party computation: simple definitions, and tight proofs for PSI and OPRFs. In: Chung, K.M., Sasaki, Y. (eds.) ASIACRYPT 2024, pp. 328\u2013362. Springer, Singapore (2024)"},{"key":"19_CR9","unstructured":"Bellare, M., Rogaway, P.: Code-based game-playing proofs and the security of triple encryption. IACR Cryptology ePrint Archive 2004\/331 (2004). https:\/\/eprint.iacr.org\/2004\/331"},{"key":"19_CR10","doi-asserted-by":"publisher","first-page":"332","DOI":"10.1007\/978-3-031-91101-9_12","volume-title":"EUROCRYPT 2025","author":"W Beullens","year":"2025","unstructured":"Beullens, W., Dodgson, L., Faller, S., Hesse, J.: The 2hash OPRF framework and efficient post-quantum instantiations. In: Fehr, S., Fouque, P.A. (eds.) EUROCRYPT 2025, pp. 332\u2013362. Springer, Cham (2025)"},{"key":"19_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1007\/3-540-36288-6_3","volume-title":"Public Key Cryptography \u2014 PKC 2003","author":"A Boldyreva","year":"2003","unstructured":"Boldyreva, A.: Threshold signatures, multisignatures and blind signatures based on the gap-Diffie-Hellman-group signature scheme. In: Desmedt, Y.G. (ed.) PKC 2003. LNCS, vol. 2567, pp. 31\u201346. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/3-540-36288-6_3"},{"key":"19_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"520","DOI":"10.1007\/978-3-030-64834-3_18","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2020","author":"D Boneh","year":"2020","unstructured":"Boneh, D., Kogan, D., Woo, K.: Oblivious pseudorandom functions from isogenies. In: Moriai, S., Wang, H. (eds.) ASIACRYPT 2020. LNCS, vol. 12492, pp. 520\u2013550. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-64834-3_18"},{"key":"19_CR13","unstructured":"Bourdrez, D., Krawczyk, H., Lewi, K., Wood, C.A.: The OPAQUE Augmented PAKE Protocol. Internet-Draft draft-irtf-cfrg-opaque-18 (2024). https:\/\/datatracker.ietf.org\/doc\/draft-irtf-cfrg-opaque\/18\/, work in Progress"},{"key":"19_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1007\/978-3-030-32101-7_21","volume-title":"Financial Cryptography and Data Security","author":"J Camenisch","year":"2019","unstructured":"Camenisch, J., De Caro, A., Ghosh, E., Sorniotti, A.: Oblivious PRF on committed vector inputs and application to deduplication of encrypted data. In: Goldberg, I., Moore, T. (eds.) FC 2019. LNCS, vol. 11598, pp. 337\u2013356. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-32101-7_21"},{"key":"19_CR15","doi-asserted-by":"publisher","unstructured":"Camenisch, J., Lehmann, A., Neven, G.: Optimal distributed password verification. In: Proceedings of the 22nd ACM SIGSAC Conference on Computer and Communications Security, CCS 2015, pp. 182\u2013194. ACM (2015). https:\/\/doi.org\/10.1145\/2810103.2813722","DOI":"10.1145\/2810103.2813722"},{"key":"19_CR16","doi-asserted-by":"publisher","unstructured":"Camenisch, J., Stadler, M.: Proof systems for general statements about discrete logarithms. Technical report (1997). https:\/\/doi.org\/10.3929\/ETHZ-A-006651937","DOI":"10.3929\/ETHZ-A-006651937"},{"key":"19_CR17","doi-asserted-by":"publisher","unstructured":"Canetti, R.: Universally composable security: a new paradigm for cryptographic protocols. In: Proceedings 42nd IEEE Symposium on Foundations of Computer Science, pp. 136\u2013145 (2001). https:\/\/doi.org\/10.1109\/SFCS.2001.959888","DOI":"10.1109\/SFCS.2001.959888"},{"key":"19_CR18","doi-asserted-by":"publisher","unstructured":"Casacuberta, S., Hesse, J., Lehmann, A.: SoK: oblivious pseudorandom functions. In: 2022 IEEE 7th European Symposium on Security and Privacy (EuroS &P), pp. 625\u2013646 (2022). https:\/\/doi.org\/10.1109\/EuroSP53844.2022.00045","DOI":"10.1109\/EuroSP53844.2022.00045"},{"key":"19_CR19","doi-asserted-by":"publisher","unstructured":"Celi, S., Davidson, A., Valdez, S., Wood, C.A.: Privacy Pass Issuance Protocols. RFC 9578 (2024). https:\/\/doi.org\/10.17487\/RFC9578. https:\/\/www.rfc-editor.org\/info\/rfc9578","DOI":"10.17487\/RFC9578"},{"key":"19_CR20","doi-asserted-by":"publisher","unstructured":"Das, P., Hesse, J., Lehmann, A.: Dpase: distributed password-authenticated symmetric-key encryption, or how to get many keys from one password. In: Proceedings of the 2022 ACM on Asia Conference on Computer and Communications Security. ASIA CCS 2022. ACM (2022). https:\/\/doi.org\/10.1145\/3488932.3517389","DOI":"10.1145\/3488932.3517389"},{"key":"19_CR21","doi-asserted-by":"publisher","unstructured":"Davidson, A., Faz-Hernandez, A., Sullivan, N., Wood, C.A.: Oblivious Pseudorandom Functions (OPRFs) Using Prime-Order Groups. RFC 9497 (2023). https:\/\/doi.org\/10.17487\/RFC9497. https:\/\/www.rfc-editor.org\/info\/rfc9497","DOI":"10.17487\/RFC9497"},{"issue":"3","key":"19_CR22","doi-asserted-by":"publisher","first-page":"164","DOI":"10.1515\/popets-2018-0026","volume":"2018","author":"A Davidson","year":"2018","unstructured":"Davidson, A., Goldberg, I., Sullivan, N., Tankersley, G., Valsorda, F.: Privacy pass: bypassing internet challenges anonymously. Proce. Priv. Enhancing Technol. 2018(3), 164\u2013180 (2018). https:\/\/doi.org\/10.1515\/popets-2018-0026","journal-title":"Proce. Priv. Enhancing Technol."},{"key":"19_CR23","doi-asserted-by":"publisher","unstructured":"Dayanikli, D., Lehmann, A.: (Strong) apake revisited: capturing multi-user security and salting. In: 2024 IEEE 9th European Symposium on Security and Privacy (EuroS &P), pp. 415\u2013439 (2024). https:\/\/doi.org\/10.1109\/EuroSP60621.2024.00030","DOI":"10.1109\/EuroSP60621.2024.00030"},{"key":"19_CR24","unstructured":"Dong, M.: Multi-point hashdh OPRF using multiplicative blinding with application to private set intersection. IACR Cryptology ePrint Archive 2022\/1482 (2022). https:\/\/api.semanticscholar.org\/CorpusID:253205196"},{"key":"19_CR25","unstructured":"Everspaugh, A., Chaterjee, R., Scott, S., Juels, A., Ristenpart, T.: The Pythia PRF service. In: 24th USENIX Security Symposium (USENIX Security 2015), pp. 547\u2013562. USENIX Association, Washington, D.C. (2015). https:\/\/www.usenix.org\/conference\/usenixsecurity15\/technical-sessions\/presentation\/everspaugh"},{"key":"19_CR26","doi-asserted-by":"publisher","unstructured":"Faller, S., Handirk, T., Hesse, J., Horv\u00e1th, M., Lehmann, A.: Password-protected key retrieval with(out) HSM protection. In: Proceedings of the 2024 on ACM SIGSAC Conference on Computer and Communications Security, CCS 2024, pp. 2445\u20132459. Association for Computing Machinery, New York (2024). https:\/\/doi.org\/10.1145\/3658644.3690358","DOI":"10.1145\/3658644.3690358"},{"key":"19_CR27","doi-asserted-by":"crossref","unstructured":"Faust, S., Hazay, C., Venturi, D.: Outsourced pattern matching. Int. J. Inf. Secur. 17, 327\u2013346 (2013). https:\/\/api.semanticscholar.org\/CorpusID:2486674","DOI":"10.1007\/s10207-017-0374-0"},{"key":"19_CR28","doi-asserted-by":"publisher","unstructured":"Faz-Hernandez, A., Scott, S., Sullivan, N., Wahby, R.S., Wood, C.A.: Hashing to Elliptic Curves. RFC 9380 (2023). https:\/\/doi.org\/10.17487\/RFC9380. https:\/\/www.rfc-editor.org\/info\/rfc9380","DOI":"10.17487\/RFC9380"},{"key":"19_CR29","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1007\/978-3-540-30576-7_17","volume-title":"Theory of Cryptography","author":"MJ Freedman","year":"2005","unstructured":"Freedman, M.J., Ishai, Y., Pinkas, B., Reingold, O.: Keyword search and oblivious pseudorandom functions. In: Kilian, J. (ed.) Theory of Cryptography, pp. 303\u2013324. Springer, Heidelberg (2005)"},{"key":"19_CR30","unstructured":"Friedrichs, K., Lehmann, A., \u00d6zbay, C.: Game changer: a modular framework for oprf security. Cryptology ePrint Archive, Paper 2025\/1565 (2025). https:\/\/eprint.iacr.org\/2025\/1565"},{"key":"19_CR31","doi-asserted-by":"publisher","unstructured":"Ga\u017ei, P., Tessaro, S.: Secret-key cryptography from ideal primitives: a systematic overview. In: 2015 IEEE Information Theory Workshop (ITW), pp.\u00a01\u20135 (2015). https:\/\/doi.org\/10.1109\/ITW.2015.7133163","DOI":"10.1109\/ITW.2015.7133163"},{"key":"19_CR32","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1007\/978-3-540-78524-8_10","volume-title":"Theory of Cryptography","author":"C Hazay","year":"2008","unstructured":"Hazay, C., Lindell, Y.: Efficient protocols for set intersection and pattern matching with security against malicious and covert adversaries. In: Canetti, R. (ed.) Theory of Cryptography, pp. 155\u2013175. Springer, Heidelberg (2008)"},{"key":"19_CR33","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1007\/978-3-662-45608-8_13","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2014","author":"S Jarecki","year":"2014","unstructured":"Jarecki, S., Kiayias, A., Krawczyk, H.: Round-optimal password-protected secret sharing and T-PAKE in the password-only model. In: Sarkar, P., Iwata, T. (eds.) ASIACRYPT 2014. LNCS, vol. 8874, pp. 233\u2013253. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-662-45608-8_13"},{"key":"19_CR34","doi-asserted-by":"publisher","unstructured":"Jarecki, S., Kiayias, A., Krawczyk, H., Xu, J.: Highly-efficient and composable password-protected secret sharing (or: How to protect your bitcoin wallet online). In: 2016 IEEE European Symposium on Security and Privacy (EuroS &P). IEEE (2016). https:\/\/doi.org\/10.1109\/eurosp.2016.30","DOI":"10.1109\/eurosp.2016.30"},{"key":"19_CR35","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1007\/978-3-319-61204-1_3","volume-title":"Applied Cryptography and Network Security","author":"S Jarecki","year":"2017","unstructured":"Jarecki, S., Kiayias, A., Krawczyk, H., Xu, J.: Toppss: cost-minimal password-protected secret sharing based on threshold OPRF. In: Gollmann, D., Miyaji, A., Kikuchi, H. (eds.) Applied Cryptography and Network Security, pp. 39\u201358. Springer, Cham (2017)"},{"key":"19_CR36","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"456","DOI":"10.1007\/978-3-319-78372-7_15","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2018","author":"S Jarecki","year":"2018","unstructured":"Jarecki, S., Krawczyk, H., Xu, J.: OPAQUE: an asymmetric PAKE protocol secure against pre-computation attacks. In: Nielsen, J.B., Rijmen, V. (eds.) EUROCRYPT 2018. LNCS, vol. 10822, pp. 456\u2013486. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-78372-7_15"},{"key":"19_CR37","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"380","DOI":"10.1007\/978-3-030-75248-4_14","volume-title":"Public-Key Cryptography \u2013 PKC 2021","author":"S Jarecki","year":"2021","unstructured":"Jarecki, S., Krawczyk, H., Xu, J.: On the (in)security of the Diffie-Hellman oblivious PRF with multiplicative blinding. In: Garay, J.A. (ed.) PKC 2021. LNCS, vol. 12711, pp. 380\u2013409. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-75248-4_14"},{"key":"19_CR38","doi-asserted-by":"crossref","unstructured":"Jarecki, S., Liu, X.: Efficient oblivious pseudorandom function with applications to adaptive OT and secure computation of set intersection. In: Reingold, O. (ed.) Theory of Cryptography, pp. 577\u2013594. Springer, Heidelberg (2009). https:\/\/iacr.org\/archive\/tcc2009\/54440575\/54440575.pdf","DOI":"10.1007\/978-3-642-00457-5_34"},{"key":"19_CR39","doi-asserted-by":"crossref","unstructured":"Jarecki, S., Liu, X.: Fast secure computation of set intersection. In: Garay, J.A., De\u00a0Prisco, R. (eds.) Security and Cryptography for Networks, pp. 418\u2013435. Springer, Heidelberg (2010). https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-15317-4_26.pdf","DOI":"10.1007\/978-3-642-15317-4_26"},{"key":"19_CR40","unstructured":"Kaluderovic, N., Cheng, N., Mitrokotsa, A.: A post-quantum distributed OPRF from the legendre PRF. IACR Cryptology ePrint Archive 2024\/544 (2024). https:\/\/api.semanticscholar.org\/CorpusID:269045259"},{"key":"19_CR41","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: Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security, CCS 2017, pp. 1257\u20131272. Association for Computing Machinery, New York (2017). https:\/\/doi.org\/10.1145\/3133956.3134065","DOI":"10.1145\/3133956.3134065"},{"issue":"3","key":"19_CR42","doi-asserted-by":"publisher","first-page":"289","DOI":"10.2478\/popets-2019-0048","volume":"2019","author":"A Lehmann","year":"2019","unstructured":"Lehmann, A.: ScrambleDB: oblivious (chameleon) pseudonymization-as-a-service. Proce. Priv. Enhancing Technol. 2019(3), 289\u2013309 (2019). https:\/\/doi.org\/10.2478\/popets-2019-0048","journal-title":"Proce. Priv. Enhancing Technol."},{"key":"19_CR43","doi-asserted-by":"crossref","unstructured":"Naor, M., Pinkas, B., Reingold, O.: Distributed pseudo-random functions and KDCs. In: Stern, J. (ed.) Advances in Cryptology \u2014 EUROCRYPT 1999, pp. 327\u2013346. Springer, Heidelberg (1999). https:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-48910-X_23.pdf","DOI":"10.1007\/3-540-48910-X_23"},{"key":"19_CR44","unstructured":"Shoup, V.: Sequences of games: a tool for taming complexity in security proofs. IACR Cryptology ePrint Archive 2004\/332 (2004). https:\/\/api.semanticscholar.org\/CorpusID:13341188"},{"key":"19_CR45","doi-asserted-by":"publisher","first-page":"674","DOI":"10.1007\/978-3-031-07085-3_23","volume-title":"EUROCRYPT 2022","author":"N Tyagi","year":"2022","unstructured":"Tyagi, N., Celi, S., Ristenpart, T., Sullivan, N., Tessaro, S., Wood, C.A.: A fast and simple partially oblivious PRF, with applications. In: Dunkelman, O., Dziembowski, S. (eds.) EUROCRYPT 2022, pp. 674\u2013705. Springer, Cham (2022)"}],"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-5125-5_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,12,7]],"date-time":"2025-12-07T11:42:33Z","timestamp":1765107753000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-95-5125-5_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,12,8]]},"ISBN":["9789819551248","9789819551255"],"references-count":45,"URL":"https:\/\/doi.org\/10.1007\/978-981-95-5125-5_19","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"}}]}}