{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,1]],"date-time":"2025-12-01T11:28:32Z","timestamp":1764588512307},"reference-count":48,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2024,1,22]],"date-time":"2024-01-22T00:00:00Z","timestamp":1705881600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2024,1,22]],"date-time":"2024-01-22T00:00:00Z","timestamp":1705881600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"crossref","award":["61962009","61962009","61962009","61962009","61962009"],"award-info":[{"award-number":["61962009","61962009","61962009","61962009","61962009"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"name":"Top Technology Talent Project from Guizhou Education Department","award":["[2022]073","[2022]073","[2022]073","[2022]073","[2022]073"],"award-info":[{"award-number":["[2022]073","[2022]073","[2022]073","[2022]073","[2022]073"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Cloud Comp"],"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Cloud computing has data leakage from all parties, security protection of private data, and existing solutions do not provide a trade-off between security and overhead. With distributed data communication due to data barriers, information interaction security and data computation security have become challenges for secure computing. Combining cloud computing with secure multiparty computation can provide a higher level of data protection while maintaining the benefits of cloud computing. In this case, data can be stored in the cloud and computed through SMPC protocols, thus protecting the privacy and security of the data. However, multiple rounds of information interaction are often required, increasing the communication overhead, and the security strength is limited by the hardness assumption. In this paper, we work to achieve an optimal setting of the number of rounds in secure multi-party computation on the cloud to achieve a sublinear communication overhead and improve the security concept. A 2-round SMPC protocol is constructed in the framework of Universally Composable (UC). A 2-round SMPC protocol is constructed that uses multilinear maps based on the Learning from Errors (LWE) assumption. The participant encodes the input and sends it via broadcast to reduce the interaction, homomorphic computational encoding information for secure access to computational data and secure the SMPC protocol through UC security. This paper extends the participants to multiple parties, reduces the communication rounds to 2, the protocol achieves sublinear communication overhead in <jats:italic>poly<\/jats:italic> polynomial time, smaller setup size to <jats:italic>poly<\/jats:italic>(<jats:italic>k<\/jats:italic>), and static security is achieved.<\/jats:p>","DOI":"10.1186\/s13677-023-00586-5","type":"journal-article","created":{"date-parts":[[2024,1,22]],"date-time":"2024-01-22T14:02:36Z","timestamp":1705932156000},"update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["Cloud-SMPC: two-round multilinear maps secure multiparty computation based on LWE assumption"],"prefix":"10.1186","volume":"13","author":[{"given":"Yun","family":"Luo","sequence":"first","affiliation":[]},{"given":"Yuling","family":"Chen","sequence":"additional","affiliation":[]},{"given":"Tao","family":"Li","sequence":"additional","affiliation":[]},{"given":"Chaoyue","family":"Tan","sequence":"additional","affiliation":[]},{"given":"Hui","family":"Dou","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,1,22]]},"reference":[{"key":"586_CR1","doi-asserted-by":"publisher","first-page":"14988","DOI":"10.1109\/JIOT.2021.3077937","volume":"9","author":"X Zhou","year":"2021","unstructured":"Zhou X, He Yang X, Ma J, Wang KIK (2021) Energy-efficient smart routing based on link correlation mining for wireless edge computing in iot. IEEE Internet Things J 9:14988\u201314997","journal-title":"IEEE Internet Things J"},{"key":"586_CR2","doi-asserted-by":"publisher","first-page":"3295","DOI":"10.1109\/JIOT.2022.3179231","volume":"10","author":"X Zhou","year":"2023","unstructured":"Zhou X, Liang W, Yan K, Li W, Wang KIK, Ma J, Jin Q (2023) Edge-enabled two-stage scheduling based on deep reinforcement learning for internet of everything. IEEE Internet Things J 10:3295\u20133304","journal-title":"IEEE Internet Things J"},{"key":"586_CR3","doi-asserted-by":"crossref","unstructured":"He Q, Tan S, Chen F, Xu X, Qi L, Hei X, Zomaya A, Jin H, Yang Y (2023) Edindex: Enabling fast data queries in edge storage systems. ACM SIGIR 675\u2013685","DOI":"10.1145\/3539618.3591676"},{"key":"586_CR4","unstructured":"Yuan L, He Q, Chen F, Zhang J, Qi L, Xu X, Xiang Y, Yang Y (2021) Csedge: Enabling collaborative edge storage for multi-access edge computing based on blockchain. IEEE Trans Parallel Distrib Syst PP:1\u20131"},{"key":"586_CR5","doi-asserted-by":"publisher","first-page":"6503","DOI":"10.1109\/TII.2021.3139363","volume":"18","author":"L Qi","year":"2022","unstructured":"Qi L, Yang Y, Zhou X, Rafique W, Ma J (2022) Fast anomaly identification based on multiaspect data streams for intelligent intrusion detection toward secure industry 4.0. IEEE Trans Ind Inform 18:6503\u20136511","journal-title":"IEEE Trans Ind Inform"},{"key":"586_CR6","doi-asserted-by":"publisher","first-page":"12588","DOI":"10.1109\/JIOT.2021.3077449","volume":"8","author":"X Zhou","year":"2021","unstructured":"Zhou X, Xu X, Liang W, Zeng Z, Yan Z (2021) Deep-learning-enhanced multitarget detection for end-edge-cloud surveillance in smart iot. IEEE Internet Things J 8:12588\u201312596","journal-title":"IEEE Internet Things J"},{"key":"586_CR7","doi-asserted-by":"crossref","unstructured":"Qi L, Lin W, Zhang X, Dou W, Xu X, Chen J (2022) A correlation graph based approach for personalized and compatible web apis recommendation in mobile app development. IEEE Trans Knowl Data Eng 35:5444\u20135457","DOI":"10.1109\/TKDE.2022.3168611"},{"key":"586_CR8","doi-asserted-by":"publisher","first-page":"771","DOI":"10.1109\/TCSS.2022.3168595","volume":"10","author":"S Wu","year":"2023","unstructured":"Wu S, Shen S, Xu X, Chen Y, Zhou X, Liu D, Xue X, Qi L (2023) Popularity-aware and diverse web apis recommendation based on correlation graph. IEEE Trans Comput Soc Syst 10:771\u2013782","journal-title":"IEEE Trans Comput Soc Syst"},{"key":"586_CR9","doi-asserted-by":"crossref","unstructured":"Li Z, Xu X, Hang T, Xiang H, Cui Y, Qi L, Zhou X (2022) A knowledge-driven anomaly detection framework for social production system. IEEE Trans Comput Soc Syst 1\u201314","DOI":"10.1109\/TCSS.2022.3217790"},{"key":"586_CR10","doi-asserted-by":"crossref","unstructured":"Dai H, Yu J, Li M, Wang W, Liu AX, Ma J, Qi L, Chen G (2022) Bloom filter with noisy coding framework for multi-set membership testing. IEEE Trans Knowl Data Eng 35:6710\u20136724","DOI":"10.1109\/TKDE.2022.3199646"},{"key":"586_CR11","doi-asserted-by":"publisher","first-page":"5485","DOI":"10.1109\/TII.2022.3190380","volume":"19","author":"X Xu","year":"2023","unstructured":"Xu X, Gu JF, Yan H, Liu W, Qi L, Zhou X (2023) Reputation-aware supplier assessment for blockchain-enabled supply chain in industry 4.0. IEEE Trans Ind Inf 19:5485\u20135494","journal-title":"IEEE Trans Ind Inf"},{"key":"586_CR12","doi-asserted-by":"publisher","first-page":"2629","DOI":"10.1109\/TII.2018.2789442","volume":"14","author":"R Chaudhary","year":"2018","unstructured":"Chaudhary R, Aujla GS, Garg S, Kumar N, Rodrigues JJ (2018) Sdn-enabled multi-attribute-based secure communication for smart grid in iiot environment. IEEE Trans Ind Inform 14:2629\u20132640","journal-title":"IEEE Trans Ind Inform"},{"key":"586_CR13","doi-asserted-by":"publisher","first-page":"1","DOI":"10.4018\/JOEUC.306752","volume":"34","author":"Y Luo","year":"2022","unstructured":"Luo Y, Chen Y, Li T, Wang Y, Yang Y, Yu X (2022) An entropy-view secure multiparty computation protocol based on semi-honest model. J Organ End User Comput 34:1\u201317","journal-title":"J Organ End User Comput"},{"key":"586_CR14","doi-asserted-by":"publisher","first-page":"3596","DOI":"10.1002\/int.22428","volume":"36","author":"T Li","year":"2021","unstructured":"Li T, Wang Z, Yang G, Cui Y, Chen Y, Yu X (2021) Semi-selfish mining based on hidden markov decision process. Int J Intell Syst 36:3596\u20133612","journal-title":"Int J Intell Syst"},{"issue":"1\u20138839047","key":"586_CR15","first-page":"11","volume":"8839047","author":"T Li","year":"2020","unstructured":"Li T, Chen Y, Wang Y, Wang Y, Zhao M, Zhu H, Tian Y, Yu X (2020) Yang Y (2020) Rational protocols and attacks in blockchain system. Secur Commun Netw 8839047(1\u20138839047):11","journal-title":"Secur Commun Netw"},{"key":"586_CR16","doi-asserted-by":"crossref","unstructured":"Sun J, Chen Y, Li T, Liu J, Yang Y (2021) Psspr: A source location privacy protection scheme based on sector phantom routing in wsns. In: 2021 IEEE Intl Conf on Dependable, Autonomic and Secure Computing, Intl Conf on Pervasive Intelligence and Computing, Intl Conf on Cloud and Big Data Computing, Intl Conf on Cyber Science and Technology Congress (DASC\/PiCom\/CBDCom\/CyberSciTech), AB, Canada, p 334\u2013340","DOI":"10.1109\/DASC-PICom-CBDCom-CyberSciTech52372.2021.00064"},{"key":"586_CR17","doi-asserted-by":"publisher","first-page":"10576","DOI":"10.1002\/int.22656","volume":"37","author":"T Li","year":"2021","unstructured":"Li T, Wang Z, Chen Y, Li C, Jia Y, Yang Y (2021) Is semi-selfish mining available without being detected? Int J Intell Syst 37:10576\u201310597","journal-title":"Int J Intell Syst"},{"key":"586_CR18","doi-asserted-by":"publisher","first-page":"11078","DOI":"10.1002\/int.23033","volume":"37","author":"Y Wang","year":"2022","unstructured":"Wang Y, Li T, Liu M, Li C, Wang H (2022) Stsiiml: Study on token shuffling under incomplete information based on machine learning. Int J Intell Syst 37:11078\u201311100","journal-title":"Int J Intell Syst"},{"key":"586_CR19","doi-asserted-by":"publisher","first-page":"357","DOI":"10.1016\/j.ins.2018.10.024","volume":"476","author":"C Zhao","year":"2019","unstructured":"Zhao C, Zhao S, Zhao M, Chen Z, Gao CZ, Li H, Tan YA (2019) Secure multi-party computation: Theory, practice and applications. Inf Sci 476:357\u2013372","journal-title":"Inf Sci"},{"key":"586_CR20","doi-asserted-by":"crossref","unstructured":"Yao ACC (1982) Protocols for secure computations. In: 23rd Annual Symposium on Foundations of Computer Science (sfcs 1982), Chicago, IL, USA, pp 160\u2013164","DOI":"10.1109\/SFCS.1982.38"},{"key":"586_CR21","doi-asserted-by":"crossref","unstructured":"Goldreich O, Micali S, Wigderson A (1987) How to play any mental game. In: Proceedings of the nineteenth annual ACM symposium on Theory of computing, New York, NY, United States pp 218\u2013229","DOI":"10.1145\/28395.28420"},{"key":"586_CR22","doi-asserted-by":"crossref","unstructured":"Abraham I, Asharov G, Yanai A (2022) Efficient perfectly secure computation with optimal resilience. J Cryptol 35:66\u201396","DOI":"10.1007\/978-3-030-90453-1_3"},{"key":"586_CR23","doi-asserted-by":"crossref","unstructured":"Ananth PV, Choudhuri AR, Jain A (2017) A new approach to round-optimal secure multiparty computation. In: Katz, J., Shacham, H. (eds) Advances in Cryptology \u2013 CRYPTO 2017. CRYPTO 2017. Lecture Notes in Computer Science(), Springer, Cham, vol 10401, pp 468\u2013499","DOI":"10.1007\/978-3-319-63688-7_16"},{"key":"586_CR24","doi-asserted-by":"crossref","unstructured":"Ananth PV, Choudhuri AR, Goel A, Jain A (2018) Round-optimal secure multiparty computation with honest majority.  In: Shacham, H., Boldyreva, A. (eds) Advances in Cryptology \u2013 CRYPTO 2018. CRYPTO 2018. Lecture Notes in Computer Science(),  Springer, Cham, vol 10992, pp 395\u2013424","DOI":"10.1007\/978-3-319-96881-0_14"},{"key":"586_CR25","first-page":"828","volume":"2020 12106","author":"R Cohen","year":"2020","unstructured":"Cohen R, Garay JA, Zikas V (2020) Broadcast-optimal two-round mpc. Adv Cryptol EUROCRYPT 2020 12106:828\u2013858","journal-title":"Adv Cryptol EUROCRYPT"},{"key":"586_CR26","doi-asserted-by":"crossref","unstructured":"Quach W, Wee H, Wichs D (2018) Laconic function evaluation and applications. In: 2018 IEEE 59th Annual Symposium on Foundations of Computer Science (FOCS), Paris, France,  pp 859\u2013870","DOI":"10.1109\/FOCS.2018.00086"},{"key":"586_CR27","doi-asserted-by":"crossref","unstructured":"Patra A, Srinivasan A (2021) Three-round secure multiparty computation from black-box two-round oblivious transfer.  In: Malkin, T., Peikert, C. (eds) Advances in Cryptology \u2013 CRYPTO 2021. CRYPTO 2021. Lecture Notes in Computer Science(), Springer, Cham, vol 12826, pp 185\u2013213","DOI":"10.1007\/978-3-030-84245-1_7"},{"key":"586_CR28","doi-asserted-by":"crossref","unstructured":"Beaver D, Micali S, Rogaway P (1990) The round complexity of secure protocols. In: Symposium on the Theory of Computing, New York, NY, United States, pp 503\u2013513","DOI":"10.1145\/100216.100287"},{"key":"586_CR29","doi-asserted-by":"crossref","unstructured":"Gordon SD, Liu FH, Shi E (2015) Constant-round mpc with fairness and guarantee of output delivery. In: Gennaro, R., Robshaw, M. (eds) Advances in Cryptology -- CRYPTO 2015. CRYPTO 2015. Lecture Notes in Computer Science(), Springer, Berlin, Heidelberg, vol 9216, pp 63\u201382","DOI":"10.1007\/978-3-662-48000-7_4"},{"key":"586_CR30","first-page":"585","volume":"2016","author":"E Boyle","year":"2016","unstructured":"Boyle E, Gilboa N, Ishai Y (2016) Breaking the circuit size barrier for secure computation under ddh. In: Robshaw, M., Katz, J. (eds) Advances in Cryptology \u2013 CRYPTO 2016. CRYPTO 2016. Lecture Notes in Computer Science(),  Springer, Berlin, Heidelberg,\u00a0vol 9814, pp\u00a0509\u2013539","journal-title":"IACR Cryptol ePrint Arch"},{"key":"586_CR31","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3566048","volume":"69","author":"S Garg","year":"2018","unstructured":"Garg S, Srinivasan A (2018) Two-round multiparty secure computation from minimal assumptions. J ACM 69:1\u201330","journal-title":"J ACM"},{"key":"586_CR32","first-page":"1","volume":"35","author":"C Hazay","year":"2018","unstructured":"Hazay C, Orsini E, Scholl P, Soria-Vazquez E (2018) Tinykeys: A new approach to efficient multi-party computation. J Cryptol 35:1\u201366","journal-title":"J Cryptol"},{"key":"586_CR33","doi-asserted-by":"crossref","unstructured":"Canetti R, Poburinnaya O, Venkitasubramaniam M (2017) Equivocating yao: constant-round adaptively secure multiparty computation in the plain model. In: Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing, New York, NY, United States, pp 497\u2013509","DOI":"10.1145\/3055399.3055495"},{"key":"586_CR34","doi-asserted-by":"publisher","first-page":"5239","DOI":"10.1109\/TIFS.2021.3127023","volume":"16","author":"Y Chen","year":"2021","unstructured":"Chen Y, Dong S, Li T, Wang Y, Zhou H (2021) Dynamic multi-key fhe in asymmetric key setting from lwe. IEEE Trans Inf Forensic Secur 16:5239\u20135249","journal-title":"IEEE Trans Inf Forensic Secur"},{"key":"586_CR35","doi-asserted-by":"crossref","unstructured":"Mukherjee P, Wichs D (2016) Two round multiparty computation via multi-key fhe. In: Fischlin, M., Coron, JS. (eds) Advances in Cryptology \u2013 EUROCRYPT 2016. EUROCRYPT 2016. Lecture Notes in Computer Science(), Springer, Berlin, Heidelberg, vol 9666, pp 735\u2013763","DOI":"10.1007\/978-3-662-49896-5_26"},{"key":"586_CR36","doi-asserted-by":"crossref","unstructured":"Brakerski Z, Halevi S, Polychroniadou A (2017) Four round secure computation without setup. In: Kalai, Y., Reyzin, L. (eds) Theory of Cryptography. TCC 2017. Lecture Notes in Computer Science(),  Springer, Cham, vol 10677, pp 645\u2013677","DOI":"10.1007\/978-3-319-70500-2_22"},{"key":"586_CR37","doi-asserted-by":"crossref","unstructured":"Garg S, Srinivasan A (2017) Garbled protocols and two-round mpc from bilinear maps. 2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS), Berkeley, CA, USA, pp 588\u2013599","DOI":"10.1109\/FOCS.2017.60"},{"key":"586_CR38","first-page":"501","volume":"2011","author":"D Micciancio","year":"2012","unstructured":"Micciancio D, Peikert C (2012) Trapdoors for lattices: Simpler, tighter, faster, smaller. IACR Cryptol ePrint Arch 2011:501","journal-title":"IACR Cryptol ePrint Arch"},{"key":"586_CR39","doi-asserted-by":"crossref","unstructured":"Garg S, Gentry C, Halevi S (2013) Candidate multilinear maps from ideal lattices. In: Johansson, T., Nguyen, P.Q. (eds) Advances in Cryptology \u2013 EUROCRYPT 2013. EUROCRYPT 2013. Lecture Notes in Computer Science, Springer, Berlin, Heidelberg, vol 7881, pp 1\u201317","DOI":"10.1007\/978-3-642-38348-9_1"},{"key":"586_CR40","first-page":"645","volume":"2014","author":"C Gentry","year":"2015","unstructured":"Gentry C, Gorbunov S, Halevi S (2015) Graph-induced multilinear maps from lattices. In: Dodis, Y., Nielsen, J.B. (eds) Theory of Cryptography. TCC 2015. Lecture Notes in Computer Science, Springer, Berlin, Heidelberg,\u00a0vol 9015,\u00a0pp 498\u2013527","journal-title":"IACR Cryptol ePrint Arch"},{"key":"586_CR41","doi-asserted-by":"crossref","unstructured":"Ciampi M, Ostrovsky R, Siniscalchi L, Visconti I (2017) Round-optimal secure two-party computation from trapdoor permutations. In: Kalai, Y., Reyzin, L. (eds) Theory of Cryptography. TCC 2017. Lecture Notes in Computer Science(), Springer, Cham, vol 10677, pp 678\u2013710","DOI":"10.1007\/978-3-319-70500-2_23"},{"key":"586_CR42","doi-asserted-by":"crossref","unstructured":"Dachman-Soled D, Katz J, Rao V (2015) Adaptively secure, universally composable, multiparty computation in constant rounds.  In: Dodis, Y., Nielsen, J.B. (eds) Theory of Cryptography. TCC 2015. Lecture Notes in Computer Science,  Springer, Berlin, Heidelberg, vol 9015, pp 586\u2013613","DOI":"10.1007\/978-3-662-46497-7_23"},{"key":"586_CR43","first-page":"845","volume":"2014","author":"R Canetti","year":"2015","unstructured":"Canetti R, Goldwasser S, Poburinnaya O (2015) Adaptively secure two-party computation from indistinguishability obfuscation. IACR Cryptol ePrint Arch 2014:845","journal-title":"IACR Cryptol ePrint Arch"},{"key":"586_CR44","first-page":"613","volume":"2011","author":"G Asharov","year":"2012","unstructured":"Asharov G, Jain A, L\u00f3pez-Alt A, Tromer E, Vaikuntanathan V, Wichs D (2012) Multiparty computation with low communication, computation and interaction via threshold fhe. IACR Cryptol ePrint Arch 2011:613","journal-title":"IACR Cryptol ePrint Arch"},{"key":"586_CR45","doi-asserted-by":"crossref","unstructured":"Regev O (2005) On lattices, learning with errors, random linear codes, and cryptography. In: Symposium on the Theory of Computing, New York, NY, United States, pp 84\u201393","DOI":"10.1145\/1060590.1060603"},{"key":"586_CR46","doi-asserted-by":"crossref","unstructured":"Cohen R, Shelat A, Wichs D (2019) Adaptively secure mpc with sublinear communication complexity. In: Boldyreva, A., Micciancio, D. (eds) Advances in Cryptology \u2013 CRYPTO 2019. CRYPTO 2019. Lecture Notes in Computer Science(),  Springer, Cham, vol 11693, 30\u201360","DOI":"10.1007\/978-3-030-26951-7_2"},{"key":"586_CR47","doi-asserted-by":"crossref","unstructured":"Canetti R (2001) Universally composable security: a new paradigm for cryptographic protocols. In: Proceedings 2001 IEEE International Conference on Cluster Computing, Newport Beach, CA, USA,  pp 136\u2013145","DOI":"10.1109\/SFCS.2001.959888"},{"key":"586_CR48","doi-asserted-by":"crossref","unstructured":"Hazay C, Venkitasubramaniam M (2016) Composable adaptive secure protocols without setup under polytime assumptions.  In: Hirt, M., Smith, A. (eds) Theory of Cryptography. TCC 2016. Lecture Notes in Computer Science(),  Springer, Berlin, Heidelberg, vol 9985, pp 400\u2013432","DOI":"10.1007\/978-3-662-53641-4_16"}],"container-title":["Journal of Cloud Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1186\/s13677-023-00586-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1186\/s13677-023-00586-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1186\/s13677-023-00586-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,1,22]],"date-time":"2024-01-22T14:11:58Z","timestamp":1705932718000},"score":1,"resource":{"primary":{"URL":"https:\/\/journalofcloudcomputing.springeropen.com\/articles\/10.1186\/s13677-023-00586-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,1,22]]},"references-count":48,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2024,12]]}},"alternative-id":["586"],"URL":"https:\/\/doi.org\/10.1186\/s13677-023-00586-5","relation":{},"ISSN":["2192-113X"],"issn-type":[{"value":"2192-113X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,1,22]]},"assertion":[{"value":"11 April 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"31 December 2023","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 January 2024","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare no competing interests.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}}],"article-number":"22"}}