{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,10]],"date-time":"2025-12-10T12:57:33Z","timestamp":1765371453133,"version":"3.46.0"},"publisher-location":"Cham","reference-count":45,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032133007","type":"print"},{"value":"9783032133014","type":"electronic"}],"license":[{"start":{"date-parts":[[2025,12,11]],"date-time":"2025-12-11T00:00:00Z","timestamp":1765411200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,12,11]],"date-time":"2025-12-11T00:00:00Z","timestamp":1765411200000},"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-13301-4_6","type":"book-chapter","created":{"date-parts":[[2025,12,10]],"date-time":"2025-12-10T09:12:42Z","timestamp":1765357962000},"page":"119-144","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Rejection-Free Framework of\u00a0Zero-Knowledge Proof Based on\u00a0Hint-MLWE"],"prefix":"10.1007","author":[{"given":"Antoine","family":"Douteau","sequence":"first","affiliation":[]},{"given":"Adeline","family":"Roux-Langlois","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,12,11]]},"reference":[{"key":"6_CR1","doi-asserted-by":"publisher","unstructured":"Agrawal, S., Kirshanova, E., Stehl\u00e9, D., Yadav, A.: Practical, round-optimal lattice-based blind signatures. In: Yin, H., Stavrou, A., Cremers, C., Shi, E. (eds.) ACM CCS 2022, pp. 39\u201353. ACM Press (2022). https:\/\/doi.org\/10.1145\/3548606.3560650","DOI":"10.1145\/3548606.3560650"},{"key":"6_CR2","unstructured":"Aguilar-Melchor, C., et al.: HQC. Technical report, National Institute of Standards and Technology (2022). https:\/\/csrc.nist.gov\/Projects\/post-quantum-cryptography\/round-4-submissions"},{"key":"6_CR3","doi-asserted-by":"publisher","unstructured":"Ajtai, M.: Generating hard instances of lattice problems (extended abstract). In: 28th ACM STOC, pp. 99\u2013108. ACM Press (1996). https:\/\/doi.org\/10.1145\/237814.237838","DOI":"10.1145\/237814.237838"},{"key":"6_CR4","doi-asserted-by":"publisher","unstructured":"Ajtai, M.: The shortest vector problem in L2 is NP-hard for randomized reductions (extended abstract). In: 30th ACM STOC, pp. 10\u201319. ACM Press (1998). https:\/\/doi.org\/10.1145\/276698.276705","DOI":"10.1145\/276698.276705"},{"key":"6_CR5","doi-asserted-by":"publisher","unstructured":"Albrecht, M.R., Player, R., Scott, S.: On the concrete hardness of learning with errors. In: Journal of Mathematical Cryptology, vol. 9 - 3, pp. 169\u2013203 (2015). https:\/\/doi.org\/10.1515\/jmc-2015-0016","DOI":"10.1515\/jmc-2015-0016"},{"key":"6_CR6","unstructured":"Aragon, N., et al.: BIKE. Technical report, National Institute of Standards and Technology (2022). https:\/\/csrc.nist.gov\/Projects\/post-quantum-cryptography\/round-4-submissions"},{"key":"6_CR7","doi-asserted-by":"publisher","unstructured":"Barbosa, M., et al.: Fixing and mechanizing the security proof of Fiat-Shamir with aborts and Dilithium. In: Handschuh, H., Lysyanskaya, A. (eds.) CRYPTO\u00a02023, Part\u00a0V. LNCS, vol. 14085, pp. 358\u2013389. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-38554-4_12","DOI":"10.1007\/978-3-031-38554-4_12"},{"key":"6_CR8","doi-asserted-by":"publisher","unstructured":"Barthe, G., et al.: Masking the GLP lattice-based signature scheme at any order. In: Nielsen, J.B., Rijmen, V. (eds.) EUROCRYPT\u00a02018, Part\u00a0II. LNCS, vol. 10821, pp. 354\u2013384. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-78375-8_12","DOI":"10.1007\/978-3-319-78375-8_12"},{"key":"6_CR9","doi-asserted-by":"publisher","unstructured":"Baum, C., Damg\u00e5rd, I., Lyubashevsky, V., Oechsner, S., Peikert, C.: More efficient commitments from structured lattice assumptions. In: Catalano, D., De Prisco, R. (eds.) SCN 18. LNCS, vol. 11035, pp. 368\u2013385. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-98113-0_20","DOI":"10.1007\/978-3-319-98113-0_20"},{"key":"6_CR10","doi-asserted-by":"publisher","unstructured":"Behnia, R., Chen, Y., Masny, D.: On removing rejection conditions in practical lattice-based signatures. In: Cheon, J.H., Tillich, J.P. (eds.) Post-Quantum Cryptography - 12th International Workshop, PQCrypto 2021, pp. 380\u2013398. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-81293-5_20","DOI":"10.1007\/978-3-030-81293-5_20"},{"issue":"6","key":"6_CR11","doi-asserted-by":"publisher","first-page":"2141","DOI":"10.1007\/s10623-023-01192-x","volume":"91","author":"W Beullens","year":"2023","unstructured":"Beullens, W., Dobson, S., Katsumata, S., Lai, Y.F., Pintore, F.: Group signatures and more from isogenies and lattices: generic, simple, and efficient. DCC 91(6), 2141\u20132200 (2023). https:\/\/doi.org\/10.1007\/s10623-023-01192-x","journal-title":"DCC"},{"key":"6_CR12","doi-asserted-by":"publisher","unstructured":"Beullens, W., Katsumata, S., Pintore, F.: Calamari and Falafl: logarithmic (linkable) ring signatures from isogenies and lattices. In: Moriai, S., Wang, H. (eds.) ASIACRYPT\u00a02020, Part\u00a0II. LNCS, vol. 12492, pp. 464\u2013492. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-64834-3_16","DOI":"10.1007\/978-3-030-64834-3_16"},{"key":"6_CR13","doi-asserted-by":"publisher","unstructured":"Bootle, J., Lyubashevsky, V., Nguyen, N.K., Sorniotti, A.: A framework for practical anonymous credentials from lattices. In: Handschuh, H., Lysyanskaya, A. (eds.) CRYPTO\u00a02023, Part\u00a0II. LNCS, vol. 14082, pp. 384\u2013417. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-38545-2_13","DOI":"10.1007\/978-3-031-38545-2_13"},{"key":"6_CR14","doi-asserted-by":"publisher","unstructured":"Bos, J.W., et al.: CRYSTALS - kyber: a CCA-secure module-lattice-based KEM. In: 2018 IEEE European Symposium on Security and Privacy, pp. 353\u2013367. IEEE Computer Society Press (2018). https:\/\/doi.org\/10.1109\/EuroSP.2018.00032","DOI":"10.1109\/EuroSP.2018.00032"},{"key":"6_CR15","doi-asserted-by":"publisher","unstructured":"Canetti, R., Lindell, Y., Ostrovsky, R., Sahai, A.: Universally composable two-party and multi-party secure computation. In: 34th ACM STOC, pp. 494\u2013503. ACM Press (2002). https:\/\/doi.org\/10.1145\/509907.509980","DOI":"10.1145\/509907.509980"},{"key":"6_CR16","doi-asserted-by":"publisher","unstructured":"Coron, J.S., G\u00e9rard, F., Lepoint, T., Trannoy, M., Zeitoun, R.: Improved high-order masked generation of masking vector and rejection sampling in Dilithium (2024). https:\/\/doi.org\/10.46586\/tches.v2024.i4.335-354","DOI":"10.46586\/tches.v2024.i4.335-354"},{"key":"6_CR17","doi-asserted-by":"publisher","unstructured":"De Feo, L., Galbraith, S.D.: SeaSign: compact isogeny signatures from class group actions. In: Ishai, Y., Rijmen, V. (eds.) EUROCRYPT\u00a02019, Part\u00a0III. LNCS, vol. 11478, pp. 759\u2013789. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-17659-4_26","DOI":"10.1007\/978-3-030-17659-4_26"},{"key":"6_CR18","doi-asserted-by":"publisher","unstructured":"Devevey, J., Fallahpour, P., Passel\u00e8gue, A., Stehl\u00e9, D.: A detailed analysis of Fiat-Shamir with aborts. In: Handschuh, H., Lysyanskaya, A. (eds.) CRYPTO\u00a02023, Part\u00a0V. LNCS, vol. 14085, pp. 327\u2013357. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-38554-4_11","DOI":"10.1007\/978-3-031-38554-4_11"},{"key":"6_CR19","doi-asserted-by":"publisher","unstructured":"Devevey, J., Fawzi, O., Passel\u00e8gue, A., Stehl\u00e9, D.: On rejection sampling in Lyubashevsky\u2019s signature scheme. In: Agrawal, S., Lin, D. (eds.) ASIACRYPT\u00a02022, Part\u00a0IV. LNCS, vol. 13794, pp. 34\u201364. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-22972-5_2","DOI":"10.1007\/978-3-031-22972-5_2"},{"key":"6_CR20","doi-asserted-by":"publisher","unstructured":"Devevey, J., Passel\u00e8gue, A., Stehl\u00e9, D.: G+G: A fiat-shamir lattice signature based on convolved gaussians. In: Guo, J., Steinfeld, R. (eds.) ASIACRYPT\u00a02023, Part\u00a0VII. LNCS, vol. 14444, pp. 37\u201364. Springer, Singapore (2023). https:\/\/doi.org\/10.1007\/978-981-99-8739-9_2","DOI":"10.1007\/978-981-99-8739-9_2"},{"key":"6_CR21","doi-asserted-by":"publisher","unstructured":"Ducas, L., Durmus, A., Lepoint, T., Lyubashevsky, V.: Lattice signatures and bimodal Gaussians. In: Canetti, R., Garay, J.A. (eds.) CRYPTO\u00a02013, Part\u00a0I. LNCS, vol.\u00a08042, pp. 40\u201356. Springer, Berlin, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-40041-4_3","DOI":"10.1007\/978-3-642-40041-4_3"},{"key":"6_CR22","doi-asserted-by":"publisher","unstructured":"Ducas, L., et al.: CRYSTALS-Dilithium: a lattice-based digital signature scheme. IACR TCHES 2018(1), 238\u2013268 (2018). https:\/\/doi.org\/10.13154\/tches.v2018.i1.238-268, https:\/\/tches.iacr.org\/index.php\/TCHES\/article\/view\/839","DOI":"10.13154\/tches.v2018.i1.238-268"},{"key":"6_CR23","doi-asserted-by":"publisher","unstructured":"Espitau, T., Fouque, P.A., G\u00e9rard, B., Tibouchi, M.: Side-channel attacks on BLISS lattice-based signatures: exploiting branch tracing against strongSwan and electromagnetic emanations in microcontrollers. In: Thuraisingham, B.M., Evans, D., Malkin, T., Xu, D. (eds.) ACM CCS 2017, pp. 1857\u20131874. ACM Press (2017). https:\/\/doi.org\/10.1145\/3133956.3134028","DOI":"10.1145\/3133956.3134028"},{"key":"6_CR24","doi-asserted-by":"publisher","unstructured":"Espitau, T., Niot, G., Prest, T.: Flood and submerse: distributed key generation and robust threshold signature from lattices. In: Reyzin, L., Stebila, D. (eds.) CRYPTO\u00a02024, Part\u00a0VII. LNCS, vol. 14926, pp. 425\u2013458. Springer, Cham (2024). https:\/\/doi.org\/10.1007\/978-3-031-68394-7_14","DOI":"10.1007\/978-3-031-68394-7_14"},{"key":"6_CR25","doi-asserted-by":"publisher","unstructured":"Fiat, A., Shamir, A.: How to prove yourself: Practical solutions to identification and signature problems. In: Odlyzko, A.M. (ed.) CRYPTO\u201986. LNCS, vol.\u00a0263, pp. 186\u2013194. Springer, Berlin, Heidelberg (1987). https:\/\/doi.org\/10.1007\/3-540-47721-7_12","DOI":"10.1007\/3-540-47721-7_12"},{"key":"6_CR26","doi-asserted-by":"publisher","unstructured":"Gentry, C., Peikert, C., Vaikuntanathan, V.: Trapdoors for hard lattices and new cryptographic constructions. In: Ladner, R.E., Dwork, C. (eds.) 40th ACM STOC, pp. 197\u2013206. ACM Press (2008).https:\/\/doi.org\/10.1145\/1374376.1374407","DOI":"10.1145\/1374376.1374407"},{"key":"6_CR27","doi-asserted-by":"publisher","unstructured":"Goldreich, O., Micciancio, D., Safra, S., Seifert, J.P.: Approximating shortest lattice vectors is not harder than approximating closest lattice vectors. Inf. Process. Lett. 71(2), 55\u201361 (1999). https:\/\/doi.org\/10.1016\/S0020-0190(99)00083-6, https:\/\/www.sciencedirect.com\/science\/article\/pii\/S0020019099000836","DOI":"10.1016\/S0020-0190(99)00083-6"},{"key":"6_CR28","doi-asserted-by":"publisher","unstructured":"Guo, Q., et al.: Don\u2019t reject this: key-recovery timing attacks due to rejection-sampling in HQC and BIKE. IACR TCHES 2022(3), 223\u2013263 (2022). https:\/\/doi.org\/10.46586\/tches.v2022.i3.223-263","DOI":"10.46586\/tches.v2022.i3.223-263"},{"key":"6_CR29","doi-asserted-by":"publisher","unstructured":"Hwang, I., Seo, J., Song, Y.: Concretely efficient lattice-based polynomial commitment from standard assumptions. In: Reyzin, L., Stebila, D. (eds.) CRYPTO\u00a02024, Part\u00a0X. LNCS, vol. 14929, pp. 414\u2013448. Springer, Cham (2024). https:\/\/doi.org\/10.1007\/978-3-031-68403-6_13","DOI":"10.1007\/978-3-031-68403-6_13"},{"key":"6_CR30","doi-asserted-by":"publisher","unstructured":"Ishai, Y., Sahai, A., Wagner, D.: Private circuits: securing hardware against probing attacks. In: Boneh, D. (ed.) CRYPTO\u00a02003. LNCS, vol.\u00a02729, pp. 463\u2013481. Springer, Berlin, Heidelberg (2003). https:\/\/doi.org\/10.1007\/978-3-540-45146-4_27","DOI":"10.1007\/978-3-540-45146-4_27"},{"key":"6_CR31","doi-asserted-by":"publisher","unstructured":"Kim, D., Lee, D., Seo, J., Song, Y.: Toward practical lattice-based proof of knowledge from hint-MLWE. In: Handschuh, H., Lysyanskaya, A. (eds.) CRYPTO\u00a02023, Part\u00a0V. LNCS, vol. 14085, pp. 549\u2013580. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-38554-4_18","DOI":"10.1007\/978-3-031-38554-4_18"},{"issue":"3","key":"6_CR32","doi-asserted-by":"publisher","first-page":"565","DOI":"10.1007\/s10623-014-9938-4","volume":"75","author":"A Langlois","year":"2015","unstructured":"Langlois, A., Stehl\u00e9, D.: Worst-case to average-case reductions for module lattices. DCC 75(3), 565\u2013599 (2015). https:\/\/doi.org\/10.1007\/s10623-014-9938-4","journal-title":"DCC"},{"key":"6_CR33","doi-asserted-by":"publisher","unstructured":"Lyubashevsky, V.: Fiat-Shamir with aborts: applications to lattice and factoring-based signatures. In: Matsui, M. (ed.) ASIACRYPT\u00a02009. LNCS, vol.\u00a05912, pp. 598\u2013616. Springer, Berlin, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-10366-7_35","DOI":"10.1007\/978-3-642-10366-7_35"},{"key":"6_CR34","doi-asserted-by":"publisher","unstructured":"Lyubashevsky, V.: Lattice signatures without trapdoors. In: Pointcheval, D., Johansson, T. (eds.) EUROCRYPT\u00a02012. LNCS, vol.\u00a07237, pp. 738\u2013755. Springer, Berlin, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-29011-4_43","DOI":"10.1007\/978-3-642-29011-4_43"},{"key":"6_CR35","doi-asserted-by":"publisher","unstructured":"Lyubashevsky, V., Nguyen, N.K.: BLOOM: Bimodal lattice one-out-of-many proofs and applications. In: Agrawal, S., Lin, D. (eds.) ASIACRYPT\u00a02022, Part\u00a0IV. LNCS, vol. 13794, pp. 95\u2013125. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-22972-5_4","DOI":"10.1007\/978-3-031-22972-5_4"},{"key":"6_CR36","doi-asserted-by":"publisher","unstructured":"Lyubashevsky, V., Nguyen, N.K., Plan\u00e7on, M.: Lattice-based zero-knowledge proofs and applications: shorter, simpler, and more general. In: Dodis, Y., Shrimpton, T. (eds.) CRYPTO\u00a02022, Part\u00a0II. LNCS, vol. 13508, pp. 71\u2013101. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-15979-4_3","DOI":"10.1007\/978-3-031-15979-4_3"},{"key":"6_CR37","doi-asserted-by":"publisher","unstructured":"Lyubashevsky, V., Nguyen, N.K., Seiler, G.: Shorter lattice-based zero-knowledge proofs via one-time commitments. In: Garay, J. (ed.) PKC\u00a02021, Part\u00a0I. LNCS, vol. 12710, pp. 215\u2013241. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-75245-3_9","DOI":"10.1007\/978-3-030-75245-3_9"},{"key":"6_CR38","doi-asserted-by":"publisher","unstructured":"Lyubashevsky, V., Seiler, G., Steuer, P.: The LaZer library: lattice-based zero knowledge and succinct proofs for quantum-safe privacy. In: Luo, B., Liao, X., Xu, J., Kirda, E., Lie, D. (eds.) ACM CCS 2024, pp. 3125\u20133137. ACM Press (2024). https:\/\/doi.org\/10.1145\/3658644.3690330","DOI":"10.1145\/3658644.3690330"},{"key":"6_CR39","doi-asserted-by":"publisher","unstructured":"Micciancio, D., Peikert, C.: Trapdoors for lattices: simpler, tighter, faster, smaller. In: Pointcheval, D., Johansson, T. (eds.) EUROCRYPT\u00a02012. LNCS, vol.\u00a07237, pp. 700\u2013718. Springer, Berlin, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-29011-4_41","DOI":"10.1007\/978-3-642-29011-4_41"},{"issue":"1","key":"6_CR40","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1137\/S0097539705447360","volume":"37","author":"D Micciancio","year":"2007","unstructured":"Micciancio, D., Regev, O.: Worst-case to average-case reductions based on gaussian measures. SIAM J. Comput. 37(1), 267\u2013302 (2007). https:\/\/doi.org\/10.1137\/S0097539705447360","journal-title":"SIAM J. Comput."},{"key":"6_CR41","doi-asserted-by":"publisher","unstructured":"Migliore, V., G\u00e9rard, B., Tibouchi, M., Fouque, P.A.: Masking Dilithium - efficient implementation and side-channel evaluation. In: Deng, R.H., Gauthier-Uma\u00f1a, V., Ochoa, M., Yung, M. (eds.) ACNS 19International Conference on Applied Cryptography and Network Security. LNCS, vol. 11464, pp. 344\u2013362. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-21568-2_17","DOI":"10.1007\/978-3-030-21568-2_17"},{"key":"6_CR42","doi-asserted-by":"publisher","unstructured":"Nguyen, N.K., Seiler, G.: Greyhound: Fast polynomial commitments from lattices. In: Reyzin, L., Stebila, D. (eds.) CRYPTO\u00a02024, Part\u00a0X. LNCS, vol. 14929, pp. 243\u2013275. Springer, Cham (2024). https:\/\/doi.org\/10.1007\/978-3-031-68403-6_8","DOI":"10.1007\/978-3-031-68403-6_8"},{"key":"6_CR43","doi-asserted-by":"publisher","unstructured":"Peikert, C.: An efficient and parallel Gaussian sampler for lattices. In: Rabin, T. (ed.) CRYPTO\u00a02010. LNCS, vol.\u00a06223, pp. 80\u201397. Springer, Berlin, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-14623-7_5","DOI":"10.1007\/978-3-642-14623-7_5"},{"key":"6_CR44","doi-asserted-by":"publisher","unstructured":"Prouff, E., Rivain, M.: Masking against side-channel attacks: a formal security proof. In: Johansson, T., Nguyen, P.Q. (eds.) EUROCRYPT\u00a02013. LNCS, vol.\u00a07881, pp. 142\u2013159. Springer, Berlin, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-38348-9_9","DOI":"10.1007\/978-3-642-38348-9_9"},{"key":"6_CR45","doi-asserted-by":"publisher","unstructured":"Regev, O.: On lattices, learning with errors, random linear codes, and cryptography. In: Gabow, H.N., Fagin, R. (eds.) 37th ACM STOC, pp. 84\u201393. ACM Press (2005). https:\/\/doi.org\/10.1145\/1060590.1060603","DOI":"10.1145\/1060590.1060603"}],"container-title":["Lecture Notes in Computer Science","Progress in Cryptology \u2013 INDOCRYPT 2025"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-13301-4_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,12,10]],"date-time":"2025-12-10T10:02:30Z","timestamp":1765360950000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-13301-4_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,12,11]]},"ISBN":["9783032133007","9783032133014"],"references-count":45,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-13301-4_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,12,11]]},"assertion":[{"value":"11 December 2025","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":"Bhubaneshwar","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":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 December 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 December 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"indocrypt2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}