{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,14]],"date-time":"2025-06-14T04:08:10Z","timestamp":1749874090112,"version":"3.41.0"},"publisher-location":"Singapore","reference-count":60,"publisher":"Springer Nature Singapore","isbn-type":[{"value":"9789819655656","type":"print"},{"value":"9789819655663","type":"electronic"}],"license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"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":[[2025]]},"DOI":"10.1007\/978-981-96-5566-3_9","type":"book-chapter","created":{"date-parts":[[2025,6,13]],"date-time":"2025-06-13T20:22:53Z","timestamp":1749846173000},"page":"155-180","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Fast Private Set Intersection from\u00a0Polynomial Multiplication Triples"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0009-0007-8183-7281","authenticated-orcid":false,"given":"Kai","family":"Chen","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2551-2737","authenticated-orcid":false,"given":"Yongqiang","family":"Li","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7921-0937","authenticated-orcid":false,"given":"Ya","family":"Han","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0009-0005-0379-2343","authenticated-orcid":false,"given":"Mingsheng","family":"Wang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,6,14]]},"reference":[{"key":"9_CR1","unstructured":"Armknecht, F., et al.: A guide to fully homomorphic encryption. Cryptology ePrint Archive (2015)"},{"key":"9_CR2","doi-asserted-by":"crossref","unstructured":"Beaver, D.: Efficient multiparty protocols using circuit randomization. In: Advances in Cryptology\u2014CRYPTO 1991: Proceedings 11, pp. 420\u2013432. Springer (1992)","DOI":"10.1007\/3-540-46766-1_34"},{"key":"9_CR3","unstructured":"Ben-Or, M., Goldwasser, S., Wigderson, A.: Completeness theorems for non-cryptographic fault-tolerant distributed computation. In: Providing Sound Foundations for Cryptography: on the Work of Shafi Goldwasser and Silvio Micali, pp. 351\u2013371 (2019)"},{"key":"9_CR4","unstructured":"Benny, P., Thomas, S., Michael, Z.: Faster private set intersection based on OT extension. In: Usenix Security, pp. 797\u2013812 (2014)"},{"key":"9_CR5","doi-asserted-by":"crossref","unstructured":"Boemer, F., Kim, S., Seifu, G., DM\u00a0de Souza, F., Gopal, V.: Intel HEXL: accelerating homomorphic encryption with intel AVX512-IFMA52. In: Proceedings of the 9th on Workshop on Encrypted Computing & Applied Homomorphic Cryptography, pp. 57\u201362 (2021)","DOI":"10.1145\/3474366.3486926"},{"issue":"3","key":"9_CR6","doi-asserted-by":"publisher","first-page":"366","DOI":"10.1016\/S0022-0000(74)80029-2","volume":"8","author":"A Borodin","year":"1974","unstructured":"Borodin, A., Moenck, R.: Fast modular transforms. J. Comput. Syst. Sci. 8(3), 366\u2013386 (1974)","journal-title":"J. Comput. Syst. Sci."},{"key":"9_CR7","doi-asserted-by":"crossref","unstructured":"Bostan, A., Lecerf, G., Schost, \u00c9.: Tellegen\u2019s principle into practice. In: Proceedings of the 2003 International Symposium on Symbolic and Algebraic Computation, pp. 37\u201344 (2003)","DOI":"10.1145\/860854.860870"},{"key":"9_CR8","doi-asserted-by":"crossref","unstructured":"Brakerski, Z., Gentry, C., Halevi, S.: Packed ciphertexts in LWE-based homomorphic encryption. In: Public-Key Cryptography\u2013PKC 2013: 16th International Conference on Practice and Theory in Public-Key Cryptography, Nara, Japan, 26 February\u20131 March 2013, Proceedings 16, pp. 1\u201313. Springer (2013)","DOI":"10.1007\/978-3-642-36362-7_1"},{"issue":"3","key":"9_CR9","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2633600","volume":"6","author":"Z Brakerski","year":"2014","unstructured":"Brakerski, Z., Gentry, C., Vaikuntanathan, V.: (leveled) fully homomorphic encryption without bootstrapping. ACM Trans. Comput. Theory (TOCT) 6(3), 1\u201336 (2014)","journal-title":"ACM Trans. Comput. Theory (TOCT)"},{"key":"9_CR10","doi-asserted-by":"crossref","unstructured":"Chase, M., Miao, P.: Private set intersection in the internet setting from lightweight oblivious prf. In: Advances in Cryptology\u2013CRYPTO 2020: 40th Annual International Cryptology Conference, CRYPTO 2020, Santa Barbara, CA, USA, 17\u201321 August 2020, Proceedings, Part III 40, pp. 34\u201363. Springer (2020)","DOI":"10.1007\/978-3-030-56877-1_2"},{"key":"9_CR11","doi-asserted-by":"crossref","unstructured":"Chen, H., Laine, K., Player, R.: Simple encrypted arithmetic library-seal v2. 1. In: Financial Cryptography and Data Security: FC 2017 International Workshops, WAHC, BITCOIN, VOTING, WTSC, and TA, Sliema, Malta, 7 April 2017, Revised Selected Papers 21, pp. 3\u201318. Springer (2017)","DOI":"10.1007\/978-3-319-70278-0_1"},{"key":"9_CR12","doi-asserted-by":"crossref","unstructured":"Chongchitmate, W., Ishai, Y., Lu, S., Ostrovsky, R.: PSI from ring-ole. In: Proceedings of the 2022 ACM SIGSAC Conference on Computer and Communications Security, pp. 531\u2013545 (2022)","DOI":"10.1145\/3548606.3559378"},{"issue":"90","key":"9_CR13","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1090\/S0025-5718-1965-0178586-1","volume":"19","author":"JW Cooley","year":"1965","unstructured":"Cooley, J.W., Tukey, J.W.: An algorithm for the machine calculation of complex Fourier series. Math. Comput. 19(90), 297\u2013301 (1965)","journal-title":"Math. Comput."},{"key":"9_CR14","doi-asserted-by":"crossref","unstructured":"Demmler, D., Schneider, T., Zohner, M.: Aby-a framework for efficient mixed-protocol secure two-party computation. In: NDSS (2015)","DOI":"10.14722\/ndss.2015.23113"},{"key":"9_CR15","doi-asserted-by":"crossref","unstructured":"Duong, T., Phan, D.H., Trieu, N.: Catalic: delegated PSI cardinality with applications to contact tracing. In: International Conference on the Theory and Application of Cryptology and Information Security, pp. 870\u2013899. Springer (2020)","DOI":"10.1007\/978-3-030-64840-4_29"},{"issue":"4","key":"9_CR16","doi-asserted-by":"publisher","first-page":"469","DOI":"10.1109\/TIT.1985.1057074","volume":"31","author":"T ElGamal","year":"1985","unstructured":"ElGamal, T.: A public key cryptosystem and a signature scheme based on discrete logarithms. IEEE Trans. Inf. Theory 31(4), 469\u2013472 (1985)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"6","key":"9_CR17","doi-asserted-by":"publisher","first-page":"637","DOI":"10.1145\/3812.3818","volume":"28","author":"S Even","year":"1985","unstructured":"Even, S., Goldreich, O., Lempel, A.: A randomized protocol for signing contracts. Commun. ACM 28(6), 637\u2013647 (1985)","journal-title":"Commun. ACM"},{"key":"9_CR18","unstructured":"Fan, J., Vercauteren, F.: Somewhat practical fully homomorphic encryption. Cryptology ePrint Archive (2012)"},{"key":"9_CR19","unstructured":"Flavio, B., et al.: pailliercryptolib (2023)"},{"key":"9_CR20","doi-asserted-by":"crossref","unstructured":"Freedman, M.J., Ishai, Y., Pinkas, B., Reingold, O.: Keyword search and oblivious pseudorandom functions. In: Theory of Cryptography: Second Theory of Cryptography Conference, TCC 2005, Cambridge, MA, USA, 10\u201312 February 2005, Proceedings 2, pp. 303\u2013324. Springer (2005)","DOI":"10.1007\/978-3-540-30576-7_17"},{"key":"9_CR21","doi-asserted-by":"crossref","unstructured":"Freedman, M.J., Nissim, K., Pinkas, B.: Efficient private matching and set intersection. In: International Conference on the Theory and Applications of Cryptographic Techniques, pp. 1\u201319. Springer (2004)","DOI":"10.1007\/978-3-540-24676-3_1"},{"key":"9_CR22","doi-asserted-by":"crossref","unstructured":"F\u00fcrer, M.: Faster integer multiplication. In: Proceedings of the Thirty-Ninth Annual ACM Symposium on Theory of Computing, pp. 57\u201366 (2007)","DOI":"10.1145\/1250790.1250800"},{"key":"9_CR23","doi-asserted-by":"crossref","unstructured":"Garimella, G., Pinkas, B., Rosulek, M., Trieu, N., Yanai, A.: Oblivious key-value stores and amplification for private set intersection. In: Advances in Cryptology\u2013 CRYPTO 2021: 41st Annual International Cryptology Conference, CRYPTO 2021, Virtual Event, 16\u201320 August 2021, Proceedings, Part II 41, pp. 395\u2013425. Springer (2021)","DOI":"10.1007\/978-3-030-84245-1_14"},{"key":"9_CR24","doi-asserted-by":"crossref","unstructured":"Gentleman, W.M., Sande, G.: Fast Fourier transforms: for fun and profit. In: Proceedings of the November 7\u201310, 1966, Fall Joint Computer Conference, pp. 563\u2013578 (1966)","DOI":"10.1145\/1464291.1464352"},{"key":"9_CR25","doi-asserted-by":"crossref","unstructured":"Gentry, C., Halevi, S., Smart, N.P.: Homomorphic evaluation of the AES circuit. In: Annual Cryptology Conference, pp. 850\u2013867. Springer (2012)","DOI":"10.1007\/978-3-642-32009-5_49"},{"key":"9_CR26","doi-asserted-by":"crossref","unstructured":"Ghosh, S., Nilges, T.: An algebraic approach to maliciously secure private set intersection. In: Annual International Conference on the Theory and Applications of Cryptographic Techniques, pp. 154\u2013185. Springer (2019)","DOI":"10.1007\/978-3-030-17659-4_6"},{"key":"9_CR27","unstructured":"Gilad-Bachrach, R., Dowlin, N., Laine, K., Lauter, K., Naehrig, M., Wernsing, J.: CryptoNets: applying neural networks to encrypted data with high throughput and accuracy. In: International Conference on Machine Learning, pp. 201\u2013210. PMLR (2016)"},{"key":"9_CR28","doi-asserted-by":"crossref","unstructured":"Gilboa, N.: Two party RSA key generation. In: Annual International Cryptology Conference, pp. 116\u2013129. Springer (1999)","DOI":"10.1007\/3-540-48405-1_8"},{"key":"9_CR29","unstructured":"Goldwasser, S., Micali, S.: Probabilistic encryption & how to play mental poker keeping secret all partial information. In: Providing Sound Foundations for Cryptography: On the Work of Shafi Goldwasser and Silvio Micali, pp. 173\u2013201 (2019)"},{"issue":"2","key":"9_CR30","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1145\/322248.322254","volume":"28","author":"GH Gonnet","year":"1981","unstructured":"Gonnet, G.H.: Expected length of the longest probe sequence in hash code searching. J. ACM (JACM) 28(2), 289\u2013304 (1981)","journal-title":"J. ACM (JACM)"},{"key":"9_CR31","doi-asserted-by":"crossref","unstructured":"Hoffstein, J., Pipher, J., Silverman, J.H.: NTRU: a ring-based public key cryptosystem. In: International Algorithmic Number Theory Symposium, pp. 267\u2013288. Springer (1998)","DOI":"10.1007\/BFb0054868"},{"key":"9_CR32","unstructured":"Huang, Y., Evans, D., Katz, J.: Private set intersection: are garbled circuits better than custom protocols? In: NDSS (2012)"},{"key":"9_CR33","doi-asserted-by":"crossref","unstructured":"Huberman, B.A., Franklin, M., Hogg, T.: Enhancing privacy and trust in electronic communities. In: Proceedings of the 1st ACM Conference on Electronic Commerce, pp. 78\u201386 (1999)","DOI":"10.1145\/336992.337012"},{"key":"9_CR34","doi-asserted-by":"crossref","unstructured":"Ion, M., et al.: On deploying secure computing: private intersection-sum-with-cardinality. In: 2020 IEEE European Symposium on Security and Privacy (EuroS &P), pp. 370\u2013389. IEEE (2020)","DOI":"10.1109\/EuroSP48549.2020.00031"},{"key":"9_CR35","unstructured":"Ion, M., et al.: Private intersection-sum protocol with applications to attributing aggregate ad conversions. Cryptology ePrint Archive (2017)"},{"key":"9_CR36","doi-asserted-by":"crossref","unstructured":"Ishai, Y., Kilian, J., Nissim, K., Petrank, E.: Extending oblivious transfers efficiently. In: Annual International Cryptology Conference, pp. 145\u2013161. Springer (2003)","DOI":"10.1007\/978-3-540-45146-4_9"},{"key":"9_CR37","doi-asserted-by":"crossref","unstructured":"Kissner, L., Song, D.: Privacy-preserving set operations. In: Annual International Cryptology Conference, pp. 241\u2013257. Springer (2005)","DOI":"10.1007\/11535218_15"},{"key":"9_CR38","doi-asserted-by":"crossref","unstructured":"Kolesnikov, V., Kumaresan, R., Rosulek, M., Trieu, N.: Efficient batched oblivious PRF with applications to private set intersection. In: Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications Security, pp. 818\u2013829 (2016)","DOI":"10.1145\/2976749.2978381"},{"key":"9_CR39","unstructured":"Liang, Z., Zhao, Y.: Number theoretic transform and its applications in lattice-based cryptosystems: a survey. arXiv preprint arXiv:2211.13546 (2022)"},{"key":"9_CR40","doi-asserted-by":"crossref","unstructured":"Longa, P., Naehrig, M.: Speeding up the number theoretic transform for faster ideal lattice-based cryptography. In: Cryptology and Network Security: 15th International Conference, CANS 2016, Milan, Italy, 14\u201316 November 2016, Proceedings 15, pp. 124\u2013139. Springer (2016)","DOI":"10.1007\/978-3-319-48965-0_8"},{"key":"9_CR41","doi-asserted-by":"crossref","unstructured":"Lyubashevsky, V., Peikert, C., Regev, O.: On ideal lattices and learning with errors over rings. In: Advances in Cryptology\u2013EUROCRYPT 2010: 29th Annual International Conference on the Theory and Applications of Cryptographic Techniques, French Riviera, 30 May\u20133 June 2010, Proceedings 29, pp. 1\u201323. Springer (2010)","DOI":"10.1007\/978-3-642-13190-5_1"},{"key":"9_CR42","doi-asserted-by":"crossref","unstructured":"Meadows, C.: A more efficient cryptographic matchmaking protocol for use in the absence of a continuously available third party. In: 1986 IEEE Symposium on Security and Privacy, p. 134. IEEE (1986)","DOI":"10.1109\/SP.1986.10022"},{"key":"9_CR43","doi-asserted-by":"crossref","unstructured":"Miao, P., Patel, S., Raykova, M., Seth, K., Yung, M.: Two-sided malicious security for private intersection-sum with cardinality. In: Annual International Cryptology Conference, pp. 3\u201333. Springer (2020)","DOI":"10.1007\/978-3-030-56877-1_1"},{"key":"9_CR44","doi-asserted-by":"crossref","unstructured":"Mohassel, P., Rindal, P., Rosulek, M.: Fast database joins and psi for secret shared data. In: Proceedings of the 2020 ACM SIGSAC Conference on Computer and Communications Security, pp. 1271\u20131287 (2020)","DOI":"10.1145\/3372297.3423358"},{"key":"9_CR45","doi-asserted-by":"crossref","unstructured":"Nussbaumer, H.J., Nussbaumer, H.J.: Elements of number theory and polynomial algebra. In: Fast Fourier Transform and Convolution Algorithms, pp. 4\u201331 (1982)","DOI":"10.1007\/978-3-642-81897-4_2"},{"key":"9_CR46","doi-asserted-by":"crossref","unstructured":"Orr\u00f9, M., Orsini, E., Scholl, P.: Actively secure 1-out-of-n OT extension with application to private set intersection. In: Topics in Cryptology\u2013CT-RSA 2017: The Cryptographers\u2019 Track at the RSA Conference 2017, San Francisco, CA, USA, 14\u201317 February 2017, Proceedings, pp. 381\u2013396. Springer (2017)","DOI":"10.1007\/978-3-319-52153-4_22"},{"key":"9_CR47","doi-asserted-by":"crossref","unstructured":"Paillier, P.: Public-key cryptosystems based on composite degree residuosity classes. In: International Conference on the Theory and Applications of Cryptographic Techniques, pp. 223\u2013238. Springer (1999)","DOI":"10.1007\/3-540-48910-X_16"},{"key":"9_CR48","doi-asserted-by":"crossref","unstructured":"Pinkas, B., Rosulek, M., Trieu, N., Yanai, A.: Spot-light: lightweight private set intersection from sparse OT extension. In: Advances in Cryptology\u2013CRYPTO 2019: 39th Annual International Cryptology Conference, Santa Barbara, CA, USA, 18\u201322 August 2019, Proceedings, Part III 39, pp. 401\u2013431. Springer (2019)","DOI":"10.1007\/978-3-030-26954-8_13"},{"key":"9_CR49","doi-asserted-by":"crossref","unstructured":"Pinkas, B., Rosulek, M., Trieu, N., Yanai, A.: PSI from PaXoS: fast, malicious private set intersection. In: Annual International Conference on the Theory and Applications of Cryptographic Techniques, pp. 739\u2013767. Springer (2020)","DOI":"10.1007\/978-3-030-45724-2_25"},{"key":"9_CR50","doi-asserted-by":"crossref","unstructured":"Pinkas, B., Schneider, T., Tkachenko, O., Yanai, A.: Efficient circuit-based PSI with linear communication. In: Advances in Cryptology\u2013EUROCRYPT 2019: 38th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Darmstadt, Germany, 19\u201323 May 2019, Proceedings, Part III 38, pp. 122\u2013153. Springer (2019)","DOI":"10.1007\/978-3-030-17659-4_5"},{"issue":"2","key":"9_CR51","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3154794","volume":"21","author":"B Pinkas","year":"2018","unstructured":"Pinkas, B., Schneider, T., Zohner, M.: Scalable private set intersection based on OT extension. ACM Trans. Priv. Secur. (TOPS) 21(2), 1\u201335 (2018)","journal-title":"ACM Trans. Priv. Secur. (TOPS)"},{"key":"9_CR52","unstructured":"Pullonen, P., Bogdanov, D., Schneider, T.: The design and implementation of a two-party protocol suite for SHAREMIND 3. CYBERNETICA Institute of Information Security, Technical report 4, 17 (2012)"},{"key":"9_CR53","doi-asserted-by":"crossref","unstructured":"Rindal, P., Rosulek, M.: Improved private set intersection against malicious adversaries. In: Annual International Conference on the Theory and Applications of Cryptographic Techniques, pp. 235\u2013259. Springer (2017)","DOI":"10.1007\/978-3-319-56620-7_9"},{"key":"9_CR54","doi-asserted-by":"crossref","unstructured":"Rindal, P., Schoppmann, P.: VOLE-PSI: fast OPRF and circuit-PSI from vector-OLE. In: Annual International Conference on the Theory and Applications of Cryptographic Techniques, pp. 901\u2013930. Springer (2021)","DOI":"10.1007\/978-3-030-77886-6_31"},{"key":"9_CR55","doi-asserted-by":"crossref","unstructured":"Rosulek, M., Trieu, N.: Compact and malicious private set intersection for small sets. In: Proceedings of the 2021 ACM SIGSAC Conference on Computer and Communications Security, pp. 1166\u20131181 (2021)","DOI":"10.1145\/3460120.3484778"},{"key":"9_CR56","doi-asserted-by":"crossref","unstructured":"Satriawan, A., Syafalni, I., Mareta, R., Anshori, I., Shalannanda, W., Barra, A.: Conceptual review on number theoretic transform and comprehensive review on its implementations. IEEE Access (2023)","DOI":"10.1109\/ACCESS.2023.3294446"},{"key":"9_CR57","unstructured":"Scott, M.: A note on the implementation of the number theoretic transform. In: Cryptography and Coding: 16th IMA International Conference, IMACC 2017, Oxford, UK, 12\u201314, 2017 December Proceedings 16, pp. 247\u2013258. Springer (2017)"},{"key":"9_CR58","doi-asserted-by":"crossref","unstructured":"Shamir, A.: On the power of commutativity in cryptography. In: International Colloquium on Automata, Languages, and Programming, pp. 582\u2013595. Springer (1980)","DOI":"10.1007\/3-540-10003-2_100"},{"key":"9_CR59","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1007\/s10623-012-9720-4","volume":"71","author":"NP Smart","year":"2014","unstructured":"Smart, N.P., Vercauteren, F.: Fully homomorphic SIMD operations. Des. Codes Crypt. 71, 57\u201381 (2014)","journal-title":"Des. Codes Crypt."},{"issue":"3","key":"9_CR60","doi-asserted-by":"publisher","first-page":"572","DOI":"10.1109\/49.1926","volume":"6","author":"Y Wang","year":"1988","unstructured":"Wang, Y., Zhu, X.: A fast algorithm for the Fourier transform over finite fields and its VLSI implementation. IEEE J. Sel. Areas Commun. 6(3), 572\u2013577 (1988)","journal-title":"IEEE J. Sel. Areas Commun."}],"container-title":["Lecture Notes in Computer Science","Information Security and Cryptology \u2013 ICISC 2024"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-96-5566-3_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,13]],"date-time":"2025-06-13T20:23:08Z","timestamp":1749846188000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-96-5566-3_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9789819655656","9789819655663"],"references-count":60,"URL":"https:\/\/doi.org\/10.1007\/978-981-96-5566-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]]},"assertion":[{"value":"14 June 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICISC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Information Security and Cryptology","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Seoul","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Korea (Republic of)","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20 November 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22 November 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"icisc2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.icisc.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}