{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,18]],"date-time":"2025-12-18T09:29:09Z","timestamp":1766050149895,"version":"3.37.3"},"reference-count":52,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2022,10,18]],"date-time":"2022-10-18T00:00:00Z","timestamp":1666051200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,10,18]],"date-time":"2022-10-18T00:00:00Z","timestamp":1666051200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100010418","name":"Institute for Information and Communications Technology Promotion","doi-asserted-by":"publisher","award":["2021-0-00532"],"award-info":[{"award-number":["2021-0-00532"]}],"id":[{"id":"10.13039\/501100010418","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,3]]},"DOI":"10.1007\/s10623-022-01129-w","type":"journal-article","created":{"date-parts":[[2022,10,18]],"date-time":"2022-10-18T10:02:51Z","timestamp":1666087371000},"page":"853-893","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Practical dynamic group signatures without knowledge extractors"],"prefix":"10.1007","volume":"91","author":[{"given":"Hyoseung","family":"Kim","sequence":"first","affiliation":[]},{"given":"Olivier","family":"Sanders","sequence":"additional","affiliation":[]},{"given":"Michel","family":"Abdalla","sequence":"additional","affiliation":[]},{"given":"Jong Hwan","family":"Park","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,10,18]]},"reference":[{"key":"1129_CR1","doi-asserted-by":"crossref","unstructured":"Abdalla M., Fouque P., Lyubashevsky V., Tibouchi M.: Tightly-secure signatures from lossy identification schemes. In: Pointcheval D., Johansson T. (eds.) EUROCRYPT 2012. Lecture Notes in Computer Science, vol. 7237, pp. 572\u2013590. Springer, Heidelberg (2012).","DOI":"10.1007\/978-3-642-29011-4_34"},{"key":"1129_CR2","first-page":"649","volume-title":"CRYPTO 2011. Lecture Notes in Computer Science","author":"M Abe","year":"2011","unstructured":"Abe M., Groth J., Haralambiev K., Ohkubo M.: Optimal structure-preserving signatures in asymmetric bilinear groups. In: CRYPTO 2011. Lecture Notes in Computer Science, vol. 6841, pp. 649\u2013666. Springer, Heidelberg (2011)."},{"key":"1129_CR3","first-page":"257","volume-title":"SCN 2002. Lecture Notes in Computer Science","author":"PSLM Barreto","year":"2003","unstructured":"Barreto P.S.L.M., Lynn B., Scott M.: Constructing elliptic curves with prescribed embedding degrees. In: Cimato S., Galdi C., Persiano G. (eds.) SCN 2002. Lecture Notes in Computer Science, vol. 2576, pp. 257\u2013267. Springer, Heidelberg (2003)."},{"key":"1129_CR4","first-page":"121","volume-title":"CRYPTO 2020, Part II. Lecture Notes in Computer Science","author":"B Bauer","year":"2020","unstructured":"Bauer B., Fuchsbauer G., Loss J.: A classification of computational assumptions in the algebraic group model. In: Micciancio D., Ristenpart T. (eds.) CRYPTO 2020, Part II. Lecture Notes in Computer Science, vol. 12171, pp. 121\u2013151. Springer, Heidelberg (2020)."},{"key":"1129_CR5","doi-asserted-by":"crossref","unstructured":"Bellare M., Fuchsbauer G., Scafuro A.: Nizks with an untrusted CRS: security in the face of parameter subversion. In: Cheon J.H., Takagi T. (eds.) ASIACRYPT 2016, Part II. Lecture Notes in Computer Science, vol. 10032, pp. 777\u2013804 (2016).","DOI":"10.1007\/978-3-662-53890-6_26"},{"key":"1129_CR6","first-page":"273","volume-title":"CRYPTO 2004. Lecture Notes in Computer Science","author":"M Bellare","year":"2004","unstructured":"Bellare M., Palacio A.: The knowledge-of-exponent assumptions and 3-round zero-knowledge protocols. In: Franklin M.K. (ed.) CRYPTO 2004. Lecture Notes in Computer Science, vol. 3152, pp. 273\u2013289. Springer, Heidelberg (2004)."},{"key":"1129_CR7","doi-asserted-by":"crossref","unstructured":"Bellare M., Micciancio D., Warinschi B.: Foundations of group signatures: Formal definitions, simplified requirements, and a construction based on general assumptions. In: Biham E. (ed.) EUROCRYPT 2003. Lecture Notes in Computer Science, vol. 2656, pp. 614\u2013629. Springer, Heidelberg (2003).","DOI":"10.1007\/3-540-39200-9_38"},{"key":"1129_CR8","first-page":"136","volume-title":"CT-RSA 2005. Lecture Notes in Computer Science","author":"M Bellare","year":"2005","unstructured":"Bellare M., Shi H., Zhang C.: Foundations of group signatures: The case of dynamic groups. In: Menezes A. (ed.) CT-RSA 2005. Lecture Notes in Computer Science, vol. 3376, pp. 136\u2013153. Springer, Heidelberg (2005)."},{"key":"1129_CR9","doi-asserted-by":"crossref","unstructured":"Ben-Sasson E., Chiesa A., Green M., Tromer E., Virza M.: Secure sampling of public parameters for succinct zero knowledge proofs. In: SP 2015, pp. 287\u2013304. IEEE Computer Society, Heidelberg (2015).","DOI":"10.1109\/SP.2015.25"},{"key":"1129_CR10","first-page":"629","volume-title":"PKC 2015. Lecture Notes in Computer Science","author":"D Bernhard","year":"2015","unstructured":"Bernhard D., Fischlin M., Warinschi B.: Adaptive proofs of knowledge in the random oracle model. In: Katz J. (ed.) PKC 2015. Lecture Notes in Computer Science, vol. 9020, pp. 629\u2013649. Springer, Heidelberg (2015)."},{"key":"1129_CR11","first-page":"381","volume-title":"SCN 2010. Lecture Notes in Computer Science","author":"P Bichsel","year":"2010","unstructured":"Bichsel P., Camenisch J., Neven G., Smart N.P., Warinschi B.: Get shorty via group signatures without encryption. In: Garay J.A., Prisco R.D. (eds.) SCN 2010. Lecture Notes in Computer Science, vol. 6280, pp. 381\u2013398. Springer, Heidelberg (2010)."},{"key":"1129_CR12","first-page":"168","volume-title":"CCS 2004","author":"D Boneh","year":"2004","unstructured":"Boneh D., Shacham H.: Group signatures with verifier-local revocation. In: Atluri V., Pfitzmann B., McDaniel P.D. (eds.) CCS 2004, pp. 168\u2013177. ACM, New York (2004)."},{"key":"1129_CR13","first-page":"41","volume-title":"CRYPTO 2004. Lecture Notes in Computer Science","author":"D Boneh","year":"2004","unstructured":"Boneh D., Boyen X., Shacham H.: Short group signatures. In: Franklin M.K. (ed.) CRYPTO 2004. Lecture Notes in Computer Science, vol. 3152, pp. 41\u201355. Springer, Heidelberg (2004)."},{"key":"1129_CR14","first-page":"243","volume-title":"ESORICS 2015, Part I. Lecture Notes in Computer Science","author":"J Bootle","year":"2015","unstructured":"Bootle J., Cerulli A., Chaidos P., Ghadafi E., Groth J., Petit C.: Short accountable ring signatures based on DDH. In: Pernul G., Ryan P.Y.A., Weippl E.R. (eds.) ESORICS 2015, Part I. Lecture Notes in Computer Science, vol. 9326, pp. 243\u2013265. Springer, Heidelberg (2015)."},{"key":"1129_CR15","first-page":"1822","volume":"33","author":"J Bootle","year":"2020","unstructured":"Bootle J., Cerulli A., Chaidos P., Ghadafi E., Groth J.: Foundations of fully dynamic group signatures 33, 1822\u20131870 (2020).","journal-title":"Foundations of fully dynamic group signatures"},{"key":"1129_CR16","unstructured":"Bowe S.: BLS12-381: New zk-SNARK elliptic curve construction. Zcash Company Posts. https:\/\/electriccoin.co\/blog\/new-snark-curve\/ (2017)."},{"key":"1129_CR17","first-page":"1","volume-title":"PKC 2007. Lecture Notes in Computer Science","author":"X Boyen","year":"2007","unstructured":"Boyen X., Waters B.: Full-domain subgroup hiding and constant-size group signatures. In: Okamoto T., Wang X. (eds.) PKC 2007. Lecture Notes in Computer Science, vol. 4450, pp. 1\u201315. Springer, Heidelberg (2007)."},{"key":"1129_CR18","first-page":"21","volume-title":"WPES 2007","author":"E Brickell","year":"2007","unstructured":"Brickell E., Li J.: Enhanced privacy ID: a direct anonymous attestation scheme with enhanced revocation capabilities. In: Ning P., Yu T. (eds.) WPES 2007, pp. 21\u201330. ACM, New York (2007)."},{"key":"1129_CR19","first-page":"132","volume-title":"CCS 2004","author":"EF Brickell","year":"2004","unstructured":"Brickell E.F., Camenisch J., Chen L.: Direct anonymous attestation. In: Atluri V., Pfitzmann B., McDaniel P.D. (eds.) CCS 2004, pp. 132\u2013145. ACM, New York (2004)."},{"key":"1129_CR20","doi-asserted-by":"crossref","unstructured":"Camenisch J., Chen L., Drijvers M., Lehmann A., Novick D., Urian R.: One TPM to bind them all: Fixing TPM 2.0 for provably secure anonymous attestation. In: SP 2017, pp. 901\u2013920. IEEE Computer Society, Heidelberg (2017).","DOI":"10.1109\/SP.2017.22"},{"key":"1129_CR21","first-page":"120","volume-title":"SCN 2004. Lecture Notes in Computer Science","author":"J Camenisch","year":"2004","unstructured":"Camenisch J., Groth J.: Group signatures: better efficiency and new theoretical aspects. In: Blundo C., Cimato S. (eds.) SCN 2004. Lecture Notes in Computer Science, vol. 3352, pp. 120\u2013133. Springer, Heidelberg (2004)."},{"key":"1129_CR22","first-page":"56","volume-title":"CRYPTO 2004. Lecture Notes in Computer Science","author":"J Camenisch","year":"2004","unstructured":"Camenisch J., Lysyanskaya A.: Signature schemes and anonymous credentials from bilinear maps. In: Franklin M.K. (ed.) CRYPTO 2004. Lecture Notes in Computer Science, vol. 3152, pp. 56\u201372. Springer, Heidelberg (2004)."},{"key":"1129_CR23","first-page":"410","volume-title":"CRYPTO 1997. Lecture Notes in Computer Science","author":"J Camenisch","year":"1997","unstructured":"Camenisch J., Stadler M.: Efficient group signature schemes for large groups (extended abstract). In: Kaliski B.S. Jr. (ed.) CRYPTO 1997. Lecture Notes in Computer Science, vol. 1294, pp. 410\u2013424. Springer, Heidelberg (1997)."},{"key":"1129_CR24","first-page":"401","volume-title":"SCN 2020. Lecture Notes in Computer Science","author":"J Camenisch","year":"2020","unstructured":"Camenisch J., Drijvers M., Lehmann A., Neven G., Towa P.: Short threshold dynamic group signatures. In: Galdi C., Kolesnikov V. (eds.) SCN 2020. Lecture Notes in Computer Science, vol. 12238, pp. 401\u2013423. Springer, Heidelberg (2020)."},{"key":"1129_CR25","first-page":"257","volume-title":"EUROCRYPT 1991. Lecture Notes in Computer Science","author":"D Chaum","year":"1991","unstructured":"Chaum D., van Heyst E.: Group signatures. In: Davies D.W. (ed.) EUROCRYPT 1991. Lecture Notes in Computer Science, vol. 547, pp. 257\u2013265. Springer, Heidelberg (1991)."},{"key":"1129_CR26","first-page":"3","volume-title":"ProvSec 2020. Lecture Notes in Computer Science","author":"R Clarisse","year":"2020","unstructured":"Clarisse R., Sanders O.: Group signature without random oracles from randomizable signatures. In: Nguyen K., Wu W., Lam K., Wang H. (eds.) ProvSec 2020. Lecture Notes in Computer Science, vol. 12505, pp. 3\u201323. Springer, Heidelberg (2020)."},{"key":"1129_CR27","first-page":"445","volume-title":"Advances in Cryptology - CRYPTO 1991. Lecture Notes in Computer Science","author":"I Damg\u00e5rd","year":"1991","unstructured":"Damg\u00e5rd I.: Towards practical public key systems secure against chosen ciphertext attacks. In: Feigenbaum J. (ed.) Advances in Cryptology - CRYPTO 1991. Lecture Notes in Computer Science, vol. 576, pp. 445\u2013456. Springer, Heidelberg (1991)."},{"key":"1129_CR28","first-page":"193","volume-title":"VIETCRYPT 2006. Lecture Notes in Computer Science","author":"C Delerabl\u00e9e","year":"2006","unstructured":"Delerabl\u00e9e C., Pointcheval D.: Dynamic fully anonymous short group signatures. In: Nguyen P.Q. (ed.) VIETCRYPT 2006. Lecture Notes in Computer Science, vol. 4341, pp. 193\u2013210. Springer, Heidelberg (2006)."},{"key":"1129_CR29","first-page":"551","volume-title":"AsiaCCS 2018","author":"D Derler","year":"2018","unstructured":"Derler D., Slamanig D.: Highly-efficient fully-anonymous dynamic group signatures. In: Kim J., Ahn G., Kim S., Kim Y., L\u00f3pez J., Kim T. (eds.) AsiaCCS 2018, pp. 551\u2013565. ACM, New York (2018)."},{"key":"1129_CR30","first-page":"60","volume-title":"INDOCRYPT 2012. Lecture Notes in Computer Science","author":"S Faust","year":"2012","unstructured":"Faust S., Kohlweiss M., Marson G.A., Venturi D.: On the non-malleability of the fiat-shamir transform. In: Galbraith S.D., Nandi M. (eds.) INDOCRYPT 2012. Lecture Notes in Computer Science, vol. 7668, pp. 60\u201379. Springer, Heidelberg (2012)."},{"key":"1129_CR31","first-page":"186","volume-title":"CRYPTO 1986. Lecture Notes in Computer Science","author":"A Fiat","year":"1986","unstructured":"Fiat A., Shamir A.: How to prove yourself: Practical solutions to identification and signature problems. In: Odlyzko A.M. (ed.) CRYPTO 1986. Lecture Notes in Computer Science, vol. 263, pp. 186\u2013194. Springer, Heidelberg (1986)."},{"key":"1129_CR32","first-page":"152","volume-title":"CRYPTO 2005. Lecture Notes in Computer Science","author":"M Fischlin","year":"2005","unstructured":"Fischlin M.: Communication-efficient non-interactive proofs of knowledge with online extractors. In: Shoup V. (ed.) CRYPTO 2005. Lecture Notes in Computer Science, vol. 3621, pp. 152\u2013168. Springer, Heidelberg (2005)."},{"key":"1129_CR33","first-page":"212","volume-title":"EUROCRYPT 2020, Part III. Lecture Notes in Computer Science","author":"M Fischlin","year":"2020","unstructured":"Fischlin M., Harasser P., Janson C.: Signatures from sequential-or proofs. In: Canteaut A., Ishai Y. (eds.) EUROCRYPT 2020, Part III. Lecture Notes in Computer Science, vol. 12107, pp. 212\u2013244. Springer, Heidelberg (2020)."},{"key":"1129_CR34","first-page":"33","volume-title":"CRYPTO 2018, Part II. Lecture Notes in Computer Science","author":"G Fuchsbauer","year":"2018","unstructured":"Fuchsbauer G., Kiltz E., Loss J.: The algebraic group model and its applications. In: Shacham H., Boldyreva A. (eds.) CRYPTO 2018, Part II. Lecture Notes in Computer Science, vol. 10992, pp. 33\u201362. Springer, Heidelberg (2018)."},{"issue":"16","key":"1129_CR35","doi-asserted-by":"crossref","first-page":"3113","DOI":"10.1016\/j.dam.2007.12.010","volume":"156","author":"SD Galbraith","year":"2008","unstructured":"Galbraith S.D., Paterson K.G., Smart N.P.: Pairings for cryptographers. Discret. Appl. Math. 156(16), 3113\u20133121 (2008).","journal-title":"Discret. Appl. Math."},{"key":"1129_CR36","first-page":"177","volume-title":"EUROCRYPT 2003. Lecture Notes in Computer Science","author":"JA Garay","year":"2003","unstructured":"Garay J.A., MacKenzie P.D., Yang K.: Strengthening zero-knowledge protocols using signatures. In: Biham E. (ed.) EUROCRYPT 2003. Lecture Notes in Computer Science, vol. 2656, pp. 177\u2013194. Springer, Heidelberg (2003)."},{"issue":"4","key":"1129_CR37","doi-asserted-by":"crossref","first-page":"493","DOI":"10.1007\/s00145-007-0549-3","volume":"20","author":"E Goh","year":"2007","unstructured":"Goh E., Jarecki S., Katz J., Wang N.: Efficient signature schemes with tight reductions to the Diffie-Hellman problems. J. Cryptol. 20(4), 493\u2013514 (2007).","journal-title":"J. Cryptol."},{"issue":"2","key":"1129_CR38","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1137\/0217017","volume":"17","author":"S Goldwasser","year":"1988","unstructured":"Goldwasser S., Micali S., Rivest R.L.: A digital signature scheme secure against adaptive chosen-message attacks. SIAM J. Comput. 17(2), 281\u2013308 (1988).","journal-title":"SIAM J. Comput."},{"key":"1129_CR39","first-page":"164","volume-title":"ASIACRYPT 2007. Lecture Notes in Computer Science","author":"J Groth","year":"2007","unstructured":"Groth J.: Fully anonymous group signatures without random oracles. In: Kurosawa K. (ed.) ASIACRYPT 2007. Lecture Notes in Computer Science, vol. 4833, pp. 164\u2013180. Springer, Heidelberg (2007)."},{"key":"1129_CR40","first-page":"491","volume-title":"ASIACRYPT 2014. Lecture Notes in Computer Science","author":"C Hanser","year":"2014","unstructured":"Hanser C., Slamanig D.: Structure-preserving signatures on equivalence classes and their application to anonymous credentials. In: Sarkar P., Iwata T. (eds.) ASIACRYPT 2014. Lecture Notes in Computer Science, vol. 8873, pp. 491\u2013511. Springer, Heidelberg (2014)."},{"key":"1129_CR41","unstructured":"Intel: A Cost-Effective Foundation for End-to-End IoT Security, White Paper. https:\/\/www.intel.in\/content\/www\/in\/en\/internet-of-things\/white-papers\/iot-identity-intel-epid-iot-security-white-paper.html (2016)."},{"key":"1129_CR42","first-page":"198","volume-title":"EUROCRYPT 2005. Lecture Notes in Computer Science","author":"A Kiayias","year":"2005","unstructured":"Kiayias A., Yung M.: Group signatures with efficient concurrent join. In: Cramer R. (ed.) EUROCRYPT 2005. Lecture Notes in Computer Science, vol. 3494, pp. 198\u2013214. Springer, Heidelberg (2005)."},{"key":"1129_CR43","unstructured":"Kim H., Lee Y., Abdalla M., Park J.H.: Practical Dynamic Group Signature with Efficient Concurrent Joins and Batch Verifications. Cryptology ePrint Archive, Report 2020\/921. https:\/\/eprint.iacr.org\/2020\/921 (2020)."},{"key":"1129_CR44","first-page":"1","volume-title":"TCC 2021, Part II. Lecture Notes in Computer Science","author":"J Lee","year":"2021","unstructured":"Lee J.: Dory: efficient, transparent arguments for generalised inner products and polynomial commitments. In: Nissim K., Waters B. (eds.) TCC 2021, Part II. Lecture Notes in Computer Science, vol. 13043, pp. 1\u201334. Springer, Heidelberg (2021)."},{"key":"1129_CR45","first-page":"296","volume-title":"CRYPTO 2015, Part II. Lecture Notes in Computer Science","author":"B Libert","year":"2015","unstructured":"Libert B., Peters T., Yung M.: Short group signatures via structure-preserving signatures: standard model security from simple assumptions. In: Gennaro R., Robshaw M. (eds.) CRYPTO 2015, Part II. Lecture Notes in Computer Science, vol. 9216, pp. 296\u2013316. Springer, Heidelberg (2015)."},{"key":"1129_CR46","first-page":"511","volume-title":"AsiaCCS 2016","author":"B Libert","year":"2016","unstructured":"Libert B., Mouhartem F., Peters T., Yung M.: Practical \u201csignatures with efficient protocols\" from simple assumptions. In: Chen X., Wang X., Huang X. (eds.) AsiaCCS 2016, pp. 511\u2013522. ACM, New York (2016)."},{"key":"1129_CR47","first-page":"427","volume-title":"STOC 1990","author":"M Naor","year":"1990","unstructured":"Naor M., Yung M.: Public-key cryptosystems provably secure against chosen ciphertext attacks. In: Ortiz H. (ed.) STOC 1990, pp. 427\u2013437. ACM, New York (1990)."},{"key":"1129_CR48","first-page":"223","volume-title":"EUROCRYPT 1999. Lecture Notes in Computer Science","author":"P Paillier","year":"1999","unstructured":"Paillier P.: Public-key cryptosystems based on composite degree residuosity classes. In: Stern J. (ed.) EUROCRYPT 1999. Lecture Notes in Computer Science, vol. 1592, pp. 223\u2013238. Springer, Heidelberg (1999)."},{"key":"1129_CR49","first-page":"111","volume-title":"CT-RSA 2016. Lecture Notes in Computer Science","author":"D Pointcheval","year":"2016","unstructured":"Pointcheval D., Sanders O.: Short randomizable signatures. In: Sako K. (ed.) CT-RSA 2016. Lecture Notes in Computer Science, vol. 9610, pp. 111\u2013126. Springer, Heidelberg (2016)."},{"issue":"3","key":"1129_CR50","doi-asserted-by":"crossref","first-page":"361","DOI":"10.1007\/s001450010003","volume":"13","author":"D Pointcheval","year":"2000","unstructured":"Pointcheval D., Stern J.: Security arguments for digital signatures and blind signatures. J. Cryptol. 13(3), 361\u2013396 (2000).","journal-title":"J. Cryptol."},{"key":"1129_CR51","first-page":"715","volume-title":"PKC 2012. Lecture Notes in Computer Science","author":"Y Sakai","year":"2012","unstructured":"Sakai Y., Schuldt J.C.N., Emura K., Hanaoka G., Ohta K.: On the security of dynamic group signatures: preventing signature hijacking. In: Fischlin M., Buchmann J.A., Manulis M. (eds.) PKC 2012. Lecture Notes in Computer Science, vol. 7293, pp. 715\u2013732. Springer, Heidelberg (2012)."},{"key":"1129_CR52","unstructured":"TCG https:\/\/trustedcomputinggroup.org\/authentication\/ (2015)."}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-022-01129-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10623-022-01129-w\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-022-01129-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,3,10]],"date-time":"2023-03-10T18:19:49Z","timestamp":1678472389000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10623-022-01129-w"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,10,18]]},"references-count":52,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2023,3]]}},"alternative-id":["1129"],"URL":"https:\/\/doi.org\/10.1007\/s10623-022-01129-w","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"type":"print","value":"0925-1022"},{"type":"electronic","value":"1573-7586"}],"subject":[],"published":{"date-parts":[[2022,10,18]]},"assertion":[{"value":"21 October 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"29 August 2022","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"28 September 2022","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"18 October 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":"The authors declare that they have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}