{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,25]],"date-time":"2026-02-25T23:21:40Z","timestamp":1772061700691,"version":"3.50.1"},"reference-count":47,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2024,11,26]],"date-time":"2024-11-26T00:00:00Z","timestamp":1732579200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,11,26]],"date-time":"2024-11-26T00:00:00Z","timestamp":1732579200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100014188","name":"Ministry of Science and ICT, South Korea","doi-asserted-by":"publisher","award":["No.2020-0-00321"],"award-info":[{"award-number":["No.2020-0-00321"]}],"id":[{"id":"10.13039\/501100014188","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100014188","name":"Ministry of Science and ICT, South Korea","doi-asserted-by":"publisher","award":["No.2020-0-00321"],"award-info":[{"award-number":["No.2020-0-00321"]}],"id":[{"id":"10.13039\/501100014188","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100014188","name":"Ministry of Science and ICT, South Korea","doi-asserted-by":"publisher","award":["No.2020-0-00321"],"award-info":[{"award-number":["No.2020-0-00321"]}],"id":[{"id":"10.13039\/501100014188","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100014188","name":"Ministry of Science and ICT, South Korea","doi-asserted-by":"publisher","award":["No.2020-0-00321"],"award-info":[{"award-number":["No.2020-0-00321"]}],"id":[{"id":"10.13039\/501100014188","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Int. J. Inf. Secur."],"published-print":{"date-parts":[[2025,2]]},"DOI":"10.1007\/s10207-024-00941-w","type":"journal-article","created":{"date-parts":[[2024,11,26]],"date-time":"2024-11-26T17:10:48Z","timestamp":1732641048000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Verifiable computation over encrypted data via MPC-in-the-head zero-knowledge proofs"],"prefix":"10.1007","volume":"24","author":[{"given":"Joohee","family":"Lee","sequence":"first","affiliation":[]},{"given":"Sangrae","family":"Cho","sequence":"additional","affiliation":[]},{"given":"Soohyung","family":"Kim","sequence":"additional","affiliation":[]},{"given":"Saerom","family":"Park","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,11,26]]},"reference":[{"key":"941_CR1","doi-asserted-by":"crossref","unstructured":"Aranha, D.\u00a0F., Costache, A., Guimar\u00e3es, A., Soria-Vazquez, E.: Heliopolis: Verifiable computation over homomorphically encrypted data from interactive oracle proofs is practical. Cryptology ePrint Archive, (2023)","DOI":"10.1007\/978-981-96-0935-2_10"},{"key":"941_CR2","unstructured":"Asuncion, A., Newman, D.: Uci machine learning repository, (2007)"},{"key":"941_CR3","doi-asserted-by":"publisher","DOI":"10.62056\/a6ksdkp10","author":"S Atapoor","year":"2024","unstructured":"Atapoor, S., Baghery, K., Pereira, H.V.L., Spiessens, J.: Verifiable FHE via lattice-based SNARKs. IACR Commun. Cryptol. (2024). https:\/\/doi.org\/10.62056\/a6ksdkp10","journal-title":"IACR Commun. Cryptol."},{"key":"941_CR4","doi-asserted-by":"crossref","unstructured":"Ben-Sasson, E., Chiesa, A., Riabzev, M., Spooner, N., Virza, M., Ward, N.\u00a0P.: Aurora: Transparent succinct arguments for r1cs. In Advances in Cryptology\u2013EUROCRYPT 2019: 38th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Darmstadt, Germany, May 19\u201323, 2019, Proceedings, Part I 38, pages 103\u2013128. Springer, (2019)","DOI":"10.1007\/978-3-030-17653-2_4"},{"key":"941_CR5","series-title":"pp","doi-asserted-by":"publisher","first-page":"528","DOI":"10.1007\/978-3-030-75248-4_19","volume-title":"Public-Key Cryptography - PKC 2021","author":"A Bois","year":"2021","unstructured":"Bois, A., Cascudo, I., Fiore, D., Kim, D.: Flexible and efficient verifiable computation on encrypted data. In: Garay, J.A. (ed.) Public-Key Cryptography - PKC 2021. pp, pp. 528\u2013558. Springer International Publishing, Cham (2021)"},{"key":"941_CR6","doi-asserted-by":"crossref","unstructured":"Brakerski, Z.: Fully homomorphic encryption without modulus switching from classical gapsvp. In Annual cryptology conference, pages 868\u2013886. Springer, (2012)","DOI":"10.1007\/978-3-642-32009-5_50"},{"issue":"3","key":"941_CR7","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":"941_CR8","doi-asserted-by":"crossref","unstructured":"Brakerski, Z., Vaikuntanathan, V.: Fully homomorphic encryption from ring-lwe and security for key dependent messages. In Advances in Cryptology\u2013CRYPTO 2011: 31st Annual Cryptology Conference, Santa Barbara, CA, USA, August 14-18, 2011. Proceedings 31, pages 505\u2013524. Springer, (2011)","DOI":"10.1007\/978-3-642-22792-9_29"},{"key":"941_CR9","doi-asserted-by":"crossref","unstructured":"B\u00fcnz, B., Bootle, J., Boneh, D., Poelstra, A., Wuille, P., Maxwell, G.: Bulletproofs: Short proofs for confidential transactions and more. In 2018 IEEE Symposium on Security and Privacy (SP), pages 315\u2013334, (2018)","DOI":"10.1109\/SP.2018.00020"},{"key":"941_CR10","doi-asserted-by":"crossref","unstructured":"Catalano, D., Fiore, D.: Practical homomorphic macs for arithmetic circuits. In T.\u00a0Johansson and P.\u00a0Q. Nguyen, editors, Advances in Cryptology \u2013 EUROCRYPT 2013, pages 336\u2013352, Berlin, Heidelberg, . Springer Berlin Heidelberg(2013)","DOI":"10.1007\/978-3-642-38348-9_21"},{"key":"941_CR11","doi-asserted-by":"crossref","unstructured":"Chase, M., Derler, D., Goldfeder, S., Orlandi, C.,\u00a0Ramacher, S., Rechberger, C., Slamanig, D., Zaverucha, G.: Post-quantum zero-knowledge and signatures from symmetric-key primitives. In Proceedings of the 2017 acm sigsac conference on computer and communications security, pages 1825\u20131842, (2017)","DOI":"10.1145\/3133956.3133997"},{"key":"941_CR12","unstructured":"Chatel, S., Knabenhans, C., Pyrgelis, A., Troncoso, C., Hubaux, J.-P.: Verifiable encodings for secure homomorphic analytics. arXiv preprint[SPACE]arXiv:2207.14071, (2022)"},{"key":"941_CR13","doi-asserted-by":"crossref","unstructured":"Chatel, S., Mouchet, C., Sahin, A.\u00a0U., Pyrgelis, A., Troncoso, C., Hubaux, J.-P.: Pelta - shielding multiparty-fhe against malicious adversaries. In Proceedings of the 2023 ACM SIGSAC Conference on Computer and Communications Security, CCS \u201923, page 711-725, New York, NY, USA, . Association for Computing Machinery(2023)","DOI":"10.1145\/3576915.3623139"},{"key":"941_CR14","doi-asserted-by":"crossref","unstructured":"Chatel, S., Pyrgelis, A., Troncoso-Pastoriza, J.\u00a0R., Hubaux, J.-P.: Privacy and integrity preserving computations with crisp. In USENIX Security Symposium, pages 2111\u20132128, (2021)","DOI":"10.2478\/popets-2021-0043"},{"issue":"4","key":"941_CR15","first-page":"3","volume":"11","author":"H Chen","year":"2018","unstructured":"Chen, H., Gilad-Bachrach, R., Han, K., Huang, Z., Jalali, A., Laine, K., Lauter, K.: Logistic regression over encrypted data from fully homomorphic encryption. BMC Med. Genomics 11(4), 3\u201312 (2018)","journal-title":"BMC Med. Genomics"},{"key":"941_CR16","doi-asserted-by":"crossref","unstructured":"Cheon, J.\u00a0H., Han, K., Kim, A., Kim, M., Song, Y.: Bootstrapping for approximate homomorphic encryption. In Advances in Cryptology\u2013EUROCRYPT 2018: 37th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Tel Aviv, Israel, April 29-May 3, 2018 Proceedings, Part I 37, pages 360\u2013384. Springer, (2018)","DOI":"10.1007\/978-3-319-78381-9_14"},{"key":"941_CR17","series-title":"pp","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1007\/978-3-319-70278-0_4","volume-title":"Financial Cryptography and Data Security","author":"JH Cheon","year":"2017","unstructured":"Cheon, J.H., Jeong, J., Lee, J., Lee, K.: Privacy-preserving computations of predictive medical models with minimax approximation and non-adjacent form. In: Brenner, M., Rohloff, K., Bonneau, J., Miller, A., Ryan, P.Y., Teague, V., Bracciali, A., Sala, M., Pintore, F., Jakobsson, M. (eds.) Financial Cryptography and Data Security. pp, pp. 53\u201374. Springer International Publishing, Cham (2017)"},{"key":"941_CR18","doi-asserted-by":"crossref","unstructured":"Cheon, J.\u00a0H., Kim, A., Kim, M., Song, Y.: Homomorphic encryption for arithmetic of approximate numbers. In Advances in Cryptology\u2013ASIACRYPT 2017: 23rd International Conference on the Theory and Applications of Cryptology and Information Security, Hong Kong, China, December 3-7, 2017, Proceedings, Part I 23, pages 409\u2013437. Springer, (2017)","DOI":"10.1007\/978-3-319-70694-8_15"},{"key":"941_CR19","doi-asserted-by":"crossref","unstructured":"Cheon, J.\u00a0H., Kim, D., Kim, D., Lee, H.\u00a0H., Lee, K.: Numerical method for comparison on homomorphically encrypted numbers. In International Conference on the Theory and Application of Cryptology and Information Security, pages 415\u2013445. Springer, (2019)","DOI":"10.1007\/978-3-030-34621-8_15"},{"key":"941_CR20","doi-asserted-by":"crossref","unstructured":"Dittmer, S., Ishai, Y., Lu, S., Ostrovsky, R.: Improving line-point zero knowledge: Two multiplications for the price of one. In Proceedings of the 2022 ACM SIGSAC Conference on Computer and Communications Security, CCS \u201922, page 829-841, New York, NY, USA, . Association for Computing Machinery(2022)","DOI":"10.1145\/3548606.3559385"},{"key":"941_CR21","doi-asserted-by":"crossref","unstructured":"Escudero, D., Ghosh, S., Keller, M., Rachuri, R., Scholl, P.: Improved primitives for mpc over mixed arithmetic-binary circuits. In Advances in Cryptology\u2013CRYPTO 2020: 40th Annual International Cryptology Conference, CRYPTO 2020, Santa Barbara, CA, USA, August 17\u201321, 2020, Proceedings, Part II 40, pages 823\u2013852. Springer, (2020)","DOI":"10.1007\/978-3-030-56880-1_29"},{"key":"941_CR22","unstructured":"Fan, J., Vercauteren, F.: Somewhat practical fully homomorphic encryption. Cryptology ePrint Archive, (2012)"},{"key":"941_CR23","series-title":"pp","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1007\/978-3-030-45388-6_5","volume-title":"Public-Key Cryptography - PKC 2020","author":"D Fiore","year":"2020","unstructured":"Fiore, D., Nitulescu, A., Pointcheval, D.: Boosting verifiable computation on encrypted data. In: Kiayias, A., Kohlweiss, M., Wallden, P., Zikas, V. (eds.) Public-Key Cryptography - PKC 2020. pp, pp. 124\u2013154. Springer International Publishing, Cham (2020)"},{"issue":"4","key":"941_CR24","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1007\/s00145-023-09481-3","volume":"36","author":"C Ganesh","year":"2023","unstructured":"Ganesh, C., Nitulescu, A., Soria-Vazquez, E.: Rinocchio: snarks for ring arithmetic. J. Cryptol. 36(4), 41 (2023)","journal-title":"J. Cryptol."},{"issue":"4","key":"941_CR25","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1007\/s00145-023-09481-3","volume":"36","author":"C Ganesh","year":"2023","unstructured":"Ganesh, C., Nitulescu, A., Soria-Vazquez, E.: Rinocchio: snarks for ring arithmetic. J. Cryptol. 36(4), 41 (2023)","journal-title":"J. Cryptol."},{"key":"941_CR26","doi-asserted-by":"crossref","unstructured":"Garg, S., Jain, A., Jin, Z., Zhang, Y.: Succinct zero knowledge for floating point computations. In Proceedings of the 2022 ACM SIGSAC Conference on Computer and Communications Security, CCS \u201922, page 1203-1216, New York, NY, USA, Association for Computing Machinery(2022)","DOI":"10.1145\/3548606.3560653"},{"key":"941_CR27","unstructured":"Giacomelli, I., Madsen, J., Orlandi, C.: Zkboo: Faster zero-knowledge for boolean circuits. In USENIX Security Symposium, vol.\u00a016, (2016)"},{"issue":"4","key":"941_CR28","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2699436","volume":"62","author":"S Goldwasser","year":"2015","unstructured":"Goldwasser, S., Kalai, Y.T., Rothblum, G.N.: Delegating computation: interactive proofs for muggles. J. ACM (JACM) 62(4), 1\u201364 (2015)","journal-title":"J. ACM (JACM)"},{"key":"941_CR29","doi-asserted-by":"crossref","unstructured":"Groth, J.: On the size of pairing-based non-interactive arguments. In M.\u00a0Fischlin and J.-S. Coron, editors, Advances in Cryptology \u2013 EUROCRYPT 2016, pages 305\u2013326, Berlin, Heidelberg, Springer Berlin Heidelberg (2016)","DOI":"10.1007\/978-3-662-49896-5_11"},{"key":"941_CR30","doi-asserted-by":"crossref","unstructured":"Ishai, Y., Kushilevitz, E., Ostrovsky, R., Sahai, A.: Zero-knowledge from secure multiparty computation. In Proceedings of the thirty-ninth annual ACM symposium on Theory of computing, pages 21\u201330, (2007)","DOI":"10.1145\/1250790.1250794"},{"key":"941_CR31","doi-asserted-by":"crossref","unstructured":"Katz, J., Kolesnikov, V., Wang, X.: Improved non-interactive zero knowledge with applications to post-quantum signatures. In Proceedings of the 2018 ACM SIGSAC Conference on Computer and Communications Security, CCS \u201918, page 525-537, New York, NY, USA, . Association for Computing Machinery(2018)","DOI":"10.1145\/3243734.3243805"},{"issue":"2","key":"941_CR32","doi-asserted-by":"publisher","DOI":"10.2196\/medinform.8805","volume":"6","author":"M Kim","year":"2018","unstructured":"Kim, M., Song, Y., Wang, S., Xia, Y., Jiang, X.: Secure logistic regression based on homomorphic encryption: design and evaluation. JMIR Med. Inform. 6(2), e19 (2018)","journal-title":"JMIR Med. Inform."},{"key":"941_CR33","doi-asserted-by":"crossref","unstructured":"Lai, R.\u00a0W.\u00a0F., Tai, R.\u00a0K.\u00a0H., Wong, H.\u00a0W.\u00a0H., Chow, S.\u00a0S.\u00a0M.: Multi-key homomorphic signatures unforgeable under insider corruption. In T.\u00a0Peyrin and S.\u00a0D. Galbraith, editors, Advances in Cryptology - ASIACRYPT 2018 - 24th International Conference on the Theory and Application of Cryptology and Information Security, Brisbane, QLD, Australia, December 2-6, 2018, Proceedings, Part II, volume 11273 of Lecture Notes in Computer Science, pages 465\u2013492. Springer, (2018)","DOI":"10.1007\/978-3-030-03329-3_16"},{"key":"941_CR34","series-title":"pp","doi-asserted-by":"publisher","first-page":"648","DOI":"10.1007\/978-3-030-77870-5_23","volume-title":"Advances in Cryptology - 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.) Advances in Cryptology - EUROCRYPT 2021. pp, pp. 648\u2013677. Springer International Publishing, Cham (2021)"},{"key":"941_CR35","doi-asserted-by":"publisher","first-page":"166","DOI":"10.1016\/j.ins.2020.03.041","volume":"526","author":"J Li","year":"2020","unstructured":"Li, J., Kuang, X., Lin, S., Ma, X., Tang, Y.: Privacy preservation for machine learning training and classification based on homomorphic encryption schemes. Inf. Sci. 526, 166\u2013179 (2020)","journal-title":"Inf. Sci."},{"issue":"6","key":"941_CR36","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2535925","volume":"60","author":"V Lyubashevsky","year":"2013","unstructured":"Lyubashevsky, V., Peikert, C., Regev, O.: On ideal lattices and learning with errors over rings. J. ACM (JACM) 60(6), 1\u201335 (2013)","journal-title":"J. ACM (JACM)"},{"key":"941_CR37","doi-asserted-by":"crossref","unstructured":"Ng, L.\u00a0K.\u00a0L., Chow, S.\u00a0S.\u00a0M.: Sok: Cryptographic neural-network computation. In 44th IEEE Symposium on Security and Privacy, SP 2023, San Francisco, CA, USA, May 21-25, 2023, pages 497\u2013514. IEEE, (2023)","DOI":"10.1109\/SP46215.2023.10179483"},{"key":"941_CR38","doi-asserted-by":"crossref","unstructured":"Park, S., Byun, J., Lee, J.: Privacy-preserving fair learning of support vector machine with homomorphic encryption. In Proceedings of the ACM Web Conference 2022, WWW \u201922, page 3572-3583, New York, NY, USA, . Association for Computing Machinery(2022)","DOI":"10.1145\/3485447.3512252"},{"key":"941_CR39","doi-asserted-by":"publisher","first-page":"57414","DOI":"10.1109\/ACCESS.2020.2981818","volume":"8","author":"S Park","year":"2020","unstructured":"Park, S., Byun, J., Lee, J., Cheon, J.H., Lee, J.: He-friendly algorithm for privacy-preserving svm training. IEEE Access 8, 57414\u201357425 (2020)","journal-title":"IEEE Access"},{"key":"941_CR40","first-page":"2825","volume":"12","author":"F Pedregosa","year":"2011","unstructured":"Pedregosa, F., Varoquaux, G., Gramfort, A., Michel, V., Thirion, B., Grisel, O., Blondel, M., Prettenhofer, P., Weiss, R., Dubourg, V., Vanderplas, J., Passos, A., Cournapeau, D., Brucher, M., Perrot, M., Duchesnay, E.: Scikit-learn: machine learning in Python. J. Mach. Learn. Res. 12, 2825\u20132830 (2011)","journal-title":"J. Mach. Learn. Res."},{"key":"941_CR41","doi-asserted-by":"crossref","unstructured":"Regev, O.: On lattices, learning with errors, random linear codes, and cryptography. J. ACM, 56(6), sep (2009)","DOI":"10.1145\/1568318.1568324"},{"issue":"6","key":"941_CR42","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipm.2021.102745","volume":"58","author":"C Regueiro","year":"2021","unstructured":"Regueiro, C., Seco, I., de Diego, S., Lage, O., Etxebarria, L.: Privacy-enhancing distributed protocol for data aggregation based on blockchain and homomorphic encryption. Inf. Process. Manag. 58(6), 102745 (2021)","journal-title":"Inf. Process. Manag."},{"key":"941_CR43","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1016\/j.tcs.2021.08.002","volume":"889","author":"SD Samarin","year":"2021","unstructured":"Samarin, S.D., Fiore, D., Venturi, D., Amini, M.: A compiler for multi-key homomorphic signatures for turing machines. Theor. Comput. Sci. 889, 145\u2013170 (2021)","journal-title":"Theor. Comput. Sci."},{"key":"941_CR44","doi-asserted-by":"crossref","unstructured":"Viand, A., Knabenhans, C., Hithnawi, A.: Poster: Verifiable fully homomorphic encryption. In 2023 IEEE Symposium on Security and Privacy (SP). IEEE, (2024)","DOI":"10.1145\/3689945.3694806"},{"key":"941_CR45","unstructured":"Weng, C., Yang, K., Xie, X., Katz, J., Wang, X.: Mystique: Efficient conversions for zero-knowledge proofs with applications to machine learning. In USENIX Security Symposium, pages 501\u2013518, (2021)"},{"key":"941_CR46","doi-asserted-by":"publisher","first-page":"58","DOI":"10.1016\/j.ins.2022.11.084","volume":"621","author":"Z Xia","year":"2023","unstructured":"Xia, Z., Yang, Q., Qiao, Z., Feng, F.: Quorum controlled homomorphic re-encryption for privacy preserving computations in the cloud. Inf. Sci. 621, 58\u201373 (2023)","journal-title":"Inf. Sci."},{"issue":"2","key":"941_CR47","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipm.2022.102880","volume":"59","author":"K Zhao","year":"2022","unstructured":"Zhao, K., Wang, X.A., Yang, B., Tian, Y., Zhang, J.: A privacy preserving homomorphic computing toolkit for predictive computation. Inf. Process. Manag. 59(2), 102880 (2022)","journal-title":"Inf. Process. Manag."}],"container-title":["International Journal of Information Security"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10207-024-00941-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10207-024-00941-w\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10207-024-00941-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,12]],"date-time":"2025-02-12T05:20:49Z","timestamp":1739337649000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10207-024-00941-w"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,11,26]]},"references-count":47,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2025,2]]}},"alternative-id":["941"],"URL":"https:\/\/doi.org\/10.1007\/s10207-024-00941-w","relation":{},"ISSN":["1615-5262","1615-5270"],"issn-type":[{"value":"1615-5262","type":"print"},{"value":"1615-5270","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,11,26]]},"assertion":[{"value":"26 November 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors assert that there are no Conflict of interest, except with regard to the universities and the research institute listed in the affiliations.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}},{"value":"The authors of this article did not conduct any studies involving human participants or animals.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethical approval"}}],"article-number":"30"}}