{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,23]],"date-time":"2026-09-23T09:12:17Z","timestamp":1790154737993,"version":"4.0.1"},"publisher-location":"Singapore","reference-count":51,"publisher":"Springer Nature Singapore","isbn-type":[{"value":"9789819257362","type":"print"},{"value":"9789819257379","type":"electronic"}],"license":[{"start":{"date-parts":[[2026,9,24]],"date-time":"2026-09-24T00:00:00Z","timestamp":1790208000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,9,24]],"date-time":"2026-09-24T00:00:00Z","timestamp":1790208000000},"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":[[2027]]},"DOI":"10.1007\/978-981-92-5737-9_17","type":"book-chapter","created":{"date-parts":[[2026,9,23]],"date-time":"2026-09-23T08:56:35Z","timestamp":1790153795000},"page":"343-360","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Analyzing Bootstrapping in\u00a0Approximate Homomorphic Encryption Through the\u00a0Lens of\u00a0Optimization"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0009-0001-2954-2562","authenticated-orcid":false,"given":"Yat Chun","family":"Chan","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0007-2134-1241","authenticated-orcid":false,"given":"Feixiang","family":"Zhao","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2068-9530","authenticated-orcid":false,"given":"Man Ho","family":"Au","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2026,9,24]]},"reference":[{"key":"17_CR1","unstructured":"Fhe.org - fully homomorphic encryption. https:\/\/fhe.org\/. Accessed 30 July 2026"},{"key":"17_CR2","unstructured":"Helib: an implementation of homomorphic encryption. https:\/\/github.com\/homenc\/HElib. Accessed 30 July 2026"},{"key":"17_CR3","unstructured":"Microsoft seal (release 4.1) (2023). https:\/\/github.com\/Microsoft\/SEAL. Accessed 30 July 2026"},{"key":"17_CR4","unstructured":"Ao, W., Boddeti, V.N.: AutoFHE: automated adaption of CNNs for efficient evaluation over FHE. In: USENIX Security Symposium 2024 (2023). https:\/\/doi.org\/10.48550\/arxiv.2310.08012"},{"key":"17_CR5","unstructured":"Badawi, A.A., Polyakov, Y.: Demystifying bootstrapping in fully homomorphic encryption. Cryptology ePrint Archive, Paper 2023\/149 (2023). https:\/\/eprint.iacr.org\/2023\/149"},{"key":"17_CR6","unstructured":"Badawi, A.A., et\u00a0al.: OpenFHE: open-source fully homomorphic encryption library. Cryptology ePrint Archive, Paper 2022\/915 (2022). https:\/\/eprint.iacr.org\/2022\/915"},{"key":"17_CR7","doi-asserted-by":"publisher","unstructured":"Bae, Y., Cheon, J.H., Cho, W., Kim, J., Kim, T.: Meta-BTS: bootstrapping precision beyond the limit. In: Proceedings of the 2022 ACM SIGSAC Conference on Computer and Communications Security, pp. 223\u2013234. ACM (2022). https:\/\/doi.org\/10.1145\/3548606.3560696","DOI":"10.1145\/3548606.3560696"},{"key":"17_CR8","doi-asserted-by":"publisher","unstructured":"Bernard, O., Joye, M.: Bootstrapping (t)FHE ciphertexts via automorphisms: Closing the gap between binary and gaussian keys. In: Advances in Cryptology \u2013 ASIACRYPT 2025, pp. 3\u201335. Springer, Singapore (2026). https:\/\/doi.org\/10.1007\/978-981-95-5122-4_1","DOI":"10.1007\/978-981-95-5122-4_1"},{"key":"17_CR9","doi-asserted-by":"crossref","unstructured":"Bossuat, J.P., et al.: Security guidelines for implementing homomorphic encryption. IACR Commun. Cryptol. 1(4) (2025). https:\/\/doi.org\/10.62056\/anxra69p1","DOI":"10.62056\/anxra69p1"},{"key":"17_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"868","DOI":"10.1007\/978-3-642-32009-5_50","volume-title":"Advances in Cryptology \u2013 CRYPTO 2012","author":"Z Brakerski","year":"2012","unstructured":"Brakerski, Z.: Fully homomorphic encryption without modulus switching from classical GapSVP. In: Safavi-Naini, R., Canetti, R. (eds.) CRYPTO 2012. LNCS, vol. 7417, pp. 868\u2013886. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-32009-5_50"},{"key":"17_CR11","doi-asserted-by":"publisher","unstructured":"Brakerski, Z., Gentry, C., Vaikuntanathan, V.: (leveled) fully homomorphic encryption without bootstrapping. In: Proceedings of the 3rd Innovations in Theoretical Computer Science Conference, pp. 309\u2013325. ACM (2012). https:\/\/doi.org\/10.1145\/2090236.2090262","DOI":"10.1145\/2090236.2090262"},{"key":"17_CR12","doi-asserted-by":"publisher","unstructured":"Chatel, S., Knabenhans, C., Pyrgelis, A., Troncoso, C., Hubaux, J.P.: VERITAS: plaintext encoders for practical verifiable homomorphic encryption. In: Proceedings of the 2024 on ACM SIGSAC Conference on Computer and Communications Security, pp. 2520\u20132534. ACM (2024). https:\/\/doi.org\/10.1145\/3658644.3670282","DOI":"10.1145\/3658644.3670282"},{"key":"17_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"360","DOI":"10.1007\/978-3-319-78381-9_14","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2018","author":"JH Cheon","year":"2018","unstructured":"Cheon, J.H., Han, K., Kim, A., Kim, M., Song, Y.: Bootstrapping for approximate homomorphic encryption. In: Nielsen, J.B., Rijmen, V. (eds.) EUROCRYPT 2018. LNCS, vol. 10820, pp. 360\u2013384. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-78381-9_14"},{"key":"17_CR14","doi-asserted-by":"publisher","unstructured":"Cheon, J.H., Han, K., Kim, A., Kim, M., Song, Y.: A full RNS variant of approximate homomorphic encryption. In: Selected Areas in Cryptography - SAC 2018, vol. 11349, pp. 347\u2013368 (2018). https:\/\/doi.org\/10.1007\/978-3-030-10970-7_16","DOI":"10.1007\/978-3-030-10970-7_16"},{"key":"17_CR15","doi-asserted-by":"publisher","unstructured":"Cheon, J.H., Jang, D.: Cryptanalysis on lightweight verifiable homomorphic encryption (2025). https:\/\/doi.org\/10.48550\/arxiv.2502.12628","DOI":"10.48550\/arxiv.2502.12628"},{"key":"17_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"409","DOI":"10.1007\/978-3-319-70694-8_15","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2017","author":"JH Cheon","year":"2017","unstructured":"Cheon, J.H., Kim, A., Kim, M., Song, Y.: Homomorphic encryption for arithmetic of approximate numbers. In: Takagi, T., Peyrin, T. (eds.) ASIACRYPT 2017. LNCS, vol. 10624, pp. 409\u2013437. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-70694-8_15"},{"issue":"1","key":"17_CR17","doi-asserted-by":"publisher","first-page":"34","DOI":"10.1007\/s00145-019-09319-x","volume":"33","author":"I Chillotti","year":"2020","unstructured":"Chillotti, I., Gama, N., Georgieva, M., Izabach\u00e8ne, M.: TFHE: fast fully homomorphic encryption over the torus. J. Cryptol. 33(1), 34\u201391 (2020). https:\/\/doi.org\/10.1007\/s00145-019-09319-x","journal-title":"J. Cryptol."},{"key":"17_CR18","doi-asserted-by":"publisher","unstructured":"Dong, T., Cheng, W., Shang, W.: The research of KNN text categorization algorithm based on eager learning. In: 2012 International Conference on Industrial Control and Electronics Engineering, pp. 1120\u20131123 (2012). https:\/\/doi.org\/10.1109\/ICICEE.2012.297","DOI":"10.1109\/ICICEE.2012.297"},{"key":"17_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"617","DOI":"10.1007\/978-3-662-46800-5_24","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2015","author":"L Ducas","year":"2015","unstructured":"Ducas, L., Micciancio, D.: FHEW: bootstrapping homomorphic encryption in less than a second. In: Oswald, E., Fischlin, M. (eds.) EUROCRYPT 2015. LNCS, vol. 9056, pp. 617\u2013640. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-46800-5_24"},{"key":"17_CR20","unstructured":"EPFL-LDS, SA, T.I.: Lattigo v6 (2024). https:\/\/github.com\/tuneinsight\/lattigo. Accessed 30 July 2026"},{"key":"17_CR21","unstructured":"Fan, J., Vercauteren, F.: Somewhat practical fully homomorphic encryption. Cryptology ePrint Archive, Paper 2012\/144 (2012). https:\/\/eprint.iacr.org\/2012\/144"},{"issue":"1","key":"17_CR22","doi-asserted-by":"publisher","first-page":"13","DOI":"10.3390\/cryptography6010013","volume":"6","author":"P Fauzi","year":"2022","unstructured":"Fauzi, P., Hovd, M.N., Raddum, H.: On the IND-CCA1 security of FHE schemes. Cryptography 6(1), 13 (2022). https:\/\/doi.org\/10.3390\/cryptography6010013","journal-title":"Cryptography"},{"key":"17_CR23","doi-asserted-by":"publisher","unstructured":"Frery, J., et al.: Privacy-preserving tree-based inference with TFHE. In: Mobile, Secure, and Programmable Networking, pp. 139\u2013156. Springer (2024). https:\/\/doi.org\/10.1007\/978-3-031-52426-4_10","DOI":"10.1007\/978-3-031-52426-4_10"},{"key":"17_CR24","doi-asserted-by":"crossref","unstructured":"Gentry, C.: A fully homomorphic encryption scheme. Ph.D. thesis, Stanford University (2009)","DOI":"10.1145\/1536414.1536440"},{"key":"17_CR25","doi-asserted-by":"publisher","unstructured":"Gentry, C.: Fully homomorphic encryption using ideal lattices. In: Proceedings of the Forty-First Annual ACM Symposium on Theory of Computing, pp. 169\u2013178. ACM (2009). https:\/\/doi.org\/10.1145\/1536414.1536440","DOI":"10.1145\/1536414.1536440"},{"key":"17_CR26","doi-asserted-by":"publisher","unstructured":"Guimar\u00e3es, A., Pereira, H.V.L.: Fast amortized bootstrapping with small keys and polynomial noise overhead. In: Proceedings of the 2025 ACM SIGSAC Conference on Computer and Communications Security, pp. 2967\u20132981. ACM (2025). https:\/\/doi.org\/10.1145\/3719027.3765181","DOI":"10.1145\/3719027.3765181"},{"key":"17_CR27","doi-asserted-by":"publisher","unstructured":"Ha, G., Chen, Y., Cai, Z., Jia, C., Shan, X.: Random coding responses for resisting side-channel attacks in client-side deduplicated cloud storage. IEEE Trans. Serv. Comput. 18(3), 1697\u20131710 (2025). https:\/\/doi.org\/10.1109\/TSC.2025.3568252","DOI":"10.1109\/TSC.2025.3568252"},{"key":"17_CR28","unstructured":"Jiang, L., Ju, L.: Fhebench: benchmarking fully homomorphic encryption schemes (2022). https:\/\/doi.org\/10.48550\/arxiv.2203.00728"},{"key":"17_CR29","doi-asserted-by":"publisher","unstructured":"Kholod, A., Polyakov, Y., Schlottke-Lakemper, M.: Secure numerical simulations using fully homomorphic encryption. Comput. Phys. Commun. 318, 109868 (2026). https:\/\/doi.org\/10.1016\/j.cpc.2025.109868","DOI":"10.1016\/j.cpc.2025.109868"},{"key":"17_CR30","doi-asserted-by":"publisher","unstructured":"Kim, J., Seo, J., Song, Y.: Simpler and faster BFV bootstrapping for arbitrary plaintext modulus from CKKS. In: Proceedings of the 2024 on ACM SIGSAC Conference on Computer and Communications Security, pp. 2535\u20132546. ACM (2024). https:\/\/doi.org\/10.1145\/3658644.3670302","DOI":"10.1145\/3658644.3670302"},{"key":"17_CR31","unstructured":"Kr\u00fcger, C., Moriya, B., Schoop, D.: A performance comparison of the homomorphic encryption schemes CKKS and TFHE. Cryptology ePrint Archive, Paper 2025\/1460 (2025). https:\/\/eprint.iacr.org\/2025\/1460"},{"key":"17_CR32","doi-asserted-by":"publisher","unstructured":"Lam, K.Y., Lu, X., Zhang, L., Wang, X., Wang, H., Goh, S.Q.: Efficient FHE-based privacy-enhanced neural network for trustworthy AI-as-a-service. IEEE Trans. Dependable Secure Comput. 21(5), 4451\u20134468 (2024). https:\/\/doi.org\/10.1109\/TDSC.2024.3353536","DOI":"10.1109\/TDSC.2024.3353536"},{"key":"17_CR33","doi-asserted-by":"publisher","unstructured":"Lee, C., Min, S., Seo, J., Song, Y.: Faster TFHE bootstrapping with block binary keys. In: Proceedings of the 2023 ACM Asia Conference on Computer and Communications Security, pp. 2\u201313. ACM (2023). https:\/\/doi.org\/10.1145\/3579856.3595804","DOI":"10.1145\/3579856.3595804"},{"key":"17_CR34","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"648","DOI":"10.1007\/978-3-030-77870-5_23","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2021","author":"B Li","year":"2021","unstructured":"Li, B., Micciancio, D.: On the security of homomorphic encryption on approximate numbers. In: Canteaut, A., Standaert, F.-X. (eds.) EUROCRYPT 2021. LNCS, vol. 12696, pp. 648\u2013677. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-77870-5_23"},{"key":"17_CR35","doi-asserted-by":"publisher","unstructured":"Liang, J., Pang, R., Li, C., Wang, T.: Model extraction attacks revisited. In: Proceedings of the 19th ACM Asia Conference on Computer and Communications Security, pp. 1231\u20131245. ACM (2024). https:\/\/doi.org\/10.1145\/3634737.3657002","DOI":"10.1145\/3634737.3657002"},{"issue":"12","key":"17_CR36","first-page":"1489","volume":"23","author":"Z Liu","year":"2002","unstructured":"Liu, Z., Wang, W., Zhang, Y.: Research on eager classification and lazy classification. Mini-Micro Syst. 23(12), 1489\u20131491 (2002)","journal-title":"Mini-Micro Syst."},{"key":"17_CR37","doi-asserted-by":"publisher","unstructured":"Ma, S., Huang, T., Wang, A., Wang, X.: Faster BGV bootstrapping for power-of-two cyclotomics through homomorphic NTT. In: Advances in Cryptology - ASIACRYPT 2024, pp. 143\u2013175. Springer (2024). https:\/\/doi.org\/10.1007\/978-981-96-0875-1_5","DOI":"10.1007\/978-981-96-0875-1_5"},{"key":"17_CR38","unstructured":"Manohar, N.: High precision bootstrapping of approximate homomorphic encryption. Ph.D. thesis, University of California (2021)"},{"key":"17_CR39","doi-asserted-by":"publisher","unstructured":"Manulis, M., Nguyen, J.: Fully homomorphic encryption beyond IND-CCA1 security: integrity through verifiability. In: Advances in Cryptology - EUROCRYPT 2024, pp. 63\u201393. Springer (2024). https:\/\/doi.org\/10.1007\/978-3-031-58723-8_3","DOI":"10.1007\/978-3-031-58723-8_3"},{"issue":"10","key":"17_CR40","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1109\/JPROC.2022.3205665","volume":"110","author":"C Marcolla","year":"2022","unstructured":"Marcolla, C., Sucasas, V., Manzano, M., Bassoli, R., Fitzek, F.H.P., Aaraj, N.: Survey on fully homomorphic encryption, theory, and applications. Proc. IEEE 110(10), 1\u201338 (2022). https:\/\/doi.org\/10.1109\/JPROC.2022.3205665","journal-title":"Proc. IEEE"},{"key":"17_CR41","doi-asserted-by":"publisher","unstructured":"Njungle, N., Stojkov, M., Kinsy, M.: A safety-centric analysis and benchmarks of modern open-source homomorphic encryption libraries. In: Proceedings of the 22nd International Conference on Security and Cryptography - Volume 1: SECRYPT, pp. 483\u2013494 (2025). https:\/\/doi.org\/10.5220\/0013626400003979","DOI":"10.5220\/0013626400003979"},{"key":"17_CR42","doi-asserted-by":"publisher","unstructured":"Pooranian, Z., Chen, K.C., Yu, C.M., Conti, M.: RARE: defeating side channels based on data-deduplication in cloud storage. In: IEEE INFOCOM 2018 - IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS), pp. 444\u2013449 (2018). https:\/\/doi.org\/10.1109\/INFCOMW.2018.8406888","DOI":"10.1109\/INFCOMW.2018.8406888"},{"key":"17_CR43","series-title":"Communications in Computer and Information Science","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1007\/978-3-030-68035-0_9","volume-title":"High Performance Computing","author":"LB Pulido-Gaytan","year":"2021","unstructured":"Pulido-Gaytan, L.B., Tchernykh, A., Cort\u00e9s-Mendoza, J.M., Babenko, M., Radchenko, G.: A survey on privacy-preserving machine learning with fully homomorphic encryption. In: Nesmachnow, S., Castro, H., Tchernykh, A. (eds.) CARLA 2020. CCIS, vol. 1327, pp. 115\u2013129. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-68035-0_9"},{"key":"17_CR44","unstructured":"Quah, I., Badawi, A.A., Cousins, D.B., Polyakov, Y.: OpenFHE-based examples of logistic regression training using nesterov accelerated gradient descent. https:\/\/github.com\/openfheorg\/openfhe-logreg-training-examples. Accessed 30 July 2026"},{"key":"17_CR45","doi-asserted-by":"publisher","unstructured":"Rahman, T., Osmani, A.M.I.M., Rahman, M.S., Shibly, M.M.A., Islam, S.: Benchmarking fully homomorphic encryption libraries in IoT devices. In: Proceedings of the 11th International Conference on Networking, Systems, and Security, pp. 16\u201323. ACM (2024). https:\/\/doi.org\/10.1145\/3704522.3704546","DOI":"10.1145\/3704522.3704546"},{"key":"17_CR46","doi-asserted-by":"publisher","unstructured":"Rivaldi, V., Johari, N.H., Setiawan, R., Rumagit, R.Y.: Comparative simulation of homomorphic encryption techniques in edge-cloud computing: reducing computational and storage overhead. Procedia Comput. Sci. 269, 438\u2013448 (2025). https:\/\/doi.org\/10.1016\/j.procs.2025.08.296","DOI":"10.1016\/j.procs.2025.08.296"},{"key":"17_CR47","doi-asserted-by":"publisher","unstructured":"Shen, H., Xu, Q., Yu, B., Yang, Y., He, W.: Bootstrapping in approximate fully homomorphic encryption: a research survey. Cybersecurity 8(1), 87 (2025). https:\/\/doi.org\/10.1186\/s42400-025-00384-3","DOI":"10.1186\/s42400-025-00384-3"},{"issue":"4","key":"17_CR48","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3394658","volume":"53","author":"A Wood","year":"2021","unstructured":"Wood, A., Najarian, K., Kahrobaei, D.: Homomorphic encryption for machine learning in medicine and bioinformatics. ACM Comput. Surv. 53(4), 1\u201335 (2021). https:\/\/doi.org\/10.1145\/3394658","journal-title":"ACM Comput. Surv."},{"key":"17_CR49","unstructured":"Yang, Z., Niu, C., Wei, B., Huang, Z., Hong, C., Wei, T.: RBOOT: accelerating homomorphic neural network inference by fusing ReLu within bootstrapping. Cryptology ePrint Archive, Paper 2025\/1534 (2025). https:\/\/eprint.iacr.org\/2025\/1534"},{"key":"17_CR50","unstructured":"Zama: Concrete: TFHE compiler that converts python programs into FHE equivalent (2022). https:\/\/github.com\/zama-ai\/concrete. Accessed 30 July 2026"},{"key":"17_CR51","unstructured":"Zama: TFHE-RS: a pure rust implementation of the TFHE scheme for Boolean and integer Arithmetics over encrypted data (2022). https:\/\/github.com\/zama-ai\/tfhe-rs. Accessed 30 July 2026"}],"container-title":["Lecture Notes in Computer Science","Provable and Practical Security"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-92-5737-9_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,9,23]],"date-time":"2026-09-23T08:56:48Z","timestamp":1790153808000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-92-5737-9_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,9,24]]},"ISBN":["9789819257362","9789819257379"],"references-count":51,"URL":"https:\/\/doi.org\/10.1007\/978-981-92-5737-9_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,9,24]]},"assertion":[{"value":"24 September 2026","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"The authors have no competing interests to declare that are relevant to the content of this article.","order":1,"name":"Ethics","label":"Disclosure of Interests","group":{"name":"EthicsHeading","label":"Ethics"}},{"value":"ProvSec","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Provable Security","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Queenstown","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"New Zealand","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2026","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 September 2026","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26 September 2026","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"provsec2026","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/provsec-2026.github.io\/Provsec2026-base\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}