{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,28]],"date-time":"2026-02-28T01:04:11Z","timestamp":1772240651868,"version":"3.50.1"},"publisher-location":"Cham","reference-count":53,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031803079","type":"print"},{"value":"9783031803086","type":"electronic"}],"license":[{"start":{"date-parts":[[2024,12,13]],"date-time":"2024-12-13T00:00:00Z","timestamp":1734048000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,12,13]],"date-time":"2024-12-13T00:00:00Z","timestamp":1734048000000},"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-3-031-80308-6_12","type":"book-chapter","created":{"date-parts":[[2024,12,12]],"date-time":"2024-12-12T05:02:26Z","timestamp":1733979746000},"page":"258-281","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["An Efficient Toolkit for\u00a0Computing Third-Party Private Set Intersection"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0009-0007-8183-7281","authenticated-orcid":false,"given":"Kai","family":"Chen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2551-2737","authenticated-orcid":false,"given":"Yongqiang","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0005-0379-2343","authenticated-orcid":false,"given":"Mingsheng","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,12,13]]},"reference":[{"key":"12_CR1","doi-asserted-by":"crossref","unstructured":"Ben-Efraim, A., Nissenbaum, O., Omri, E., Paskin-Cherniavsky, A.: PSImple: practical multiparty maliciously-secure private set intersection. In: Proceedings of the 2022 ACM on Asia Conference on Computer and Communications Security, pp. 1098\u20131112 (2022)","DOI":"10.1145\/3488932.3523254"},{"issue":"7","key":"12_CR2","doi-asserted-by":"publisher","first-page":"422","DOI":"10.1145\/362686.362692","volume":"13","author":"BH Bloom","year":"1970","unstructured":"Bloom, B.H.: Space\/time trade-offs in hash coding with allowable errors. Commun. ACM 13(7), 422\u2013426 (1970)","journal-title":"Commun. ACM"},{"issue":"4","key":"12_CR3","doi-asserted-by":"publisher","first-page":"210","DOI":"10.1016\/j.ipl.2008.05.018","volume":"108","author":"P Bose","year":"2008","unstructured":"Bose, P., et al.: On the false-positive rate of bloom filters. Inf. Process. Lett. 108(4), 210\u2013213 (2008)","journal-title":"Inf. Process. Lett."},{"key":"12_CR4","unstructured":"Buddhavarapu, P., Knox, A., Mohassel, P., Sengupta, S., Taubeneck, E., Vlaskin, V.: Private matching for compute. Cryptology ePrint Archive (2020)"},{"key":"12_CR5","doi-asserted-by":"crossref","unstructured":"Chandran, N., Dasgupta, N., Gupta, D., Obbattu, S.L.B., Sekar, S., Shah, A.: Efficient linear multiparty psi and extensions to circuit\/quorum psi. In: Proceedings of the 2021 ACM SIGSAC Conference on Computer and Communications Security, pp. 1182\u20131204 (2021)","DOI":"10.1145\/3460120.3484591"},{"key":"12_CR6","doi-asserted-by":"publisher","unstructured":"Chase, M., Miao, P.: Private set intersection in the internet setting from lightweight oblivious PRF. In: Micciancio, D., Ristenpart, T. (eds.) CRYPTO 2020. LNCS, vol. 12172, pp. 34\u201363. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-56877-1_2","DOI":"10.1007\/978-3-030-56877-1_2"},{"key":"12_CR7","doi-asserted-by":"crossref","unstructured":"Chen, H., Huang, Z., Laine, K., Rindal, P.: Labeled PSI from fully homomorphic encryption with malicious security. In: Proceedings of the 2018 ACM SIGSAC Conference on Computer and Communications Security, pp. 1223\u20131237 (2018)","DOI":"10.1145\/3243734.3243836"},{"key":"12_CR8","doi-asserted-by":"crossref","unstructured":"Chen, H., Laine, K., Rindal, P.: Fast private set intersection from homomorphic encryption. In: Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security, pp. 1243\u20131255 (2017)","DOI":"10.1145\/3133956.3134061"},{"issue":"21","key":"12_CR9","doi-asserted-by":"publisher","first-page":"944","DOI":"10.1016\/j.ipl.2010.07.024","volume":"110","author":"K Christensen","year":"2010","unstructured":"Christensen, K., Roginsky, A., Jimeno, M.: A new analysis of the false positive rate of a bloom filter. Inf. Process. Lett. 110(21), 944\u2013949 (2010)","journal-title":"Inf. Process. Lett."},{"key":"12_CR10","doi-asserted-by":"crossref","unstructured":"Cong, K., et al.: Labeled psi from homomorphic encryption with reduced computation and communication. In: Proceedings of the 2021 ACM SIGSAC Conference on Computer and Communications Security, pp. 1135\u20131150 (2021)","DOI":"10.1145\/3460120.3484760"},{"key":"12_CR11","doi-asserted-by":"publisher","unstructured":"Davidson, A., Cid, C.: An efficient toolkit for computing private set operations. In: Pieprzyk, J., Suriadi, S. (eds.) Information Security and Privacy: 22nd Australasian Conference, ACISP 2017, Auckland, New Zealand, 3\u20135 July 2017, Proceedings, Part II 22, pp. 261\u2013278. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-59870-3_15","DOI":"10.1007\/978-3-319-59870-3_15"},{"key":"12_CR12","doi-asserted-by":"publisher","unstructured":"De\u00a0Cristofaro, E., Tsudik, G.: Practical private set intersection protocols with linear complexity. In: Sion, R. (eds.) International Conference on Financial Cryptography and Data Security, pp. 143\u2013159. Springer, Cham (2010). https:\/\/doi.org\/10.1007\/978-3-642-14577-3_13","DOI":"10.1007\/978-3-642-14577-3_13"},{"issue":"4","key":"12_CR13","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1016\/S0020-0190(02)00500-8","volume":"86","author":"L Devroye","year":"2003","unstructured":"Devroye, L., Morin, P.: Cuckoo hashing: further analysis. Inf. Process. Lett. 86(4), 215\u2013219 (2003)","journal-title":"Inf. Process. Lett."},{"key":"12_CR14","unstructured":"Dittmer, S., et al.: Function secret sharing for PSI-CA: with applications to private contact tracing. arXiv preprint arXiv:2012.13053 (2020)"},{"key":"12_CR15","doi-asserted-by":"crossref","unstructured":"Dong, C., Chen, L., Wen, Z.: When private set intersection meets big data: an efficient and scalable protocol. In: Proceedings of the 2013 ACM SIGSAC Conference on Computer & Communications Security, pp. 789\u2013800 (2013)","DOI":"10.1145\/2508859.2516701"},{"key":"12_CR16","doi-asserted-by":"publisher","unstructured":"Duong, T., Phan, D.H., Trieu, N.: Catalic: delegated PSI cardinality with applications to contact tracing. In: Moriai, S., Wang, H. (eds.) International Conference on the Theory and Application of Cryptology and Information Security, pp. 870\u2013899. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-64840-4_29","DOI":"10.1007\/978-3-030-64840-4_29"},{"issue":"4","key":"12_CR17","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"},{"key":"12_CR18","unstructured":"Flavio, B., et al.: pailliercryptolib (2023)"},{"issue":"2","key":"12_CR19","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1007\/s00224-004-1195-x","volume":"38","author":"D Fotakis","year":"2005","unstructured":"Fotakis, D., Pagh, R., Sanders, P., Spirakis, P.: Space efficient hash tables with worst case constant access time. Theory Comput. Syst. 38(2), 229\u2013248 (2005)","journal-title":"Theory Comput. Syst."},{"key":"12_CR20","doi-asserted-by":"publisher","unstructured":"Freedman, M.J., Ishai, Y., Pinkas, B., Reingold, O.: Keyword search and oblivious pseudorandom functions. In: Kilian, J. (ed.) TCC 2005. LNCS, vol. 3378, pp. 303\u2013324. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/978-3-540-30576-7_17","DOI":"10.1007\/978-3-540-30576-7_17"},{"key":"12_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-540-24676-3_1","volume-title":"Advances in Cryptology - EUROCRYPT 2004","author":"MJ Freedman","year":"2004","unstructured":"Freedman, M.J., Nissim, K., Pinkas, B.: Efficient private matching and set intersection. In: Cachin, C., Camenisch, J.L. (eds.) EUROCRYPT 2004. LNCS, vol. 3027, pp. 1\u201319. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-24676-3_1"},{"key":"12_CR22","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)"},{"key":"12_CR23","doi-asserted-by":"crossref","unstructured":"Hallgren, P., Orlandi, C., Sabelfeld, A.: PrivatePool: privacy-preserving ridesharing. In: 2017 IEEE 30th Computer Security Foundations Symposium (CSF), pp. 276\u2013291. IEEE (2017)","DOI":"10.1109\/CSF.2017.24"},{"key":"12_CR24","doi-asserted-by":"publisher","unstructured":"Hazay, C., Lindell, Y.: Efficient protocols for set intersection and pattern matching with security against malicious and covert adversaries. In: Canetti, R. (eds.) Theory of Cryptography Conference, pp. 155\u2013175. Springer, Cham (2008). https:\/\/doi.org\/10.1007\/978-3-540-78524-8_10","DOI":"10.1007\/978-3-540-78524-8_10"},{"key":"12_CR25","doi-asserted-by":"publisher","unstructured":"Hazay, C., Venkitasubramaniam, M.: Scalable multi-party private set-intersection. In: Fehr, S. (eds.) IACR International Workshop on Public Key Cryptography, pp. 175\u2013203. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-662-54365-8_8","DOI":"10.1007\/978-3-662-54365-8_8"},{"key":"12_CR26","doi-asserted-by":"publisher","unstructured":"Hoffstein, J., Pipher, J., Silverman, J.H.: NTRU: a ring-based public key cryptosystem. In: Buhler, J.P. (eds.) International Algorithmic Number Theory Symposium, pp. 267\u2013288. Springer, Cham (1998). https:\/\/doi.org\/10.1007\/BFb0054868","DOI":"10.1007\/BFb0054868"},{"key":"12_CR27","unstructured":"Hu, J., Chen, J., Dai, W., Wang, H.: Fully homomorphic encryption-based protocols for enhanced private set intersection functionalities. Cryptology ePrint Archive (2023)"},{"key":"12_CR28","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":"12_CR29","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":"12_CR30","unstructured":"Kales, D., Rechberger, C., Schneider, T., Senker, M., Weinert, C.: Mobile private contact discovery at scale. In: 28th USENIX Security Symposium (USENIX Security 2019), pp. 1447\u20131464 (2019)"},{"key":"12_CR31","doi-asserted-by":"publisher","unstructured":"Kamara, S., Mohassel, P., Raykova, M., Sadeghian, S.: Scaling private set intersection to billion-element sets. In: Christin, N., Safavi-Naini, R. (eds.) FC 2014. LNCS, vol. 8437, pp. 195\u2013215. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-662-45472-5_13","DOI":"10.1007\/978-3-662-45472-5_13"},{"key":"12_CR32","doi-asserted-by":"crossref","unstructured":"Kerschbaum, F.: Outsourced private set intersection using homomorphic encryption. In: Proceedings of the 7th ACM Symposium on Information, Computer and Communications Security, pp. 85\u201386 (2012)","DOI":"10.1145\/2414456.2414506"},{"key":"12_CR33","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":"12_CR34","doi-asserted-by":"crossref","unstructured":"Le, P.H., Ranellucci, S., Gordon, S.D.: Two-party private set intersection with an untrusted third party. In: Proceedings of the 2019 ACM SIGSAC Conference on Computer and Communications Security, pp. 2403\u20132420 (2019)","DOI":"10.1145\/3319535.3345661"},{"key":"12_CR35","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, pp. 134\u2013134. IEEE (1986)","DOI":"10.1109\/SP.1986.10022"},{"issue":"1","key":"12_CR36","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1145\/234313.234327","volume":"28","author":"R Motwani","year":"1996","unstructured":"Motwani, R., Raghavan, P.: Randomized algorithms. ACM Comput. Surv. (CSUR) 28(1), 33\u201337 (1996)","journal-title":"ACM Comput. Surv. (CSUR)"},{"key":"12_CR37","unstructured":"Nagaraja, S., Mittal, P., Hong, C.Y., Caesar, M., Borisov, N.: $$\\{$$BotGrep$$\\}$$: finding $$\\{$$P2P$$\\}$$ bots with structured graph analysis. In: 19th USENIX Security Symposium (USENIX Security 2010) (2010)"},{"key":"12_CR38","doi-asserted-by":"publisher","unstructured":"Orr\u00f9, M., Orsini, E., Scholl, P.: Actively secure 1-out-of-N OT extension with application to private set intersection. In: Handschuh, H. (ed.) CT-RSA 2017. LNCS, vol. 10159, pp. 381\u2013396. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-52153-4_22","DOI":"10.1007\/978-3-319-52153-4_22"},{"issue":"2","key":"12_CR39","doi-asserted-by":"publisher","first-page":"122","DOI":"10.1016\/j.jalgor.2003.12.002","volume":"51","author":"R Pagh","year":"2004","unstructured":"Pagh, R., Rodler, F.F.: Cuckoo hashing. J. Algorithms 51(2), 122\u2013144 (2004)","journal-title":"J. Algorithms"},{"key":"12_CR40","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1007\/3-540-48910-X_16","volume-title":"Advances in Cryptology \u2014 EUROCRYPT 1999","author":"P Paillier","year":"1999","unstructured":"Paillier, P.: Public-key cryptosystems based on composite degree residuosity classes. In: Stern, J. (ed.) EUROCRYPT 1999. LNCS, vol. 1592, pp. 223\u2013238. Springer, Heidelberg (1999). https:\/\/doi.org\/10.1007\/3-540-48910-X_16"},{"key":"12_CR41","doi-asserted-by":"publisher","unstructured":"Pinkas, B., Rosulek, M., Trieu, N., Yanai, A.: SpOT-Light: lightweight private set intersection from sparse ot extension. In: Boldyreva, A., Micciancio, D. (eds.) CRYPTO 2019. LNCS, vol. 11694, pp. 401\u2013431. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-26954-8_13","DOI":"10.1007\/978-3-030-26954-8_13"},{"key":"12_CR42","unstructured":"Pinkas, B., Schneider, T., Segev, G., Zohner, M.: Phasing: private set intersection using permutation-based hashing. In: 24th USENIX Security Symposium (USENIX Security 2015), pp. 515\u2013530 (2015)"},{"key":"12_CR43","doi-asserted-by":"publisher","unstructured":"Pinkas, B., Schneider, T., Smart, N.P., Williams, S.C.: Secure two-party computation is practical. In: Matsui, M. (ed.) ASIACRYPT 2009. LNCS, vol. 5912, pp. 250\u2013267. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-10366-7_15","DOI":"10.1007\/978-3-642-10366-7_15"},{"key":"12_CR44","doi-asserted-by":"publisher","unstructured":"Pinkas, B., Schneider, T., Tkachenko, O., Yanai, A.: Efficient circuit-based PSI with linear communication. In: Ishai, Y., Rijmen, V. (eds.) EUROCRYPT 2019. LNCS, vol. 11478, pp. 122\u2013153. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-17659-4_5","DOI":"10.1007\/978-3-030-17659-4_5"},{"key":"12_CR45","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1007\/978-3-319-78372-7_5","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2018","author":"B Pinkas","year":"2018","unstructured":"Pinkas, B., Schneider, T., Weinert, C., Wieder, U.: Efficient circuit-based PSI via Cuckoo hashing. In: Nielsen, J.B., Rijmen, V. (eds.) EUROCRYPT 2018. LNCS, vol. 10822, pp. 125\u2013157. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-78372-7_5"},{"issue":"2","key":"12_CR46","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. Privacy Secur. (TOPS) 21(2), 1\u201335 (2018)","journal-title":"ACM Trans. Privacy Secur. (TOPS)"},{"key":"12_CR47","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1007\/3-540-49543-6_13","volume-title":"Randomization and Approximation Techniques in Computer Science","author":"M Raab","year":"1998","unstructured":"Raab, M., Steger, A.: \u201cBalls into Bins\u2019\u2019\u2014a simple and tight analysis. In: Luby, M., Rolim, J.D.P., Serna, M. (eds.) RANDOM 1998. LNCS, vol. 1518, pp. 159\u2013170. Springer, Heidelberg (1998). https:\/\/doi.org\/10.1007\/3-540-49543-6_13"},{"key":"12_CR48","doi-asserted-by":"crossref","unstructured":"Rindal, P., Rosulek, M.: Malicious-secure private set intersection via dual execution. In: Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security, pp. 1229\u20131242 (2017)","DOI":"10.1145\/3133956.3134044"},{"key":"12_CR49","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"901","DOI":"10.1007\/978-3-030-77886-6_31","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2021","author":"P Rindal","year":"2021","unstructured":"Rindal, P., Schoppmann, P.: VOLE-PSI: fast OPRF and Circuit-PSI from Vector-OLE. In: Canteaut, A., Standaert, F.-X. (eds.) EUROCRYPT 2021. LNCS, vol. 12697, pp. 901\u2013930. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-77886-6_31"},{"key":"12_CR50","unstructured":"Trieu, N., Shehata, K., Saxena, P., Shokri, R., Song, D.: Epione: lightweight contact tracing with strong privacy. arXiv preprint arXiv:2004.13293 (2020)"},{"key":"12_CR51","unstructured":"Wu, M., Yuen, T.H.: Efficient unbalanced private set intersection cardinality and user-friendly privacy-preserving contact tracing. In: 32nd USENIX Security Symposium (USENIX Security 2023), pp. 283\u2013300 (2023)"},{"key":"12_CR52","doi-asserted-by":"crossref","unstructured":"Yeo, F.Y., Ying, J.H.: Third-party private set intersection. In: 2023 IEEE International Symposium on Information Theory (ISIT), pp. 1633\u20131638. IEEE (2023)","DOI":"10.1109\/ISIT54713.2023.10206690"},{"key":"12_CR53","doi-asserted-by":"crossref","unstructured":"Yeo, F.Y., Ying, J.H.: A near-linear quantum-safe third-party private set intersection protocol. Cryptology ePrint Archive (2024)","DOI":"10.1109\/ISIT54713.2023.10206690"}],"container-title":["Lecture Notes in Computer Science","Progress in Cryptology \u2013 INDOCRYPT 2024"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-80308-6_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,12,12]],"date-time":"2024-12-12T05:04:00Z","timestamp":1733979840000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-80308-6_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,12,13]]},"ISBN":["9783031803079","9783031803086"],"references-count":53,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-80308-6_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,12,13]]},"assertion":[{"value":"13 December 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"INDOCRYPT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Cryptology in India","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Chennai","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"India","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":"18 December 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 December 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"indocrypt2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}