{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,6]],"date-time":"2026-05-06T10:58:57Z","timestamp":1778065137162,"version":"3.51.4"},"publisher-location":"Singapore","reference-count":58,"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_9","type":"book-chapter","created":{"date-parts":[[2025,12,7]],"date-time":"2025-12-07T11:22:23Z","timestamp":1765106543000},"page":"262-293","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Laconic PSI on\u00a0Authenticated Inputs and\u00a0Applications"],"prefix":"10.1007","author":[{"given":"James","family":"Bartusek","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sanjam","family":"Garg","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Abhishek","family":"Jain","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Guru-Vamsi","family":"Policharla","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,12,8]]},"reference":[{"key":"9_CR1","doi-asserted-by":"crossref","unstructured":"Abe, M., Fuchsbauer, G., Groth, J., Haralambiev, K., Ohkubo, M.: Structure-preserving signatures and commitments to group elements. In: Rabin, T. (ed.) CRYPTO 2010. LNCS, vol. 6223, pp. 209\u2013236. Springer, Heidelberg (2010)","DOI":"10.1007\/978-3-642-14623-7_12"},{"key":"9_CR2","unstructured":"Agrawal, S., Kumari, S., Nishimaki, R.: Don\u2019t trust setup! new directions in pre-constrained cryptography. Cryptology ePrint Archive, Paper 2024\/1294 (2024)"},{"key":"9_CR3","unstructured":"Ananth, P., Jain, A., Jin, Z., Malavolta, G.: Pre-constrained encryption. In: Braverman, M. (ed.) ITCS 2022, vol. 215, pp. 4:1\u20134:20. LIPIcs (2022)"},{"key":"9_CR4","doi-asserted-by":"crossref","unstructured":"Aranha, D.F., Lin, C., Orlandi, C., Simkin, M.: Laconic private set-intersection from pairings. In: Yin, H., Stavrou, A., Cremers, C., Shi, E. (eds.) ACM CCS 2022, pp. 111\u2013124. ACM Press (2022)","DOI":"10.1145\/3548606.3560642"},{"key":"9_CR5","doi-asserted-by":"crossref","unstructured":"Baldi, P., Baronio, R., De Cristofaro, E., Gasti, P., Tsudik, G.: Countering GATTACA: efficient and secure testing of fully-sequenced human genomes. In: Chen, Y., Danezis, G., Shmatikov, V. (eds.) ACM CCS 2011, pp. 691\u2013702. ACM Press (2011)","DOI":"10.1145\/2046707.2046785"},{"key":"9_CR6","doi-asserted-by":"crossref","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)","DOI":"10.1007\/978-3-031-30589-4_2"},{"key":"9_CR7","unstructured":"Bartusek, J., Garg, S., Jain, A., Policharla, G.V.: Laconic PSI on authenticated inputs and applications. Cryptology ePrint Archive, Paper 2025\/1108 (2025)"},{"key":"9_CR8","doi-asserted-by":"crossref","unstructured":"Beimel, A., Ishai, Y., Malkin, T.: Reducing the servers computation in private information retrieval: PIR with preprocessing. In: Bellare, M. (ed.) CRYPTO 2000. LNCS, vol. 1880, pp. 55\u201373. Springer, Heidelberg (2000)","DOI":"10.1007\/3-540-44598-6_4"},{"key":"9_CR9","unstructured":"Bhowmick, A., Boneh, D., Myers, S., Talwar, K., Tarbe, K.: The apple PSI system (2021)"},{"key":"9_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"339","DOI":"10.1007\/978-3-662-53890-6_12","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2016","author":"O Blazy","year":"2016","unstructured":"Blazy, O., Chevalier, C.: Structure-preserving smooth projective hashing. In: Cheon, J.H., Takagi, T. (eds.) ASIACRYPT 2016. LNCS, vol. 10032, pp. 339\u2013369. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-53890-6_12"},{"key":"9_CR11","doi-asserted-by":"crossref","unstructured":"Bobolz, J., Farshim, P., Kohlweiss, M., Takahashi, A.: The brave new world of global generic groups and UC-secure zero-overhead SNARKs. Cryptology ePrint Archive, Paper 2024\/818 (2024)","DOI":"10.1007\/978-3-031-78011-0_4"},{"key":"9_CR12","doi-asserted-by":"crossref","unstructured":"Boneh, D., Boyen, X.: Short signatures without random oracles. In: Cachin, C., Camenisch, J. (eds.) EUROCRYPT 2004. LNCS, vol. 3027, pp. 56\u201373. Springer, Heidelberg (2004)","DOI":"10.1007\/978-3-540-24676-3_4"},{"key":"9_CR13","doi-asserted-by":"crossref","unstructured":"Boneh, D., Franklin, M.K.: Identity-based encryption from the Weil pairing. In: Kilian, J. (ed.) CRYPTO 2001. LNCS, vol. 2139, pp. 213\u2013229. Springer, Heidelberg (2001)","DOI":"10.1007\/3-540-44647-8_13"},{"issue":"3","key":"9_CR14","doi-asserted-by":"publisher","first-page":"586","DOI":"10.1137\/S0097539701398521","volume":"32","author":"D Boneh","year":"2003","unstructured":"Boneh, D., Franklin, M.K.: Identity based encryption from the Weil pairing. SIAM J. Comput. 32(3), 586\u2013615 (2003)","journal-title":"SIAM J. Comput."},{"key":"9_CR15","doi-asserted-by":"crossref","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)","DOI":"10.1007\/3-540-45682-1_30"},{"key":"9_CR16","doi-asserted-by":"crossref","unstructured":"Boyle, E., Ishai, Y., Pass, R., Wootters, M.: Can we access a database both locally and privately? In: Kalai, Y., Reyzin, L. (eds.) TCC 2017, Part II. LNCS, vol. 10678, pp. 662\u2013693. Springer, Cham (2017)","DOI":"10.1007\/978-3-319-70503-3_22"},{"key":"9_CR17","doi-asserted-by":"crossref","unstructured":"Camenisch, J., Zaverucha, G.M.: Private intersection of certified sets. In: Dingledine, R., Golle, P. (eds.) FC 2009. LNCS, vol. 5628, pp. 108\u2013127. Springer, Heidelberg (2009)","DOI":"10.1007\/978-3-642-03549-4_7"},{"key":"9_CR18","doi-asserted-by":"crossref","unstructured":"Canetti, R., Holmgren, J., Richelson, S.: Towards doubly efficient private information retrieval. In: Kalai, Y., Reyzin, L. (eds.) TCC 2017, Part II. LNCS, vol. 10678, pp. 694\u2013726. Springer, Cham (2017)","DOI":"10.1007\/978-3-319-70503-3_23"},{"key":"9_CR19","unstructured":"Choudhuri, A.R., Garg, S., Piet, J., Policharla, G.V.: Mempool privacy via batched threshold encryption: attacks and defenses. In: Balzarotti, D., Xu, W. (eds.) USENIX Security 2024. USENIX Association (2024)"},{"key":"9_CR20","unstructured":"Choudhuri, A.R., Garg, S., Policharla, G.V., Wang, M.: Practical mempool privacy via one-time setup batched threshold encryption. Cryptology ePrint Archive, Paper 2024\/1516 (2024)"},{"key":"9_CR21","doi-asserted-by":"crossref","unstructured":"David, B., Engelmann, F., Frederiksen, T., Kohlweiss, M., Pagnin, E., Volkhov, M.: Updatable privacy-preserving blueprints. In: Chung, K.-M., Sasaki, Yu. (eds.) ASIACRYPT 2024, Part I. LNCS, vol. 15484, pp. 105\u2013139. Springer, Singapore (2024)","DOI":"10.1007\/978-981-96-0875-1_4"},{"key":"9_CR22","doi-asserted-by":"crossref","unstructured":"De Cristofaro, E., Jarecki, S., Kim, J., Tsudik, G.: Privacy-preserving policy-based information transfer. In: Goldberg, I., Atallah, M.J. (eds.) PETS 2009. LNCS, vol. 5672, pp. 164\u2013184. Springer, Heidelberg (2009)","DOI":"10.1007\/978-3-642-03168-7_10"},{"key":"9_CR23","doi-asserted-by":"crossref","unstructured":"De Cristofaro, E., Kim, J., Tsudik, G.: Linear-complexity private set intersection protocols secure in malicious model. In: Abe, M. (ed.) ASIACRYPT 2010. LNCS, vol. 6477, pp. 213\u2013231. Springer, Heidelberg (2010)","DOI":"10.1007\/978-3-642-17373-8_13"},{"key":"9_CR24","doi-asserted-by":"crossref","unstructured":"De Cristofaro, E., Tsudik, G.: Practical private set intersection protocols with linear complexity. In: Sion, R. (ed.) FC 2010. LNCS, vol. 6052, pp. 143\u2013159. Springer, Heidelberg (2010)","DOI":"10.1007\/978-3-642-14577-3_13"},{"key":"9_CR25","doi-asserted-by":"crossref","unstructured":"Debnath, S.K., Dutta, R.: Secure and efficient private set intersection cardinality using bloom filter. In: Lopez, J., Mitchell, C.J. (eds.) ISC 2015. LNCS, vol. 9290, pp. 209\u2013226. Springer, Cham (2015)","DOI":"10.1007\/978-3-319-23318-5_12"},{"key":"9_CR26","doi-asserted-by":"crossref","unstructured":"Dutta, M., Ganesh, C., Patranabis, S., Singh, N.: Compute, but verify: efficient multiparty computation over authenticated inputs. In: Chung, K.-M., Sasaki, Yu. (eds.) ASIACRYPT 2024, Part VI. LNCS, vol. 15489, pp. 133\u2013166. Springer, Singapore (2024)","DOI":"10.1007\/978-981-96-0938-3_5"},{"key":"9_CR27","doi-asserted-by":"crossref","unstructured":"Dwork, C., Naor, M., Reingold, O., Stockmeyer, L.J.: Magic functions. In: 40th FOCS, pp. 523\u2013534. IEEE Computer Society Press (1999)","DOI":"10.1109\/SFFCS.1999.814626"},{"key":"9_CR28","unstructured":"Falzon, F., Markatou, E.A.: Re-visiting authorized private set intersection: a new privacy-preserving variant and two protocols. Cryptology ePrint Archive, Paper 2024\/1579 (2024)"},{"key":"9_CR29","unstructured":"Feist, D., Khovratovich, D.: Fast amortized KZG proofs. Cryptology ePrint Archive, Report 2023\/033 (2023)"},{"key":"9_CR30","doi-asserted-by":"crossref","unstructured":"Fiat, A., Shamir, A.: How to prove yourself: practical solutions to identification and signature problems. In: Odlyzko, A.M. (ed.) CRYPTO 1986. LNCS, vol. 263, pp. 186\u2013194. Springer, Heidelberg (1987)","DOI":"10.1007\/3-540-47721-7_12"},{"key":"9_CR31","doi-asserted-by":"crossref","unstructured":"Fleischhacker, N., Hall-Andersen, M., Simkin, M.: Extractable witness encryption for KZG commitments and efficient laconic OT. In: Chung, K.-M., Sasaki, Yu. (eds.) ASIACRYPT 2024, Part II. LNCS, vol. 15485, pp. 423\u2013453. Springer, Singapore (2024)","DOI":"10.1007\/978-981-96-0888-1_14"},{"key":"9_CR32","unstructured":"Center for Democracy and Technology. International coalition calls on Apple to abandon plan to build surveillance capabilities into iPhones, iPads, and other products (2021)"},{"key":"9_CR33","doi-asserted-by":"crossref","unstructured":"Freedman, M. J., Nissim, K., Pinkas, B.: Efficient private matching and set intersection. In: Cachin, C., Camenisch, J. (eds.) EUROCRYPT 2004. LNCS, vol. 3027, pp. 1\u201319. Springer, Heidelberg (2004)","DOI":"10.1007\/978-3-540-24676-3_1"},{"key":"9_CR34","doi-asserted-by":"crossref","unstructured":"Fuchsbauer, G., Kiltz, E., Loss, J.: The algebraic group model and its applications. In: Shacham, H., Boldyreva, A. (eds.) CRYPTO 2018, Part II. LNCS, vol. 10992, pp. 33\u201362. Springer, Cham (2018)","DOI":"10.1007\/978-3-319-96881-0_2"},{"key":"9_CR35","doi-asserted-by":"crossref","unstructured":"Garg, S., Kolonelos, D., Policharla, G.-V., Wang, M.: Threshold encryption with silent setup. In: Reyzin, L., Stebila, D. (eds.) CRYPTO 2024, Part VII. LNCS, vol. 14926, pp. 352\u2013386. Springer, Cham (2024)","DOI":"10.1007\/978-3-031-68394-7_12"},{"key":"9_CR36","doi-asserted-by":"crossref","unstructured":"Ghadafi, E.: More efficient structure-preserving signatures - or: bypassing the type-III lower bounds. In: Foley, S.N., Gollmann, D., Snekkenes, E. (eds.) ESORICS 2017, Part II. LNCS, vol. 10493, pp. 43\u201361. Springer, Cham (2017)","DOI":"10.1007\/978-3-319-66399-9_3"},{"key":"9_CR37","doi-asserted-by":"crossref","unstructured":"Goldreich, O.: The Foundations of Cryptography - Volume 2, Basic Applications. Cambridge University Press (2004)","DOI":"10.1017\/CBO9780511721656"},{"key":"9_CR38","unstructured":"Griffy, S., Kohlweiss, M., Lysyanskaya, A., Sengupta, M.: Privacy-preserving blueprints via succinctly verifiable computation over additively-homomorphically encrypted data. Cryptology ePrint Archive, Report 2024\/675 (2024)"},{"key":"9_CR39","doi-asserted-by":"crossref","unstructured":"Groth, J.: Fully anonymous group signatures without random oracles. In: Kurosawa, K. (ed.) ASIACRYPT 2007. LNCS, vol. 4833, pp. 164\u2013180. Springer, Heidelberg (2007)","DOI":"10.1007\/978-3-540-76900-2_10"},{"key":"9_CR40","doi-asserted-by":"crossref","unstructured":"Groth, J., Sahai, A.: Efficient non-interactive proof systems for bilinear groups. In: Smart, N.P. (ed.) EUROCRYPT 2008. LNCS, vol. 4965, pp. 415\u2013432. Springer, Heidelberg (2008)","DOI":"10.1007\/978-3-540-78967-3_24"},{"key":"9_CR41","doi-asserted-by":"crossref","unstructured":"Jain, A., Kalai, Y. T., Khurana, D., Rothblum, R.: Distinguisher-dependent simulation in two rounds and its applications. In: Katz, J., Shacham, H. (eds.) CRYPTO 2017, Part II. LNCS, vol. 10402, pp. 158\u2013189. Springer, Cham (2017)","DOI":"10.1007\/978-3-319-63715-0_6"},{"issue":"4","key":"9_CR42","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1007\/s00145-004-0312-y","volume":"17","author":"A Joux","year":"2004","unstructured":"Joux, A.: A one round protocol for tripartite Diffie-Hellman. J. Cryptol. 17(4), 263\u2013276 (2004)","journal-title":"J. Cryptol."},{"key":"9_CR43","doi-asserted-by":"crossref","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)","DOI":"10.1007\/978-3-642-17373-8_11"},{"key":"9_CR44","doi-asserted-by":"crossref","unstructured":"Kissner, L., Song, D.X.: Privacy-preserving set operations. In: Shoup, V. (ed.) CRYPTO 2005. LNCS, vol. 3621, pp. 241\u2013257. Springer, Heidelberg (2005)","DOI":"10.1007\/11535218_15"},{"key":"9_CR45","doi-asserted-by":"crossref","unstructured":"Kohlweiss, M., Lysyanskaya, A., Nguyen, A.: Privacy-preserving blueprints. In: Hazay, C., Stam, M. (eds.) EUROCRYPT 2023, Part II. LNCS, vol. 14005, pp. 594\u2013625. Springer, Cham (2023)","DOI":"10.1007\/978-3-031-30617-4_20"},{"key":"9_CR46","doi-asserted-by":"crossref","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, pp. 818\u2013829. ACM Press (2016)","DOI":"10.1145\/2976749.2978381"},{"key":"9_CR47","unstructured":"Kulshrestha, A., Mayer, J.R.: Identifying harmful media in end-to-end encrypted communication: efficient private membership computation. In: Bailey, M., Greenstadt, R. (eds.) USENIX Security 2021, pp. 893\u2013910. USENIX Association (2021)"},{"key":"9_CR48","doi-asserted-by":"crossref","unstructured":"Lin, W.-K., Mook, E., Wichs, D.: Doubly efficient private information retrieval and fully homomorphic RAM computation from ring LWE. In: Saha, B., Servedio, R.A. (eds.) 55th ACM STOC, pp. 595\u2013608. ACM Press (2023)","DOI":"10.1145\/3564246.3585175"},{"key":"9_CR49","doi-asserted-by":"crossref","unstructured":"Mezzour, G., Perrig, A., Gligor, V.D., Papadimitratos, P.: Privacy-preserving relationship path discovery in social networks. In: Garay, J.A., Miyaji, A., Otsuka, A. (eds.) CANS 2009. LNCS, vol. 5888, pp. 189\u2013208. Springer, Heidelberg (2009)","DOI":"10.1007\/978-3-642-10433-6_13"},{"key":"9_CR50","unstructured":"Nagaraja, S., Mittal, P., Hong, C.-Y., Caesar, M., Borisov, N.: BotGrep: finding P2P bots with structured graph analysis. In: USENIX Security 2010, pp. 95\u2013110. USENIX Association (2010)"},{"key":"9_CR51","unstructured":"Narayanan, A., Thiagarajan, N., Lakhani, M., Hamburg, M., Boneh, D.: Location privacy via private proximity testing. In: NDSS 2011. The Internet Society (2011)"},{"key":"9_CR52","doi-asserted-by":"crossref","unstructured":"Nechaev, V.I.: Complexity of a determinate algorithm for the discrete logarithm. Math. Notes 55(2), 165\u2013172 (1994)","DOI":"10.1007\/BF02113297"},{"key":"9_CR53","unstructured":"Pinkas, B., Schneider, T., Zohner, M.: Faster private set intersection based on OT extension. In: Fu, K., Jung, J. (eds.) USENIX Security 2014, pp. 797\u2013812. USENIX Association (2014)"},{"key":"9_CR54","unstructured":"Washington Post. U.K. orders Apple to let it spy on users\u2019 encrypted accounts (2025)"},{"key":"9_CR55","doi-asserted-by":"crossref","unstructured":"Rindal, P., Rosulek, M.: Malicious-secure private set intersection via dual execution. In: Thuraisingham, B.M., Evans, D., Malkin, T., Xu, D. (eds.) ACM CCS 2017, pp. 1229\u20131242. ACM Press (2017)","DOI":"10.1145\/3133956.3134044"},{"key":"9_CR56","doi-asserted-by":"crossref","unstructured":"Schnorr, C.-P.: Efficient identification and signatures for smart cards. In: Brassard, G. (ed.) CRYPTO 1989. LNCS, vol. 435, pp. 239\u2013252. Springer, New York (1990)","DOI":"10.1007\/0-387-34805-0_22"},{"key":"9_CR57","doi-asserted-by":"crossref","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)","DOI":"10.1007\/3-540-69053-0_18"},{"key":"9_CR58","doi-asserted-by":"crossref","unstructured":"Stefanov, E., Shi, E., Song, D.: Policy-enhanced private set intersection: sharing information while enforcing privacy policies. In: Fischlin, M., Buchmann, J., Manulis, M. (eds.) PKC 2012. LNCS, vol. 7293, pp. 413\u2013430. Springer, Heidelberg (2012)","DOI":"10.1007\/978-3-642-30057-8_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_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,12,7]],"date-time":"2025-12-07T11:22:28Z","timestamp":1765106548000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-95-5116-3_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,12,8]]},"ISBN":["9789819551156","9789819551163"],"references-count":58,"URL":"https:\/\/doi.org\/10.1007\/978-981-95-5116-3_9","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"}}]}}