{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,28]],"date-time":"2026-01-28T04:40:26Z","timestamp":1769575226891,"version":"3.49.0"},"publisher-location":"Singapore","reference-count":47,"publisher":"Springer Nature Singapore","isbn-type":[{"value":"9789819551187","type":"print"},{"value":"9789819551194","type":"electronic"}],"license":[{"start":{"date-parts":[[2025,12,7]],"date-time":"2025-12-07T00:00:00Z","timestamp":1765065600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,12,7]],"date-time":"2025-12-07T00:00:00Z","timestamp":1765065600000},"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-5119-4_15","type":"book-chapter","created":{"date-parts":[[2025,12,6]],"date-time":"2025-12-06T21:45:20Z","timestamp":1765057520000},"page":"471-505","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Traceable Threshold Encryption Without a\u00a0Trusted Dealer"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0009-0004-4315-1914","authenticated-orcid":false,"given":"Jan","family":"Bormet","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0009-0002-7411-3561","authenticated-orcid":false,"given":"Jonas","family":"Hofmann","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0009-0000-7888-7690","authenticated-orcid":false,"given":"Hussien","family":"Othman","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,12,7]]},"reference":[{"key":"15_CR1","doi-asserted-by":"crossref","unstructured":"Baird, L., et al.: Threshold signatures in the multiverse. In: 44th IEEE Symposium on Security and Privacy, SP (2023)","DOI":"10.1109\/SP46215.2023.10179436"},{"key":"15_CR2","unstructured":"Ballard, L., Green, M., de\u00a0Medeiros, B., Monrose, F.: Correlation-resistant storage via keyword-searchable encryption. Cryptology ePrint Archive, Paper 2005\/417 (2005). https:\/\/eprint.iacr.org\/2005\/417"},{"key":"15_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1007\/978-3-030-56880-1_5","volume-title":"Advances in Cryptology \u2013 CRYPTO 2020","author":"B Bauer","year":"2020","unstructured":"Bauer, B., Fuchsbauer, G., Loss, J.: A\u00a0classification\u00a0of\u00a0computational\u00a0assumptions in the algebraic group model. In: Micciancio, D., Ristenpart, T. (eds.) CRYPTO 2020. LNCS, vol. 12171, pp. 121\u2013151. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-56880-1_5"},{"key":"15_CR4","unstructured":"Bebel, J., Ojha, D.: Ferveo: Threshold decryption for mempool privacy in BFT networks. Cryptology ePrint Archive, Paper 2022\/898 (2022). https:\/\/eprint.iacr.org\/2022\/898"},{"key":"15_CR5","doi-asserted-by":"crossref","unstructured":"Ben-Or, M., Linial, N.: Collective coin flipping, robust voting schemes and minima of banzhaf values. In: 26th Annual Symposium on Foundations of Computer Science (sfcs 1985), pp. 408\u2013416. IEEE (1985)","DOI":"10.1109\/SFCS.1985.15"},{"key":"15_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1007\/978-3-030-17653-2_4","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2019","author":"E Ben-Sasson","year":"2019","unstructured":"Ben-Sasson, E., Chiesa, A., Riabzev, M., Spooner, N., Virza, M., Ward, N.P.: Aurora: transparent succinct arguments for R1CS. In: Ishai, Y., Rijmen, V. (eds.) EUROCRYPT 2019. LNCS, vol. 11476, pp. 103\u2013128. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-17653-2_4"},{"key":"15_CR7","doi-asserted-by":"crossref","unstructured":"Bhattacharyya, R., Bormet, J., Faust, S., Mukherjee, P., Othman, H.: CCA-secure traceable threshold (ID-based) encryption and application. Cryptology ePrint Archive, Paper 2025\/341 (2025). https:\/\/eprint.iacr.org\/2025\/341","DOI":"10.1145\/3719027.3744876"},{"key":"15_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1007\/978-3-540-28628-8_3","volume-title":"Advances in Cryptology \u2013 CRYPTO 2004","author":"D Boneh","year":"2004","unstructured":"Boneh, D., Boyen, X., Shacham, H.: Short group signatures. In: Franklin, M. (ed.) CRYPTO 2004. LNCS, vol. 3152, pp. 41\u201355. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-28628-8_3"},{"key":"15_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1007\/3-540-44647-8_13","volume-title":"Advances in Cryptology \u2014 CRYPTO 2001","author":"D Boneh","year":"2001","unstructured":"Boneh, D., Franklin, M.: Identity-based encryption from the weil pairing. In: Kilian, J. (ed.) CRYPTO 2001. LNCS, vol. 2139, pp. 213\u2013229. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-44647-8_13"},{"key":"15_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"514","DOI":"10.1007\/3-540-45682-1_30","volume-title":"Advances in Cryptology \u2014 ASIACRYPT 2001","author":"D Boneh","year":"2001","unstructured":"Boneh, D., Lynn, B., Shacham, H.: Short signatures from the weil pairing. In: Boyd, C. (ed.) ASIACRYPT 2001. LNCS, vol. 2248, pp. 514\u2013532. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-45682-1_30"},{"key":"15_CR11","doi-asserted-by":"crossref","unstructured":"Boneh, D., Naor, M.: Traitor tracing with constant size ciphertext. In: Proceedings of the 2008 ACM Conference on Computer and Communications Security, CCS (2008)","DOI":"10.1145\/1455770.1455834"},{"key":"15_CR12","doi-asserted-by":"publisher","unstructured":"Boneh, D., Partap, A., Rotem, L.: Accountability for misbehavior in threshold decryption via threshold traitor tracing. In: Advances in Cryptology - CRYPTO. Lecture Notes in Computer Science, vol. 14926. Springer (2024). https:\/\/doi.org\/10.1007\/978-3-031-68394-7_11","DOI":"10.1007\/978-3-031-68394-7_11"},{"key":"15_CR13","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1007\/978-3-031-68388-6_9","volume-title":"Advances in Cryptology - CRYPTO 2024","author":"D Boneh","year":"2024","unstructured":"Boneh, D., Partap, A., Rotem, L.: Traceable secret sharing: strong security and efficient constructions. In: Reyzin, L., Stebila, D. (eds.) Advances in Cryptology - CRYPTO 2024, pp. 221\u2013256. Springer Nature Switzerland, Cham (2024)"},{"key":"15_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"573","DOI":"10.1007\/11761679_34","volume-title":"Advances in Cryptology - EUROCRYPT 2006","author":"D Boneh","year":"2006","unstructured":"Boneh, D., Sahai, A., Waters, B.: Fully collusion resistant traitor tracing with short ciphertexts and private keys. In: Vaudenay, S. (ed.) EUROCRYPT 2006. LNCS, vol. 4004, pp. 573\u2013592. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11761679_34"},{"key":"15_CR15","doi-asserted-by":"crossref","unstructured":"Boneh, D., Zhandry, M.: Multiparty key exchange, efficient traitor tracing, and more from indistinguishability obfuscation. Algorithmica (2017)","DOI":"10.1007\/s00453-016-0242-8"},{"key":"15_CR16","unstructured":"Bormet, J., Faust, S., Othman, H., Qu, Z.: BEAT-MEV: Epochless approach to batched threshold encryption for MEV prevention. In: 34th USENIX Security Symposium (USENIX Security 25), pp. 3457\u20133476 (2025)"},{"key":"15_CR17","unstructured":"Bormet, J., Hofmann, J., Othman, H.: Traceable threshold encryption without trusted dealer. Cryptology ePrint Archive, Paper 2025\/342 (2025). https:\/\/eprint.iacr.org\/2025\/342"},{"key":"15_CR18","doi-asserted-by":"publisher","unstructured":"Branco, P., Lai, R.W., Maitra, M., Malavolta, G., Rahimi, A., Woo, I.K.: Traitor tracing without trusted authority from registered functional encryption. In: International Conference on the Theory and Application of Cryptology and Information Security. Springer (2024). https:\/\/doi.org\/10.1007\/978-981-96-0891-1_2","DOI":"10.1007\/978-981-96-0891-1_2"},{"key":"15_CR19","doi-asserted-by":"crossref","unstructured":"Chen, Y., Vaikuntanathan, V., Waters, B., Wee, H., Wichs, D.: Traitor-tracing from LWE made simple and attribute-based. In: Theory of Cryptography - 16th International Conference, TCC (2018)","DOI":"10.1007\/978-3-030-03810-6_13"},{"key":"15_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1007\/3-540-48658-5_25","volume-title":"Advances in Cryptology \u2014 CRYPTO \u201994","author":"B Chor","year":"1994","unstructured":"Chor, B., Fiat, A., Naor, M.: Tracing traitors. In: Desmedt, Y.G. (ed.) CRYPTO 1994. LNCS, vol. 839, pp. 257\u2013270. Springer, Heidelberg (1994). https:\/\/doi.org\/10.1007\/3-540-48658-5_25"},{"key":"15_CR21","unstructured":"Choudhuri, A.R., Garg, S., Piet, J., Policharla, G.V.: Mempool privacy via batched threshold encryption: attacks and defenses. In: 33rd USENIX Security Symposium (USENIX Security 24), pp. 3513\u20133529 (2024)"},{"key":"15_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"502","DOI":"10.1007\/978-3-540-76900-2_31","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2007","author":"R Cramer","year":"2007","unstructured":"Cramer, R., et al.: Bounded CCA2-secure encryption. In: Kurosawa, K. (ed.) ASIACRYPT 2007. LNCS, vol. 4833, pp. 502\u2013518. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-76900-2_31"},{"key":"15_CR23","doi-asserted-by":"crossref","unstructured":"Datta, P., Pal, T., Yamada, S.: Registered FE beyond predicates: (attribute-based) linear functions and more. In: Advances in Cryptology - ASIACRYPT 2024 (2024)","DOI":"10.1007\/978-981-96-0875-1_3"},{"key":"15_CR24","doi-asserted-by":"crossref","unstructured":"Desmedt, Y.: Society and group oriented cryptography: A new concept. In: Pomerance, C. (ed.) Advances in Cryptology - CRYPTO \u201987 (1987)","DOI":"10.1007\/3-540-48184-2_8"},{"key":"15_CR25","unstructured":"Desmedt, Y., Frankel, Y.: Threshold cryptosystems. In: Brassard, G. (ed.) Advances in Cryptology - CRYPTO \u201989 (1989)"},{"key":"15_CR26","doi-asserted-by":"crossref","unstructured":"Dziembowski, S., Faust, S., Lizurej, T., Mielniczuk, M.: Secret sharing with snitching. In: Proceedings of the 2024 on ACM SIGSAC Conference on Computer and Communications Security, pp. 840\u2013853 (2024)","DOI":"10.1145\/3658644.3690296"},{"key":"15_CR27","unstructured":"Dziembowski, S., Faust, S., Luhn, J.: Shutter network: private transactions from threshold cryptography. Cryptology ePrint Archive, Paper 2024\/1981 (2024). https:\/\/eprint.iacr.org\/2024\/1981"},{"key":"15_CR28","doi-asserted-by":"publisher","unstructured":"Francati, D., Friolo, D., Maitra, M., Malavolta, G., Rahimi, A., Venturi, D.: Registered (inner-product) functional encryption. In: Advances in Cryptology - ASIACRYPT 2023 (2023). https:\/\/doi.org\/10.1007\/978-981-99-8733-7_4","DOI":"10.1007\/978-981-99-8733-7_4"},{"key":"15_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1007\/978-3-319-96881-0_2","volume-title":"Advances in Cryptology \u2013 CRYPTO 2018","author":"G Fuchsbauer","year":"2018","unstructured":"Fuchsbauer, G., Kiltz, E., Loss, J.: The algebraic group model and its applications. In: Shacham, H., Boldyreva, A. (eds.) CRYPTO 2018. LNCS, vol. 10992, pp. 33\u201362. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-96881-0_2"},{"key":"15_CR30","doi-asserted-by":"publisher","unstructured":"Garg, S., Kolonelos, D., Policharla, G.V., Wang, M.: Threshold encryption with silent setup. In: Advances in Cryptology - CRYPTO 2024, pp. 352\u2013386. Springer (2024). https:\/\/doi.org\/10.1007\/978-3-031-68394-7_12","DOI":"10.1007\/978-3-031-68394-7_12"},{"key":"15_CR31","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1007\/s00145-006-0347-3","volume":"20","author":"R Gennaro","year":"2007","unstructured":"Gennaro, R., Jarecki, S., Krawczyk, H., Rabin, T.: Secure distributed key generation for discrete-log based cryptosystems. J. Cryptol. 20, 51\u201383 (2007)","journal-title":"J. Cryptol."},{"key":"15_CR32","doi-asserted-by":"publisher","unstructured":"Gong, J., Luo, J., Wee, H.: Traitor tracing with $$n^{1\/3}$$-size ciphertexts and o(1)-size keys from k-lin. In: Advances in Cryptology - EUROCRYPT 2023 (2023). https:\/\/doi.org\/10.1007\/978-3-031-30620-4_21","DOI":"10.1007\/978-3-031-30620-4_21"},{"key":"15_CR33","doi-asserted-by":"crossref","unstructured":"Goyal, R., Koppula, V., Waters, B.: Collusion resistant traitor tracing from learning with errors. In: Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing (2018)","DOI":"10.1145\/3188745.3188844"},{"key":"15_CR34","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-030-17259-6_1","volume-title":"Public-Key Cryptography \u2013 PKC 2019","author":"R Goyal","year":"2019","unstructured":"Goyal, R., Vusirikala, S., Waters, B.: Collusion resistant broadcast and trace from positional witness encryption. In: Lin, D., Sako, K. (eds.) PKC 2019. LNCS, vol. 11443, pp. 3\u201333. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-17259-6_1"},{"key":"15_CR35","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"718","DOI":"10.1007\/978-3-030-84252-9_24","volume-title":"Advances in Cryptology \u2013 CRYPTO 2021","author":"V Goyal","year":"2021","unstructured":"Goyal, V., Song, Y., Srinivasan, A.: Traceable secret sharing and applications. In: Malkin, T., Peikert, C. (eds.) CRYPTO 2021. LNCS, vol. 12827, pp. 718\u2013747. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-84252-9_24"},{"key":"15_CR36","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1007\/978-3-642-17373-8_11","volume-title":"Advances in Cryptology - ASIACRYPT 2010","author":"A Kate","year":"2010","unstructured":"Kate, A., Zaverucha, G.M., Goldberg, I.: Constant-size commitments to polynomials and their applications. In: Abe, M. (ed.) ASIACRYPT 2010. LNCS, vol. 6477, pp. 177\u2013194. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-17373-8_11"},{"key":"15_CR37","doi-asserted-by":"crossref","unstructured":"Luo, J.: Ad hoc broadcast, trace, and revoke. IACR Communications in Cryptology (2024)","DOI":"10.62056\/a39qxrxqi"},{"key":"15_CR38","first-page":"1","volume-title":"Cryptography and Coding","author":"U Maurer","year":"2005","unstructured":"Maurer, U.: Abstract models of computation in cryptography. In: Smart, N.P. (ed.) Cryptography and Coding, pp. 1\u201312. Springer, Berlin Heidelberg, Berlin, Heidelberg (2005)"},{"key":"15_CR39","unstructured":"Pedersen, T.P.: A threshold cryptosystem without a trusted party. In: EUROCRYPT \u201991 (1991)"},{"key":"15_CR40","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"774","DOI":"10.1007\/978-3-030-84242-0_27","volume-title":"Advances in Cryptology \u2013 CRYPTO 2021","author":"C R\u00e0fols","year":"2021","unstructured":"R\u00e0fols, C., Zapico, A.: An algebraic framework for universal and updatable SNARKs. In: Malkin, T., Peikert, C. (eds.) CRYPTO 2021. LNCS, vol. 12825, pp. 774\u2013804. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-84242-0_27"},{"key":"15_CR41","unstructured":"Rotem, L.: Revisiting the uber assumption in the algebraic group model: fine-grained bounds in hidden-order groups and improved reductions in bilinear groups. Cryptology ePrint Archive, Paper 2022\/584 (2022). https:\/\/eprint.iacr.org\/2022\/584"},{"key":"15_CR42","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"366","DOI":"10.1007\/978-3-030-64381-2_13","volume-title":"Theory of Cryptography","author":"L Rotem","year":"2020","unstructured":"Rotem, L., Segev, G.: Algebraic distinguishers: from discrete logarithms to decisional uber assumptions. In: Pass, R., Pietrzak, K. (eds.) TCC 2020. LNCS, vol. 12552, pp. 366\u2013389. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-64381-2_13"},{"key":"15_CR43","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"256","DOI":"10.1007\/3-540-69053-0_18","volume-title":"Advances in Cryptology \u2014 EUROCRYPT \u201997","author":"V Shoup","year":"1997","unstructured":"Shoup, V.: Lower bounds for discrete logarithms and related problems. In: Fumy, W. (ed.) EUROCRYPT 1997. LNCS, vol. 1233, pp. 256\u2013266. Springer, Heidelberg (1997). https:\/\/doi.org\/10.1007\/3-540-69053-0_18"},{"key":"15_CR44","doi-asserted-by":"crossref","unstructured":"Tomescu, A., et al.: Towards scalable threshold cryptosystems. In: 2020 IEEE Symposium on Security and Privacy (2020)","DOI":"10.1109\/SP40000.2020.00059"},{"key":"15_CR45","doi-asserted-by":"publisher","first-page":"652","DOI":"10.1007\/978-3-030-56784-2_22","volume-title":"Advances in Cryptology - CRYPTO 2020","author":"M Zhandry","year":"2020","unstructured":"Zhandry, M.: New techniques for traitor tracing: Size $${N}^{1\/3}$$ and more from pairings. In: Micciancio, D., Ristenpart, T. (eds.) Advances in Cryptology - CRYPTO 2020, pp. 652\u2013682. Springer International Publishing, Cham (2020)"},{"key":"15_CR46","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1007\/978-3-031-91131-6_11","volume-title":"Advances in Cryptology - EUROCRYPT 2025","author":"M Zhandry","year":"2025","unstructured":"Zhandry, M.: Optimal traitor tracing from pairings. In: Fehr, S., Fouque, P.A. (eds.) Advances in Cryptology - EUROCRYPT 2025, pp. 305\u2013335. Springer Nature Switzerland, Cham (2025)"},{"key":"15_CR47","doi-asserted-by":"publisher","unstructured":"Zhu, Z., Li, J., Zhang, K., Gong, J., Qian, H.: Registered functional encryptions from pairings. In: Advances in Cryptology - EUROCRYPT 2024 (2024). https:\/\/doi.org\/10.1007\/978-3-031-58723-8_13","DOI":"10.1007\/978-3-031-58723-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-5119-4_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,12,6]],"date-time":"2025-12-06T21:45:32Z","timestamp":1765057532000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-95-5119-4_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,12,7]]},"ISBN":["9789819551187","9789819551194"],"references-count":47,"URL":"https:\/\/doi.org\/10.1007\/978-981-95-5119-4_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,12,7]]},"assertion":[{"value":"7 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"}}]}}