{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,2]],"date-time":"2026-01-02T00:25:07Z","timestamp":1767313507740,"version":"3.48.0"},"publisher-location":"Cham","reference-count":45,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032070234","type":"print"},{"value":"9783032070241","type":"electronic"}],"license":[{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"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-3-032-07024-1_8","type":"book-chapter","created":{"date-parts":[[2026,1,2]],"date-time":"2026-01-02T00:21:37Z","timestamp":1767313297000},"page":"126-143","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Securely Computing One-Sided Matching Markets"],"prefix":"10.1007","author":[{"given":"James Hsin-Yu","family":"Chiang","sequence":"first","affiliation":[]},{"given":"Ivan","family":"Damg\u00e5rd","sequence":"additional","affiliation":[]},{"given":"Claudio","family":"Orlandi","sequence":"additional","affiliation":[]},{"given":"Mahak","family":"Pancholi","sequence":"additional","affiliation":[]},{"given":"Mark","family":"Simkin","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2026,1,2]]},"reference":[{"key":"8_CR1","unstructured":"Abdulkadiroglu, A.: Generalized matching for school choice. Unpublished paper, Duke University. [1311, 1312] (2011)"},{"issue":"5","key":"8_CR2","doi-asserted-by":"publisher","first-page":"1954","DOI":"10.1257\/aer.99.5.1954","volume":"99","author":"A Abdulkadiro\u011flu","year":"2009","unstructured":"Abdulkadiro\u011flu, A., Pathak, P.A., Roth, A.E.: Strategy-proofness versus efficiency in matching with indifferences: redesigning the nyc high school match. Am. Econ. Rev. 99(5), 1954\u20131978 (2009)","journal-title":"Am. Econ. Rev."},{"issue":"2","key":"8_CR3","doi-asserted-by":"publisher","first-page":"368","DOI":"10.1257\/000282805774669637","volume":"95","author":"A Abdulkadiro\u011flu","year":"2005","unstructured":"Abdulkadiro\u011flu, A., Pathak, P.A., Roth, A.E., S\u00f6nmez, T.: The Boston public school match. Am. Econ. Rev. 95(2), 368\u2013371 (2005)","journal-title":"Am. Econ. Rev."},{"key":"8_CR4","doi-asserted-by":"publisher","unstructured":"Al\u00a0Badawi, A., et al.: OpenFHE: open-source fully homomorphic encryption library. In: Proceedings of the 10th Workshop on Encrypted Computing & Applied Homomorphic Cryptography, pp. 53\u201363. WAHC\u201922, Association for Computing Machinery, New York, NY, USA (2022). https:\/\/doi.org\/10.1145\/3560827.3563379","DOI":"10.1145\/3560827.3563379"},{"key":"8_CR5","doi-asserted-by":"publisher","unstructured":"Albrecht, M., et al.: Homomorphic encryption standard. In: Lauter, K., Dai, W., Laine, K. (eds.) Protecting Privacy through Homomorphic Encryption, pp. 31\u201362. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-77287-1_2","DOI":"10.1007\/978-3-030-77287-1_2"},{"key":"8_CR6","doi-asserted-by":"publisher","unstructured":"Aly, A., Cuvelier, E., Mawet, S., Pereira, O., Van Vyve, M.: Securely solving simple combinatorial graph problems. In: Sadeghi, A.-R. (ed.) FC 2013. LNCS, vol. 7859, pp. 239\u2013257. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-39884-1_21","DOI":"10.1007\/978-3-642-39884-1_21"},{"key":"8_CR7","doi-asserted-by":"publisher","unstructured":"Araki, T., et al.: Secure graph analysis at scale. In: Vigna, G., Shi, E. (eds.) ACM CCS 2021: 28th Conference on Computer and Communications Security, pp. 610\u2013629. ACM Press, Virtual Event, Republic of Korea Nov\u00a015\u201319 (2021). https:\/\/doi.org\/10.1145\/3460120.3484560","DOI":"10.1145\/3460120.3484560"},{"issue":"1","key":"8_CR8","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1186\/s12911-022-01994-4","volume":"22","author":"T Birka","year":"2022","unstructured":"Birka, T., Hamacher, K., Kussel, T., M\u00f6llering, H., Schneider, T.: SPIKE: secure and private investigation of the kidney exchange problem. BMC Med. Inf. Decis. Making 22(1), 253 (2022)","journal-title":"BMC Med. Inf. Decis. Making"},{"key":"8_CR9","doi-asserted-by":"crossref","unstructured":"Blanton, M., Steele, A., Aliasgari, M.: Data-oblivious graph algorithms for secure computation and outsourcing. In: Chen, K., Xie, Q., Qiu, W., Li, N., Tzeng, W.G. (eds.) ASIACCS 13: 8th ACM Symposium on Information, Computer and Communications Security, pp. 207\u2013218. ACM Press, Hangzhou, China May\u00a08\u201310, (2013)","DOI":"10.1145\/2484313.2484341"},{"key":"8_CR10","doi-asserted-by":"publisher","unstructured":"Brakerski, Z., Gentry, C., Vaikuntanathan, V.: (Leveled) fully homomorphic encryption without bootstrapping. In: Goldwasser, S. (ed.) ITCS 2012: 3rd Innovations in Theoretical Computer Science, pp. 309\u2013325. Association for Computing Machinery, Cambridge, MA, USA Jan\u00a08\u201310 (2012). https:\/\/doi.org\/10.1145\/2090236.2090262","DOI":"10.1145\/2090236.2090262"},{"key":"8_CR11","doi-asserted-by":"crossref","unstructured":"Braun, L., Pancholi, M., Rachuri, R., Simkin, M.: Ramen: souper fast three-party computation for RAM programs. In: Meng, W., Jensen, C.D., Cremers, C., Kirda, E. (eds.) Proceedings of the 2023 ACM SIGSAC Conference on Computer and Communications Security, CCS 2023, Copenhagen, Denmark, November 26-30, 2023. ACM (2023)","DOI":"10.1145\/3576915.3623115"},{"key":"8_CR12","doi-asserted-by":"crossref","unstructured":"Breuer, M., et al.: Solving the kidney exchange problem using privacy-preserving integer programming. In: 19th Annual International Conference on Privacy, Security & Trust, PST 2022, Fredericton, NB, Canada, August 22-24, 2022, pp. 1\u201310. IEEE (2022)","DOI":"10.1109\/PST55820.2022.9851968"},{"key":"8_CR13","doi-asserted-by":"crossref","unstructured":"Breuer, M., Meyer, U., Wetzel, S.: Privacy-preserving maximum matching on general graphs and its application to enable privacy-preserving kidney exchange. In: Joshi, A., Fern\u00e1ndez, M., Verma, R.M. (eds.) CODASPY \u201922: Twelveth ACM Conference on Data and Application Security and Privacy, Baltimore, MD, USA, April 24 - 27, 2022, pp. 53\u201364. ACM (2022)","DOI":"10.1145\/3508398.3511509"},{"key":"8_CR14","doi-asserted-by":"publisher","unstructured":"Breuer, M., Meyer, U., Wetzel, S.: Efficient privacy-preserving approximation of the kidney exchange problem. CoRR abs\/2302.13880 (2023). https:\/\/doi.org\/10.48550\/arXiv.2302.13880","DOI":"10.48550\/arXiv.2302.13880"},{"key":"8_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1007\/978-3-030-57990-6_11","volume-title":"Security and Cryptography for Networks","author":"P Bunn","year":"2020","unstructured":"Bunn, P., Katz, J., Kushilevitz, E., Ostrovsky, R.: Efficient 3-party distributed ORAM. In: Galdi, C., Kolesnikov, V. (eds.) SCN 2020. LNCS, vol. 12238, pp. 215\u2013232. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-57990-6_11"},{"key":"8_CR16","doi-asserted-by":"publisher","unstructured":"Canetti, R.: universally composable security: a new paradigm for cryptographic protocols. In: 42nd Annual Symposium on Foundations of Computer Science. pp. 136\u2013145. IEEE Computer Society Press, Las Vegas, NV, USA Oct\u00a014\u201317 (2001). https:\/\/doi.org\/10.1109\/SFCS.2001.959888","DOI":"10.1109\/SFCS.2001.959888"},{"key":"8_CR17","doi-asserted-by":"publisher","unstructured":"Canetti, R., Lindell, Y., Ostrovsky, R., Sahai, A.: Universally composable two-party and multi-party secure computation. In: 34th Annual ACM Symposium on Theory of Computing, pp. 494\u2013503. ACM Press, Montr\u00e9al, Qu\u00e9bec, Canada May\u00a019\u201321 (2002). https:\/\/doi.org\/10.1145\/509907.509980","DOI":"10.1145\/509907.509980"},{"key":"8_CR18","unstructured":"Chiang, J.H., Damg\u00e5rd, I., Orlandi, C., Pancholi, M., Simkin, M.: Securely computing one-sided matching markets. IACR Cryptol. ePrint Arch. (2024). https:\/\/eprint.iacr.org\/2024\/1657"},{"key":"8_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"643","DOI":"10.1007\/978-3-642-32009-5_38","volume-title":"Advances in Cryptology \u2013 CRYPTO 2012","author":"I Damg\u00e5rd","year":"2012","unstructured":"Damg\u00e5rd, I., Pastro, V., Smart, N., Zakarias, S.: Multiparty computation from somewhat homomorphic encryption. In: Safavi-Naini, R., Canetti, R. (eds.) CRYPTO 2012. LNCS, vol. 7417, pp. 643\u2013662. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-32009-5_38"},{"key":"8_CR20","doi-asserted-by":"publisher","unstructured":"Doerner, J., Evans, D., shelat, a.: Secure stable matching at scale. 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. 1602\u20131613. ACM Press, Vienna, Austria Oct\u00a024\u201328, (2016). https:\/\/doi.org\/10.1145\/2976749.2978373","DOI":"10.1145\/2976749.2978373"},{"key":"8_CR21","doi-asserted-by":"publisher","unstructured":"Doerner, J., shelat, a.: Scaling ORAM for secure computation. In: Thuraisingham, B.M., Evans, D., Malkin, T., Xu, D. (eds.) ACM CCS 2017: 24th Conference on Computer and Communications Security, pp. 523\u2013535. ACM Press, Dallas, TX, USA Oct\u00a031\u00a0\u2013\u00a0Nov\u00a02 (2017). https:\/\/doi.org\/10.1145\/3133956.3133967","DOI":"10.1145\/3133956.3133967"},{"key":"8_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1007\/11967668_11","volume-title":"Topics in Cryptology \u2013 CT-RSA 2007","author":"M Franklin","year":"2006","unstructured":"Franklin, M., Gondree, M., Mohassel, P.: Improved efficiency for private stable matching. In: Abe, M. (ed.) CT-RSA 2007. LNCS, vol. 4377, pp. 163\u2013177. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11967668_11"},{"issue":"1","key":"8_CR23","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1080\/00029890.1962.11989827","volume":"69","author":"D Gale","year":"1962","unstructured":"Gale, D., Shapley, L.S.: College admissions and the stability of marriage. Am. Math. Mon. 69(1), 9\u201315 (1962)","journal-title":"Am. Math. Mon."},{"key":"8_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1007\/11889663_5","volume-title":"Financial Cryptography and Data Security","author":"P Golle","year":"2006","unstructured":"Golle, P.: A private stable matching algorithm. In: Di Crescenzo, G., Rubin, A. (eds.) FC 2006. LNCS, vol. 4107, pp. 65\u201380. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11889663_5"},{"key":"8_CR25","doi-asserted-by":"publisher","unstructured":"Gordon, S.D., et al.: Secure two-party computation in sublinear (amortized) time. In: Yu, T., Danezis, G., Gligor, V.D. (eds.) ACM CCS 2012: 19th Conference on Computer and Communications Security, pp. 513\u2013524. ACM Press, Raleigh, NC, USA Oct\u00a016\u201318 (2012). https:\/\/doi.org\/10.1145\/2382196.2382251","DOI":"10.1145\/2382196.2382251"},{"key":"8_CR26","unstructured":"Halevi, S., Shoup, V.: Algorithms in HElib. Cryptology ePrint Archive, Report 2014\/106 (2014). https:\/\/eprint.iacr.org\/2014\/106"},{"key":"8_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"499","DOI":"10.1007\/978-3-030-75248-4_18","volume-title":"Public-Key Cryptography \u2013 PKC 2021","author":"A Hamlin","year":"2021","unstructured":"Hamlin, A., Varia, M.: Two-server distributed ORAM with sublinear computation and constant rounds. In: Garay, J.A. (ed.) PKC 2021. LNCS, vol. 12711, pp. 499\u2013527. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-75248-4_18"},{"key":"8_CR28","doi-asserted-by":"crossref","unstructured":"Hillis, W.D., Steele\u00a0Jr, G.L.: Data parallel algorithms. Commun. ACM 29(12), 1170\u20131183 (1986). https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/7902.7903","DOI":"10.1145\/7902.7903"},{"issue":"2","key":"8_CR29","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1086\/260757","volume":"87","author":"A Hylland","year":"1979","unstructured":"Hylland, A., Zeckhauser, R.: The efficient allocation of individuals to positions. J. Polit. Econ. 87(2), 293\u2013314 (1979)","journal-title":"J. Polit. Econ."},{"key":"8_CR30","unstructured":"Jacobs, R.: Chicago booth (2019). https:\/\/www.chicagobooth.edu\/review\/when-students-are-matched-schools-who-wins"},{"key":"8_CR31","doi-asserted-by":"publisher","unstructured":"Jiang, X., Kim, M., Lauter, K., Song, Y.: Secure outsourced matrix computation and application to neural networks. In: Proceedings of the 2018 ACM SIGSAC conference on computer and communications security, pp. 1209\u20131222 (2018). https:\/\/doi.org\/10.1145\/3243734.3243837","DOI":"10.1145\/3243734.3243837"},{"key":"8_CR32","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"506","DOI":"10.1007\/978-3-662-45608-8_27","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2014","author":"M Keller","year":"2014","unstructured":"Keller, M., Scholl, P.: Efficient, oblivious data structures for MPC. In: Sarkar, P., Iwata, T. (eds.) ASIACRYPT 2014. LNCS, vol. 8874, pp. 506\u2013525. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-662-45608-8_27"},{"key":"8_CR33","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1007\/978-3-319-78372-7_4","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2018","author":"M Keller","year":"2018","unstructured":"Keller, M., Yanai, A.: Efficient maliciously secure multiparty computation for RAM. In: Nielsen, J.B., Rijmen, V. (eds.) EUROCRYPT 2018. LNCS, vol. 10822, pp. 91\u2013124. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-78372-7_4"},{"key":"8_CR34","doi-asserted-by":"publisher","unstructured":"Meng, X., Kamara, S., Nissim, K., Kollios, G.: GRECS: graph encryption for approximate shortest distance queries. In: Ray, I., Li, N., Kruegel, C. (eds.) ACM CCS 2015: 22nd Conference on Computer and Communications Security. pp. 504\u2013517. ACM Press, Denver, CO, USA Oct\u00a012\u201316 (2015). https:\/\/doi.org\/10.1145\/2810103.2813672","DOI":"10.1145\/2810103.2813672"},{"key":"8_CR35","unstructured":"Mondal, A., Panda, P., Agarwal, S., Aly, A., Gupta, D.: Fast and secure oblivious stable matching over arithmetic circuits. Cryptology ePrint Archive, Paper 2023\/1789 (2023). https:\/\/eprint.iacr.org\/2023\/1789"},{"key":"8_CR36","unstructured":"Noble, D., Falk, B.H., Ostrovsky, R.: Metadoram: breaking the log-overhead information theoretic barrier. IACR Cryptol. ePrint Arch. (2024)"},{"issue":"2","key":"8_CR37","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1016\/0165-1765(82)90003-9","volume":"9","author":"AE Roth","year":"1982","unstructured":"Roth, A.E.: Incentive compatibility in a market with indivisible goods. Econ. Lett. 9(2), 127\u2013132 (1982)","journal-title":"Econ. Lett."},{"issue":"2","key":"8_CR38","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1016\/0304-4068(77)90004-0","volume":"4","author":"AE Roth","year":"1977","unstructured":"Roth, A.E., Postlewaite, A.: Weak versus strong domination in a market with indivisible goods. J. Math. Econ. 4(2), 131\u2013137 (1977)","journal-title":"J. Math. Econ."},{"issue":"2","key":"8_CR39","doi-asserted-by":"publisher","first-page":"457","DOI":"10.1162\/0033553041382157","volume":"119","author":"AE Roth","year":"2004","unstructured":"Roth, A.E., S\u00f6nmez, T., \u00dcnver, M.U.: Kidney exchange. Q. J. Econ. 119(2), 457\u2013488 (2004)","journal-title":"Q. J. Econ."},{"key":"8_CR40","doi-asserted-by":"crossref","unstructured":"Sasy, S., Vadapalli, A., Goldberg, I.: PRAC: round-efficient 3-party MPC for dynamic data structures. IACR Cryptol. ePrint Arch. (2023)","DOI":"10.56553\/popets-2024-0100"},{"issue":"1","key":"8_CR41","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1016\/0304-4068(74)90033-0","volume":"1","author":"L Shapley","year":"1974","unstructured":"Shapley, L., Scarf, H.: On cores and indivisibility. J. Math. Econ. 1(1), 23\u201337 (1974)","journal-title":"J. Math. Econ."},{"key":"8_CR42","volume-title":"The public-housing allocation problem","author":"N Thakral","year":"2016","unstructured":"Thakral, N.: The public-housing allocation problem. Technical report, Harvard University, Tech. rep. (2016)"},{"key":"8_CR43","unstructured":"Vadapalli, A., Henry, R., Goldberg, I.: Duoram: a bandwidth-efficient distributed ORAM for 2- and 3-party computation. In: Calandrino, J.A., Troncoso, C. (eds.) 32nd USENIX Security Symposium, USENIX Security 2023, Anaheim, CA, USA, August 9-11 (2023). USENIX Association (2023)"},{"key":"8_CR44","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1007\/978-3-319-70972-7_5","volume-title":"Financial Cryptography and Data Security","author":"Q Wang","year":"2017","unstructured":"Wang, Q., Ren, K., Du, M., Li, Q., Mohaisen, A.: SecGDB: graph encryption for exact shortest distance queries with efficient updates. In: Kiayias, A. (ed.) FC 2017. LNCS, vol. 10322, pp. 79\u201397. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-70972-7_5"},{"key":"8_CR45","doi-asserted-by":"publisher","unstructured":"Zahur, S., et al.: Revisiting square-root ORAM: efficient random access in multi-party computation. In: 2016 IEEE Symposium on Security and Privacy. pp. 218\u2013234. IEEE Computer Society Press, San Jose, CA, USA May\u00a022\u201326 (2016). https:\/\/doi.org\/10.1109\/SP.2016.21","DOI":"10.1109\/SP.2016.21"}],"container-title":["Lecture Notes in Computer Science","Financial Cryptography and Data Security"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-07024-1_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,1,2]],"date-time":"2026-01-02T00:21:39Z","timestamp":1767313299000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-07024-1_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9783032070234","9783032070241"],"references-count":45,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-07024-1_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026]]},"assertion":[{"value":"2 January 2026","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"FC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Financial Cryptography and Data Security","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Miyakojima","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Japan","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":"14 April 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18 April 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"fc2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/fc25.ifca.ai\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}