{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,21]],"date-time":"2026-02-21T10:05:20Z","timestamp":1771668320167,"version":"3.50.1"},"reference-count":41,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2022,12,30]],"date-time":"2022-12-30T00:00:00Z","timestamp":1672358400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2022,12,30]],"date-time":"2022-12-30T00:00:00Z","timestamp":1672358400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100001691","name":"Japan Society for the Promotion of Science","doi-asserted-by":"publisher","award":["19H01109"],"award-info":[{"award-number":["19H01109"]}],"id":[{"id":"10.13039\/501100001691","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001691","name":"Japan Society for the Promotion of Science","doi-asserted-by":"publisher","award":["19H01109"],"award-info":[{"award-number":["19H01109"]}],"id":[{"id":"10.13039\/501100001691","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001691","name":"Japan Society for the Promotion of Science","doi-asserted-by":"publisher","award":["19H01109"],"award-info":[{"award-number":["19H01109"]}],"id":[{"id":"10.13039\/501100001691","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001691","name":"Japan Society for the Promotion of Science","doi-asserted-by":"publisher","award":["19H01109"],"award-info":[{"award-number":["19H01109"]}],"id":[{"id":"10.13039\/501100001691","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Des. Codes Cryptogr."],"published-print":{"date-parts":[[2023,5]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>In this paper, we construct multi-key homomorphic and fully homomorphic encryption (resp. MKHE and MKFHE) schemes with malicious circuit privacy. Our schemes are based on learning with errors (LWE) besides appropriate circular security assumptions. In contrast, the previous maliciously circuit-private MKFHE scheme by Chongchitmate and Ostrovsky (PKC, 2017) is based on the non-standard decisional small polynomial ratio (DSPR) assumption with a super-polynomial modulus, besides ring learning with errors and circular security assumptions. We note that it was shown by Albrecht et al. (CRYPTO, 2016) that there exists a sub-exponential time attack against this type of DSPR assumption. The main building block of our maliciously circuit-private MKFHE scheme is a (plain) MKFHE scheme by Brakerski et al. (TCC, 2017), and the security of our schemes is proven under the hardness of LWE with sub-exponential modulus-to-noise ratio and circular security assumptions related to the Brakerski et al. scheme. Furthermore, based on our MKFHE schemes, we construct four-round multi-party computation (MPC) protocols with circuit privacy against a semi-honest server and malicious clients in the plain model. The protocols are obtained by combining our schemes with a maliciously sender-private oblivious transfer protocol and a circuit garbling scheme, all of which can be instantiated only assuming LWE.<\/jats:p>","DOI":"10.1007\/s10623-022-01160-x","type":"journal-article","created":{"date-parts":[[2022,12,30]],"date-time":"2022-12-30T10:12:20Z","timestamp":1672395140000},"page":"1645-1684","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Maliciously circuit-private multi-key FHE and MPC based on LWE"],"prefix":"10.1007","volume":"91","author":[{"given":"Nuttapong","family":"Attrapadung","sequence":"first","affiliation":[]},{"given":"Goichiro","family":"Hanaoka","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1273-766X","authenticated-orcid":false,"given":"Ryo","family":"Hiromasa","sequence":"additional","affiliation":[]},{"given":"Takahiro","family":"Matsuda","sequence":"additional","affiliation":[]},{"given":"Jacob C. N.","family":"Schuldt","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,12,30]]},"reference":[{"key":"1160_CR1","doi-asserted-by":"publisher","unstructured":"Albrecht M.R., Bai S., Ducas L.: A subfield lattice attack on overstretched NTRU assumptions - cryptanalysis of some FHE and graded encoding schemes. In: Robshaw M., Katz J. (eds.) CRYPTO\u00a02016, Part\u00a0I, volume 9814 of LNCS, pp.\u00a0153\u2013178, Santa Barbara, CA, USA, August\u00a014\u201318 (2016). Springer, Heidelberg, Germany. https:\/\/doi.org\/10.1007\/978-3-662-53018-4_6.","DOI":"10.1007\/978-3-662-53018-4_6"},{"key":"1160_CR2","doi-asserted-by":"crossref","unstructured":"Ananth P., Jain A., Jin Z., Malavolta G.: Multi-key fully-homomorphic encryption in the plain model. In TCC 2020, (2020).","DOI":"10.1007\/978-3-030-64375-1_2"},{"key":"1160_CR3","unstructured":"Badrinarayanan S., Jain A., Manohar N., Sahai A.: Threshold multi-key FHE and applications to round-optimal MPC. Cryptology ePrint Archive, Report 2018\/580 (2018). https:\/\/eprint.iacr.org\/2018\/580\/20190529:195715."},{"key":"1160_CR4","doi-asserted-by":"publisher","unstructured":"Barrington D.A. Mix.: Bounded-width polynomial-size branching programs recognize exactly those languages in $$\\text{NC}^1$$. In: 18th ACM STOC, pp. 1\u20135, Berkeley, CA, USA, May\u00a028\u201330, (1986). ACM Press. https:\/\/doi.org\/10.1145\/12130.12131.","DOI":"10.1145\/12130.12131"},{"key":"1160_CR5","doi-asserted-by":"publisher","unstructured":"Beaver D., Micali S., Rogaway P.: The round complexity of secure protocols (extended abstract). In: 22nd ACM STOC, pp.\u00a0503\u2013513, Baltimore, MD, USA, May\u00a014\u201316, (1990). ACM Press. https:\/\/doi.org\/10.1145\/100216.100287.","DOI":"10.1145\/100216.100287"},{"key":"1160_CR6","doi-asserted-by":"publisher","unstructured":"Ben-Or M., Goldwasser S., Wigderson A.: Completeness theorems for non-cryptographic fault-tolerant distributed computation (extended abstract). In: 20th ACM STOC, pp.\u00a01\u201310, Chicago, IL, USA, May\u00a02\u20134 (1988). ACM Press. https:\/\/doi.org\/10.1145\/62212.62213.","DOI":"10.1145\/62212.62213"},{"key":"1160_CR7","doi-asserted-by":"publisher","unstructured":"Bendlin R., Damg\u00e5rd I., Orlandi C., Zakarias S.: Semi-homomorphic encryption and multiparty computation. In: Paterson K.G. (Ed.) EUROCRYPT\u00a02011, volume 6632 of LNCS, pp.\u00a0169\u2013188, Tallinn, Estonia, May\u00a015\u201319 (2011). Springer, Heidelberg. https:\/\/doi.org\/10.1007\/978-3-642-20465-4_11.","DOI":"10.1007\/978-3-642-20465-4_11"},{"key":"1160_CR8","doi-asserted-by":"publisher","unstructured":"Brakerski Z.: Fully homomorphic encryption without modulus switching from classical GapSVP. In: Reihaneh S.-N., Ran C. (eds.) CRYPTO\u00a02012, volume 7417 of LNCS, pp.\u00a0868\u2013886, Santa Barbara, CA, USA, August\u00a019\u201323 (2012). Springer, Heidelberg. https:\/\/doi.org\/10.1007\/978-3-642-32009-5_50.","DOI":"10.1007\/978-3-642-32009-5_50"},{"key":"1160_CR9","doi-asserted-by":"publisher","unstructured":"Brakerski Z., D\u00f6ttling, N.: Two-message statistically sender-private OT from LWE. In: Beimel A., Dziembowski S. (eds.) TCC\u00a02018, Part\u00a0II, volume 11240 of LNCS, pages 370\u2013390, Panaji, India, November\u00a011\u201314 (2018). Springer, Heidelberg, Germany. https:\/\/doi.org\/10.1007\/978-3-030-03810-6_14.","DOI":"10.1007\/978-3-030-03810-6_14"},{"key":"1160_CR10","doi-asserted-by":"publisher","unstructured":"Brakerski Z., Perlman R.: Lattice-based fully dynamic multi-key FHE with short ciphertexts. In: Robshaw M., Katz J. (eds.) CRYPTO\u00a02016, Part\u00a0I, volume 9814 of LNCS, pp.\u00a0190\u2013213, Santa Barbara, CA, USA, August\u00a014\u201318 (2016). Springer, Heidelberg, Germany. https:\/\/doi.org\/10.1007\/978-3-662-53018-4_8.","DOI":"10.1007\/978-3-662-53018-4_8"},{"key":"1160_CR11","doi-asserted-by":"publisher","unstructured":"Brakerski Z., Vaikuntanathan V.: Fully homomorphic encryption from ring-LWE and security for key dependent messages. In: Rogaway P. (ed.) CRYPTO\u00a02011, volume 6841 of LNCS, pp.\u00a0505\u2013524, Santa Barbara, CA, USA, August\u00a014\u201318 (2011a). Springer, Heidelberg. https:\/\/doi.org\/10.1007\/978-3-642-22792-9_29.","DOI":"10.1007\/978-3-642-22792-9_29"},{"key":"1160_CR12","doi-asserted-by":"publisher","unstructured":"Brakerski Z., Vaikuntanathan V.: Efficient fully homomorphic encryption from (standard) LWE. In: Ostrovsky R. (ed.) 52nd FOCS, pp.\u00a097\u2013106, Palm Springs, CA, USA, October\u00a022\u201325 (2011b). IEEE Computer Society Press. https:\/\/doi.org\/10.1109\/FOCS.2011.12.","DOI":"10.1109\/FOCS.2011.12"},{"key":"1160_CR13","doi-asserted-by":"publisher","unstructured":"Brakerski Z., Gentry C., Vaikuntanathan V.: (Leveled) fully homomorphic encryption without bootstrapping. In Goldwasser S (ed.) ITCS 2012, pp.\u00a0309\u2013325, Cambridge, MA, USA, January\u00a08\u201310 (2012). ACM. https:\/\/doi.org\/10.1145\/2090236.2090262.","DOI":"10.1145\/2090236.2090262"},{"key":"1160_CR14","doi-asserted-by":"publisher","unstructured":"Brakerski Z., Vaikuntanathan V., Wee H., Wichs D.: Obfuscating conjunctions under entropic ring LWE. In Sudan M (ed.) ITCS 2016, pp.\u00a0147\u2013156, Cambridge, MA, USA, January\u00a014\u201316 (2016). ACM. https:\/\/doi.org\/10.1145\/2840728.2840764.","DOI":"10.1145\/2840728.2840764"},{"key":"1160_CR15","doi-asserted-by":"publisher","unstructured":"Brakerski Z., Halevi S., Polychroniadou A.: Four round secure computation without setup. In: Kalai Y., Reyzin L. (eds.) TCC\u00a02017, Part\u00a0I, volume 10677 of LNCS, pp.\u00a0645\u2013677, Baltimore, MD, USA, November\u00a012\u201315 (2017). Springer, Heidelberg, Germany. https:\/\/doi.org\/10.1007\/978-3-319-70500-2_22.","DOI":"10.1007\/978-3-319-70500-2_22"},{"key":"1160_CR16","unstructured":"Chongchitmate W., Ostrovsky R.: Circuit-private multi-key FHE. Cryptology ePrint Archive, Report 2017\/010 (2017a). http:\/\/eprint.iacr.org\/2017\/010."},{"key":"1160_CR17","doi-asserted-by":"publisher","unstructured":"Chongchitmate W., Ostrovsky R.: Circuit-private multi-key FHE. In Fehr S. (ed.) PKC\u00a02017, Part\u00a0II, volume 10175 of LNCS, pp.\u00a0241\u2013270, Amsterdam, The Netherlands, March\u00a028\u201331 (2017b). Springer, Heidelberg. https:\/\/doi.org\/10.1007\/978-3-662-54388-7_9.","DOI":"10.1007\/978-3-662-54388-7_9"},{"key":"1160_CR18","doi-asserted-by":"publisher","unstructured":"Clear M., McGoldrick C.: Multi-identity and multi-key leveled FHE from learning with errors. In Gennaro R., Robshaw M.J.B. (eds.) CRYPTO\u00a02015, Part\u00a0II, volume 9216 of LNCS, pp.\u00a0630\u2013656, Santa Barbara, CA, USA, August\u00a016\u201320 (2015). Springer, Heidelberg, Germany. https:\/\/doi.org\/10.1007\/978-3-662-48000-7_31.","DOI":"10.1007\/978-3-662-48000-7_31"},{"key":"1160_CR19","doi-asserted-by":"publisher","unstructured":"Damg\u00e5rd I., Pastro V., Smart N.P., Zakarias S.: Multiparty computation from somewhat homomorphic encryption. In: Safavi-Naini R., Canetti R. (eds.) CRYPTO\u00a02012, volume 7417 of LNCS, pp.\u00a0643\u2013662, Santa Barbara, CA, USA, August\u00a019\u201323 (2012). Springer, Heidelberg, Germany. https:\/\/doi.org\/10.1007\/978-3-642-32009-5_38.","DOI":"10.1007\/978-3-642-32009-5_38"},{"key":"1160_CR20","doi-asserted-by":"crossref","unstructured":"Demmler D., Schneider T., Zohner M.: ABY\u2014A framework for efficient mixed-protocol secure two-party computation. In NDSS\u00a02015, San Diego, CA, USA, February\u00a08\u201311 (2015). The Internet Society.","DOI":"10.14722\/ndss.2015.23113"},{"key":"1160_CR21","unstructured":"Gentry C.: A Fully Homomorphic Encryption Scheme. PhD thesis, Stanford University, Available at http:\/\/crypto.stanford.edu\/craig (2009a)."},{"key":"1160_CR22","doi-asserted-by":"publisher","unstructured":"Gentry C.: Fully homomorphic encryption using ideal lattices. In Mitzenmacher M. (ed.) 41st ACM STOC, pp.\u00a0169\u2013178, Bethesda, MD, USA, May\u00a031\u2013June\u00a02 (2009b). ACM Press. https:\/\/doi.org\/10.1145\/1536414.1536440.","DOI":"10.1145\/1536414.1536440"},{"key":"1160_CR23","doi-asserted-by":"publisher","unstructured":"Gentry C., Sahai A., Waters B.: Homomorphic encryption from learning with errors: Conceptually-simpler, asymptotically-faster, attribute-based. In: Canetti R., Garay J.A. (eds) CRYPTO\u00a02013, Part\u00a0I, volume 8042 of LNCS, pages 75\u201392, Santa Barbara, CA, USA, August\u00a018\u201322 (2013). Springer, Heidelberg, Germany. https:\/\/doi.org\/10.1007\/978-3-642-40041-4_5.","DOI":"10.1007\/978-3-642-40041-4_5"},{"key":"1160_CR24","doi-asserted-by":"publisher","unstructured":"Goldreich O., Micali S., Wigderson A.: How to play any mental game or A completeness theorem for protocols with honest majority. In: Aho A (ed.) 19th ACM STOC, pp.\u00a0218\u2013229, New York City, NY, USA, May\u00a025\u201327 (1987). ACM Press. https:\/\/doi.org\/10.1145\/28395.28420.","DOI":"10.1145\/28395.28420"},{"key":"1160_CR25","unstructured":"Goldwasser S., Kalai Y.T., Peikert C., Vaikuntanathan V.: Robustness of the learning with errors assumption. In Yao A.C.-C. (ed.) ICS 2010, pp.\u00a0230\u2013240, Tsinghua University, Beijing, China, January\u00a05\u20137 (2010). Tsinghua University Press."},{"key":"1160_CR26","doi-asserted-by":"publisher","unstructured":"Hazay C., Scholl P., Soria-Vazquez E.: Low cost constant round MPC combining BMR and oblivious transfer. In Takagi T., Peyrin T. (eds.) ASIACRYPT\u00a02017, Part\u00a0I, volume 10624 of LNCS, pages 598\u2013628, Hong Kong, China, December\u00a03\u20137 (2017). Springer, Heidelberg, Germany. https:\/\/doi.org\/10.1007\/978-3-319-70694-8_21.","DOI":"10.1007\/978-3-319-70694-8_21"},{"key":"1160_CR27","doi-asserted-by":"publisher","unstructured":"Ishai Y., Kushilevitz E.: Perfect constant-round secure computation via perfect randomizing polynomials. In: Widmayer P., Ruiz F.T., Bueno R.M., Hennessy M., Eidenbenz S., Conejo R. (eds.) editors, ICALP 2002, volume 2380 of LNCS, pp.\u00a0244\u2013256, Malaga, Spain, July\u00a08\u201313 (2002). Springer, Heidelberg, Germany. https:\/\/doi.org\/10.1007\/3-540-45465-9_22.","DOI":"10.1007\/3-540-45465-9_22"},{"key":"1160_CR28","doi-asserted-by":"publisher","unstructured":"Ishai Y., Paskin A.: Evaluating branching programs on encrypted data. In Vadhan S.P. (ed.) TCC\u00a02007, volume 4392 of LNCS, pp.\u00a0575\u2013594, Amsterdam, The Netherlands, February\u00a021\u201324 (2007). Springer, Heidelberg, Germany. https:\/\/doi.org\/10.1007\/978-3-540-70936-7_31.","DOI":"10.1007\/978-3-540-70936-7_31"},{"key":"1160_CR29","unstructured":"Kamara S.., Mohassel P., Raykova M.: Outsourcing multi-party computation. Cryptology ePrint Archive, Report 2011\/272 (2011). http:\/\/eprint.iacr.org\/2011\/272."},{"key":"1160_CR30","doi-asserted-by":"publisher","unstructured":"Lindell Y., Smart N.P., Soria-Vazquez E.: More efficient constant-round multi-party computation from BMR and SHE. In: Hirt M., Smith A.D. (eds.) TCC\u00a02016-B, Part\u00a0I, volume 9985 of LNCS, pages 554\u2013581, Beijing, China, October\u00a031\u00a0\u2013\u00a0November\u00a03 (2016). Springer, Heidelberg, Germany. https:\/\/doi.org\/10.1007\/978-3-662-53641-4_21.","DOI":"10.1007\/978-3-662-53641-4_21"},{"key":"1160_CR31","doi-asserted-by":"publisher","unstructured":"L\u00f3pez-Alt A., Tromer E., Vaikuntanathan V.: On-the-fly multiparty computation on the cloud via multikey fully homomorphic encryption. In Karloff H.J., Pitassi T. (eds.) 44th ACM STOC, pages 1219\u20131234, New York, NY, USA, May\u00a019\u201322 (2012). ACM Press. https:\/\/doi.org\/10.1145\/2213977.2214086.","DOI":"10.1145\/2213977.2214086"},{"key":"1160_CR32","doi-asserted-by":"publisher","unstructured":"Mohassel P., Rindal P.: ABY$$^3$$: A mixed protocol framework for machine learning. In: Lie D., Mannan M., Backes M., Wang X.F. (eds.) ACM CCS 2018, pp.\u00a035\u201352, Toronto, ON, Canada, October\u00a015\u201319 (2018). ACM Press. https:\/\/doi.org\/10.1145\/3243734.3243760.","DOI":"10.1145\/3243734.3243760"},{"key":"1160_CR33","doi-asserted-by":"publisher","unstructured":"Mohassel P., Sadeghian S.S.: How to hide circuits in MPC an efficient framework for private function evaluation. In Johansson T., Nguyen P.Q. (eds.) EUROCRYPT\u00a02013, volume 7881 of LNCS, pp.\u00a0557\u2013574, Athens, Greece, May\u00a026\u201330 (2013). Springer, Heidelberg, Germany. https:\/\/doi.org\/10.1007\/978-3-642-38348-9_33.","DOI":"10.1007\/978-3-642-38348-9_33"},{"key":"1160_CR34","doi-asserted-by":"publisher","unstructured":"Mohassel P., Sadeghian S.S., Smart N.P.: Actively secure private function evaluation. In Sarkar P., Iwata T. (eds.) ASIACRYPT\u00a02014, Part\u00a0II, volume 8874 of LNCS, pp.\u00a0486\u2013505, Kaoshiung, Taiwan, R.O.C., December\u00a07\u201311 (2014). Springer, Heidelberg, Germany. https:\/\/doi.org\/10.1007\/978-3-662-45608-8_26.","DOI":"10.1007\/978-3-662-45608-8_26"},{"key":"1160_CR35","doi-asserted-by":"publisher","unstructured":"Mukherjee P., Wichs D.: Two round multiparty computation via multi-key FHE. In: Fischlin M., Coron J.-S. (eds.) EUROCRYPT\u00a02016, Part\u00a0II, volume 9666 of LNCS, pp.\u00a0735\u2013763, Vienna, Austria, May\u00a08\u201312 (2016). Springer, Heidelberg, Germany. https:\/\/doi.org\/10.1007\/978-3-662-49896-5_26.","DOI":"10.1007\/978-3-662-49896-5_26"},{"key":"1160_CR36","doi-asserted-by":"publisher","unstructured":"Ostrovsky R., Paskin-Cherniavsky A., Paskin-Cherniavsky B.: Maliciously circuit-private FHE. In Juan\u00a0A. Garay and Rosario Gennaro, editors, CRYPTO\u00a02014, Part\u00a0I, volume 8616 of LNCS, pp.\u00a0536\u2013553, Santa Barbara, CA, USA, August\u00a017\u201321 (2014). Springer, Heidelberg, Germany. https:\/\/doi.org\/10.1007\/978-3-662-44371-2_30.","DOI":"10.1007\/978-3-662-44371-2_30"},{"key":"1160_CR37","doi-asserted-by":"publisher","unstructured":"Raz R.: Elusive functions and lower bounds for arithmetic circuits. In Ladner R.E., Dwork C. (eds.) 40th ACM STOC, pp.\u00a0711\u2013720, Victoria, BC, Canada, May\u00a017\u201320 (2008). ACM Press. https:\/\/doi.org\/10.1145\/1374376.1374479.","DOI":"10.1145\/1374376.1374479"},{"key":"1160_CR38","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.\u00a084\u201393, Baltimore, MA, USA, May\u00a022\u201324 (2005). ACM Press. https:\/\/doi.org\/10.1145\/1060590.1060603.","DOI":"10.1145\/1060590.1060603"},{"key":"1160_CR39","doi-asserted-by":"publisher","unstructured":"Valiant L.G.: Universal circuits (preliminary report). In Chandra A.K., Wotschke D., Friedman E.P., Harrisonl M.A. (eds.) 8th ACM STOC, pp.\u00a0196\u2013203, New York, NY, USA, May 3\u20135 (1976). https:\/\/doi.org\/10.1145\/800113.803649.","DOI":"10.1145\/800113.803649"},{"key":"1160_CR40","doi-asserted-by":"publisher","unstructured":"van Dijk M., Gentry C., Halevi S., Vaikuntanathan V.: Fully homomorphic encryption over the integers. In Gilbert H (ed.) EUROCRYPT\u00a02010, volume 6110 of LNCS, pp.\u00a024\u201343, French Riviera, May\u00a030\u2013June\u00a03 (2010). Springer, Heidelberg, Germany. https:\/\/doi.org\/10.1007\/978-3-642-13190-5_2.","DOI":"10.1007\/978-3-642-13190-5_2"},{"key":"1160_CR41","doi-asserted-by":"publisher","unstructured":"Yao A.C.-C.: How to generate and exchange secrets (extended abstract). In: 27th FOCS, pp.\u00a0162\u2013167, Toronto, Ontario, Canada, October\u00a027\u201329 (1986). IEEE Computer Society Press. https:\/\/doi.org\/10.1109\/SFCS.1986.25.","DOI":"10.1109\/SFCS.1986.25"}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-022-01160-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10623-022-01160-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-022-01160-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,4,20]],"date-time":"2023-04-20T20:06:47Z","timestamp":1682021207000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10623-022-01160-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,12,30]]},"references-count":41,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2023,5]]}},"alternative-id":["1160"],"URL":"https:\/\/doi.org\/10.1007\/s10623-022-01160-x","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"value":"0925-1022","type":"print"},{"value":"1573-7586","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,12,30]]},"assertion":[{"value":"11 October 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"30 November 2022","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"2 December 2022","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"30 December 2022","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"Not applicable.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest\/Competing interests"}},{"value":"Not applicable.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Code availability"}}]}}