{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,8]],"date-time":"2026-10-08T20:58:24Z","timestamp":1791493104382,"version":"4.3.4"},"reference-count":57,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2023,4,26]],"date-time":"2023-04-26T00:00:00Z","timestamp":1682467200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,4,26]],"date-time":"2023-04-26T00:00:00Z","timestamp":1682467200000},"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":["J Cryptol"],"published-print":{"date-parts":[[2023,7]]},"DOI":"10.1007\/s00145-023-09459-1","type":"journal-article","created":{"date-parts":[[2023,4,26]],"date-time":"2023-04-26T22:01:56Z","timestamp":1682546516000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":20,"title":["I Want to Ride My BICYCL\u00a0: BICYCL\u00a0Implements CryptographY in CLass Groups"],"prefix":"10.1007","volume":"36","author":[{"given":"Cyril","family":"Bouvier","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Guilhem","family":"Castagnos","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Laurent","family":"Imbert","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Fabien","family":"Laguillaumie","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2023,4,26]]},"reference":[{"key":"9459_CR1","doi-asserted-by":"crossref","unstructured":"D.\u00a0Abram, I.\u00a0Damg\u00e5rd, C.\u00a0Orlandi, P.\u00a0Scholl, An algebraic framework for silent preprocessing with trustless setup and active security, in CRYPTO 2022 (Springer, 2022)","DOI":"10.1007\/978-3-031-15985-5_15"},{"key":"9459_CR2","unstructured":"D.F. Aranha, C.P.L. Gouv\u00eaa, T.\u00a0Markmann, R.S. Wahby, K.\u00a0Liao, RELIC is an Efficient LIbrary for Cryptography. https:\/\/github.com\/relic-toolkit\/relic"},{"key":"9459_CR3","doi-asserted-by":"crossref","unstructured":"T.\u00a0Attema, I.\u00a0Cascudo, R.\u00a0Cramer, I.B. Damg\u00e5rd, D.\u00a0Escudero, Vector commitments over rings and compressed $$\\sigma $$-protocols. Cryptology ePrint Archive, Report 2022\/181 (2022). https:\/\/eprint.iacr.org\/2022\/181","DOI":"10.1007\/978-3-031-22318-1_7"},{"key":"9459_CR4","doi-asserted-by":"crossref","unstructured":"W.\u00a0Beullens, T.\u00a0Kleinjung, F.\u00a0Vercauteren, CSI-FiSh: Efficient isogeny based signatures through class group computations, in S.D. Galbraith, S.\u00a0Moriai, editors, ASIACRYPT\u00a02019, Part\u00a0I, vol. 11921 of LNCS (Springer, Heidelberg, 2019), pp. 227\u2013247","DOI":"10.1007\/978-3-030-34578-5_9"},{"key":"9459_CR5","doi-asserted-by":"crossref","unstructured":"J.-F. Biasse, Improvements in the computation of ideal class groups of imaginary quadratic number fields. Adv. Math. Commun. 4(2):141\u2013154 (2010)","DOI":"10.3934\/amc.2010.4.141"},{"key":"9459_CR6","doi-asserted-by":"crossref","unstructured":"J.-F. Biasse, M.J. Jacobson, A.K. Silvester, Security estimates for quadratic field based cryptosystems, in R.\u00a0Steinfeld, P.\u00a0Hawkes, editors, ACISP 10, vol. 6168 of LNCS (Springer, Heidelberg, 2010), pp. 233\u2013247","DOI":"10.1007\/978-3-642-14081-5_15"},{"key":"9459_CR7","doi-asserted-by":"crossref","unstructured":"D.\u00a0Boneh, B.\u00a0B\u00fcnz, B.\u00a0Fisch, Batching techniques for accumulators with applications to IOPs and stateless blockchains, in A.\u00a0Boldyreva, D.\u00a0Micciancio, editors, CRYPTO\u00a02019, Part\u00a0I, vol. 11692 of LNCS (Springer, Heidelberg, 2019), pp. 561\u2013586","DOI":"10.1007\/978-3-030-26948-7_20"},{"key":"9459_CR8","doi-asserted-by":"crossref","unstructured":"J.\u00a0Buchmann, C.\u00a0Thiel, H.\u00a0Williams, Short representation of quadratic integers, in W.\u00a0Bosma, A.\u00a0van\u00a0der Poorten, editors, Computational Algebra and Number Theory (Springer Netherlands, Dordrecht, 1995), pp. 159\u2013185","DOI":"10.1007\/978-94-017-1108-1_12"},{"key":"9459_CR9","unstructured":"J.\u00a0Buchmann, U.\u00a0Vollmer, Binary Quadratic Forms: An Algorithmic Approach. Algorithms and Computation in Mathematics (Springer, Berlin Heidelberg, 2007)"},{"key":"9459_CR10","doi-asserted-by":"crossref","unstructured":"J.\u00a0Buchmann, H.C. Williams. A key-exchange system based on imaginary quadratic fields. J. Cryptol. 1(2):107\u2013118 (1988)","DOI":"10.1007\/BF02351719"},{"key":"9459_CR11","doi-asserted-by":"crossref","unstructured":"J.\u00a0Buchmann, H.C. Williams, A key exchange system based on real quadratic fields, in G.\u00a0Brassard, editor, CRYPTO\u201989, vol. 435 of LNCS (Springer, Heidelberg, 1990), pp. 335\u2013343","DOI":"10.1007\/0-387-34805-0_31"},{"key":"9459_CR12","doi-asserted-by":"crossref","unstructured":"B.\u00a0B\u00fcnz, B.\u00a0Fisch, A.\u00a0Szepieniec, Transparent SNARKs from DARK compilers, in A.\u00a0Canteaut, Y.\u00a0Ishai, editors, EUROCRYPT\u00a02020, Part\u00a0I, vol. 12105 of LNCS (Springer, Heidelberg, 2020), pp. 677\u2013706","DOI":"10.1007\/978-3-030-45721-1_24"},{"key":"9459_CR13","doi-asserted-by":"crossref","unstructured":"J.\u00a0Camenisch, V.\u00a0Shoup, Practical verifiable encryption and decryption of discrete logarithms, in D.\u00a0Boneh, editor, CRYPTO\u00a02003, vol. 2729 of LNCS (Springer, Heidelberg, 2003), pp. 126\u2013144","DOI":"10.1007\/978-3-540-45146-4_8"},{"key":"9459_CR14","doi-asserted-by":"crossref","unstructured":"G.\u00a0Castagnos, D.\u00a0Catalano, F.\u00a0Laguillaumie, F.\u00a0Savasta, I.\u00a0Tucker, Two-party ECDSA from hash proof systems and efficient instantiations, in A.\u00a0Boldyreva, D.\u00a0Micciancio, editors, CRYPTO\u00a02019, Part\u00a0III, vol. 11694 of LNCS (Springer, Heidelberg, 2019), pp. 191\u2013221","DOI":"10.1007\/978-3-030-26954-8_7"},{"key":"9459_CR15","doi-asserted-by":"crossref","unstructured":"G.\u00a0Castagnos, D.\u00a0Catalano, F.\u00a0Laguillaumie, F.\u00a0Savasta, I.\u00a0Tucker, Bandwidth-efficient threshold EC-DSA, in A.\u00a0Kiayias, M.\u00a0Kohlweiss, P.\u00a0Wallden, V.\u00a0Zikas, editors, PKC\u00a02020, Part\u00a0II, vol. 12111 of LNCS (Springer, Heidelberg, 2020), pp. 266\u2013296","DOI":"10.1007\/978-3-030-45388-6_10"},{"key":"9459_CR16","doi-asserted-by":"crossref","unstructured":"G.\u00a0Castagnos, L.\u00a0Imbert, F.\u00a0Laguillaumie, Encryption switching protocols revisited: Switching modulo p, in J.\u00a0Katz, H.\u00a0Shacham, editors, CRYPTO\u00a02017, Part\u00a0I, vol. 10401 of LNCS (Springer, Heidelberg, 2017), pp. 255\u2013287","DOI":"10.1007\/978-3-319-63688-7_9"},{"key":"9459_CR17","doi-asserted-by":"crossref","unstructured":"G.\u00a0Castagnos, A.\u00a0Joux, F.\u00a0Laguillaumie, P.Q. Nguyen, Factoring $$pq^2$$ with quadratic forms: Nice cryptanalyses, in M.\u00a0Matsui, editor, ASIACRYPT\u00a02009, vol. 5912 of LNCS (Springer, Heidelberg, 2009), pp. 469\u2013486","DOI":"10.1007\/978-3-642-10366-7_28"},{"key":"9459_CR18","doi-asserted-by":"crossref","unstructured":"G.\u00a0Castagnos, F.\u00a0Laguillaumie, On the security of cryptosystems with quadratic decryption: The nicest cryptanalysis, in A.\u00a0Joux, editor, EUROCRYPT\u00a02009, vol. 5479 of LNCS (Springer, Heidelberg, 2009), pp. 260\u2013277","DOI":"10.1007\/978-3-642-01001-9_15"},{"key":"9459_CR19","doi-asserted-by":"crossref","unstructured":"G.\u00a0Castagnos, F.\u00a0Laguillaumie, Linearly homomorphic encryption from $${\\sf DDH}$$, in K.\u00a0Nyberg, editor, CT-RSA\u00a02015, vol. 9048 of LNCS (Springer, Heidelberg, 2015), pp. 487\u2013505","DOI":"10.1007\/978-3-319-16715-2_26"},{"key":"9459_CR20","doi-asserted-by":"crossref","unstructured":"G.\u00a0Castagnos, F.\u00a0Laguillaumie, I.\u00a0Tucker, Practical fully secure unrestricted inner product functional encryption modulo p, in T.\u00a0Peyrin, S.\u00a0Galbraith, editors, ASIACRYPT\u00a02018, Part\u00a0II, vol. 11273 of LNCS (Springer, Heidelberg, 2018), pp. 733\u2013764","DOI":"10.1007\/978-3-030-03329-3_25"},{"key":"9459_CR21","doi-asserted-by":"crossref","unstructured":"G.\u00a0Castagnos, F.\u00a0Laguillaumie, I.\u00a0Tucker, Threshold linearly homomorphic encryption on $${\\textbf{Z}}\/2^k{\\textbf{Z}}$$. Cryptology ePrint Archive, Paper 2022\/1143, 2022. https:\/\/eprint.iacr.org\/2022\/1143, to appear at ASIACRYPT 2022","DOI":"10.1007\/978-3-031-22966-4_4"},{"key":"9459_CR22","doi-asserted-by":"crossref","unstructured":"P.\u00a0Chaidos, G.\u00a0Couteau, Efficient designated-verifier non-interactive zero-knowledge proofs of knowledge, in J.\u00a0B. Nielsen, V.\u00a0Rijmen, editors, EUROCRYPT\u00a02018, Part\u00a0III, vol. 10822 of LNCS (Springer, Heidelberg, 2018), pp. 193\u2013221","DOI":"10.1007\/978-3-319-78372-7_7"},{"key":"9459_CR23","unstructured":"CHIA. Chia Verifiable Delay Function Competition (2018). https:\/\/medium.com\/@chia.net\/chia-vdf-competition-guide-5382e1f4bd39"},{"key":"9459_CR24","doi-asserted-by":"crossref","unstructured":"G.\u00a0Couteau, D.\u00a0Goudarzi, M.\u00a0Kloo\u00df, M.\u00a0Reichle, Sharp: Short relaxed range proofs. Cryptology ePrint Archive, Paper 2022\/1153 (2022). https:\/\/eprint.iacr.org\/2022\/1153","DOI":"10.1145\/3548606.3560628"},{"key":"9459_CR25","doi-asserted-by":"crossref","unstructured":"G.\u00a0Couteau, M.\u00a0Kloo\u00df, H.\u00a0Lin, M.\u00a0Reichle, Efficient range proofs with transparent setup from bounded integer commitments, in A.\u00a0Canteaut, F.-X. Standaert, editors, EUROCRYPT\u00a02021, Part\u00a0III, vol. 12698 of LNCS (Springer, Heidelberg, 2021), pp. 247\u2013277","DOI":"10.1007\/978-3-030-77883-5_9"},{"key":"9459_CR26","unstructured":"D.\u00a0Cox, Primes of the Form$$x^2+ny^2$$: Fermat, Class Field Theory, and Complex Multiplication. Pure and Applied Mathematics: A Wiley Series of Texts, Monographs and Tracts (Wiley, 2014)"},{"key":"9459_CR27","doi-asserted-by":"crossref","unstructured":"P.\u00a0Das, M.J. Jacobson Jr., R.\u00a0Scheidler, Improved efficiency of a linearly homomorphic cryptosystem, in Codes, Cryptology and Information Security (Springer, 2019), pp. 349\u2013368","DOI":"10.1007\/978-3-030-16458-4_20"},{"key":"9459_CR28","doi-asserted-by":"crossref","unstructured":"Y.\u00a0Deng, S.\u00a0Ma, X.\u00a0Zhang, H.\u00a0Wang, X.\u00a0Song, X.\u00a0Xie, Promise $$\\Sigma $$-protocol: How to construct efficient threshold ECDSA from encryptions based on class groups, in M.\u00a0Tibouchi, H.\u00a0Wang, editors, ASIACRYPT\u00a02021, Part\u00a0IV, vol. 13093 of LNCS (Springer, Heidelberg, 2021), pp. 557\u2013586","DOI":"10.1007\/978-3-030-92068-5_19"},{"key":"9459_CR29","doi-asserted-by":"crossref","unstructured":"W.\u00a0Diffie, M.E. Hellman. New directions in cryptography. IEEE Trans. Inf. Theory 22(6):644\u2013654 (1976)","DOI":"10.1109\/TIT.1976.1055638"},{"key":"9459_CR30","unstructured":"S.\u00a0Dobson, S.\u00a0Galbraith, B.\u00a0Smith. Trustless unknown-order groups. Math. Cryptol. 1(1):1\u201315 (2021)"},{"key":"9459_CR31","doi-asserted-by":"crossref","unstructured":"T.\u00a0ElGamal, A public key cryptosystem and a signature scheme based on discrete logarithms, in G.R. Blakley, D.\u00a0Chaum, editors, CRYPTO\u201984, vol. 196 of LNCS (Springer, Heidelberg, 1984), pp. 10\u201318","DOI":"10.1007\/3-540-39568-7_2"},{"key":"9459_CR32","doi-asserted-by":"crossref","unstructured":"N.\u00a0Glaeser, M.\u00a0Maffei, G.\u00a0Malavolta, P.\u00a0Moreno-Sanchez, E.\u00a0Tairi, S.A. Thyagarajan, Foundations of coin mixing services. Cryptology ePrint Archive, Paper 2022\/942 (2022). https:\/\/eprint.iacr.org\/2022\/942","DOI":"10.1145\/3548606.3560637"},{"key":"9459_CR33","unstructured":"GMP. The GNU Multiple Precision Arithmetic Library. https:\/\/gmplib.org\/"},{"key":"9459_CR34","doi-asserted-by":"crossref","unstructured":"J.L. Hafner, K.S. McCurley. A rigorous subexponential algorithm for computation of class groups. J. Am. Math. Soc. 2(4):837\u2013850 (1989)","DOI":"10.1090\/S0894-0347-1989-1002631-0"},{"key":"9459_CR35","unstructured":"D.\u00a0Hankerson, A.J. Menezes, S.\u00a0Vanstone, Guide to Elliptic Curve Cryptography (Springer, Berlin, Heidelberg, 2003)"},{"key":"9459_CR36","unstructured":"W.\u00a0Hart, F.\u00a0Johansson, S.\u00a0Pancratz, FLINT: Fast Library for Number Theory. Version 2.9.0 (2022). http:\/\/flintlib.org"},{"key":"9459_CR37","doi-asserted-by":"crossref","unstructured":"D.\u00a0H\u00fchnlein, Efficient implementation of cryptosystems based on non-maximal imaginary quadratic orders, in H.M. Heys, C.M. Adams, editors, SAC 1999, vol. 1758 of LNCS (Springer, Heidelberg, 1999), pp. 147\u2013162","DOI":"10.1007\/3-540-46513-8_11"},{"key":"9459_CR38","doi-asserted-by":"crossref","unstructured":"D.\u00a0H\u00fchnlein, M.\u00a0J. Jacobson Jr., S.\u00a0Paulus, T.\u00a0Takagi, A cryptosystem based on non-maximal imaginary quadratic orders with fast decryption, in K.\u00a0Nyberg, editor, EUROCRYPT\u201998, vol. 1403 of LNCS (Springer, Heidelberg, 1998), pp. 294\u2013307","DOI":"10.1007\/BFb0054134"},{"key":"9459_CR39","doi-asserted-by":"crossref","unstructured":"D.\u00a0H\u00fchnlein, M.J. Jacobson Jr., D.\u00a0Weber, Towards practical non-interactive public key cryptosystems using non-maximal imaginary quadratic orders, in D.R. Stinson, S.E. Tavares, editors, SAC 2000, vol. 2012 of LNCS (Springer, Heidelberg, 2001), pp. 275\u2013287","DOI":"10.1007\/3-540-44983-3_20"},{"key":"9459_CR40","doi-asserted-by":"crossref","unstructured":"M.J. Jacobson Jr. Computing discrete logarithms in quadratic orders. J. Cryptol. 13(4):473\u2013492 (2000)","DOI":"10.1007\/s001450010013"},{"key":"9459_CR41","doi-asserted-by":"crossref","unstructured":"B.\u00a0King, wNAF*, an efficient left-to-right signed digit recoding algorithm, in S.M. Bellovin, R.\u00a0Gennaro, A.D. Keromytis, M.\u00a0Yung, editors, ACNS 08, vol. 5037 of LNCS (Springer, Heidelberg, 2008), pp. 429\u2013445","DOI":"10.1007\/978-3-540-68914-0_26"},{"key":"9459_CR42","doi-asserted-by":"crossref","unstructured":"T.\u00a0Kleinjung. Quadratic sieving. Math. Comput. 85(300):1861\u20131873 (2016)","DOI":"10.1090\/mcom\/3058"},{"key":"9459_CR43","doi-asserted-by":"crossref","unstructured":"J.\u00a0Lagarias. Worst-case complexity bounds for algorithms in the theory of integral quadratic forms. J. Algorithms, 1(2):142 \u2013 186 (1980)","DOI":"10.1016\/0196-6774(80)90021-8"},{"key":"9459_CR44","doi-asserted-by":"crossref","unstructured":"R.W.\u00a0F. Lai, G.\u00a0Malavolta, Subvector commitments with application to succinct arguments, in A.\u00a0Boldyreva, D.\u00a0Micciancio, editors, CRYPTO\u00a02019, Part\u00a0I, vol. 11692 of LNCS (Springer, Heidelberg, 2019), pp. 530\u2013560","DOI":"10.1007\/978-3-030-26948-7_19"},{"key":"9459_CR45","doi-asserted-by":"crossref","unstructured":"H.\u00a0Lipmaa, Secure accumulators from Euclidean rings without trusted setup, in F.\u00a0Bao, P.\u00a0Samarati, J.\u00a0Zhou, editors, ACNS 12, vol. 7341 of LNCS (Springer, Heidelberg, 2012), pp. 224\u2013240","DOI":"10.1007\/978-3-642-31284-7_14"},{"key":"9459_CR46","unstructured":"K.S. McCurley, Cryptographic key distribution and computation in class groups, in R.A. Molin, editor, Proc. NATO Advanced Study Inst. on Number Theory and Applications, Banff, 1988 (Kluwer, Boston, 1989)."},{"key":"9459_CR47","doi-asserted-by":"crossref","unstructured":"P.\u00a0Paillier, Public-key cryptosystems based on composite degree residuosity classes, in J.\u00a0Stern, editor, EUROCRYPT\u201999, vol. 1592 of LNCS (Springer, Heidelberg, 1999), pp. 223\u2013238","DOI":"10.1007\/3-540-48910-X_16"},{"key":"9459_CR48","unstructured":"PARI\u00a0Group, Univ. Bordeaux. PARI\/GP version 2.15.0 (2022). http:\/\/pari.math.u-bordeaux.fr\/"},{"key":"9459_CR49","unstructured":"M.\u00a0Sayles. libqform (2014). https:\/\/github.com\/maxwellsayles\/libqform"},{"key":"9459_CR50","unstructured":"D.\u00a0Shanks, On Gauss and composition I, II, in Proc. NATO ASI on Number Theory and Applications (Kluwer Academic Press, 1989), pp. 163\u2013179"},{"key":"9459_CR51","unstructured":"J.A. Solinas, Low-weight binary representations for pairs of integers. Research report CORR 2001-41, Center for Applied Cryptographic Research, University of Waterloo, Waterloo, ON, Canada (2001)"},{"key":"9459_CR52","doi-asserted-by":"crossref","unstructured":"E.G. Straus. Addition chains of vectors (problem 5125). Am. Math. Mon. 71(7):806\u2013808 (1964)","DOI":"10.2307\/2310929"},{"key":"9459_CR53","doi-asserted-by":"crossref","unstructured":"S.A.K. Thyagarajan, G.\u00a0Castagnos, F.\u00a0Laguillaumie, G.\u00a0Malavolta, Efficient CCA timed commitments in class groups, in G.\u00a0Vigna, E.\u00a0Shi, editors, ACM CCS 2021 (ACM Press, 2021), pp. 2663\u20132684","DOI":"10.1145\/3460120.3484773"},{"key":"9459_CR54","unstructured":"I.\u00a0Tucker, Functional encryption and distributed signatures based on projective hash functions, the benefit of class groups. PhD thesis, Universit\u00e9 de Lyon (2020)"},{"key":"9459_CR55","doi-asserted-by":"crossref","unstructured":"B.\u00a0Wesolowski. Efficient verifiable delay functions. J. Cryptol. 33(4):2113\u20132147 (2020)","DOI":"10.1007\/s00145-020-09364-x"},{"key":"9459_CR56","doi-asserted-by":"crossref","unstructured":"T.H. Yuen, H.\u00a0Cui, X.\u00a0Xie, Compact zero-knowledge proofs for threshold ECDSA with trustless setup, in J.\u00a0Garay, editor, PKC\u00a02021, Part\u00a0I, vol. 12710 of LNCS (Springer, Heidelberg, 2021), pp. 481\u2013511","DOI":"10.1007\/978-3-030-75245-3_18"},{"key":"9459_CR57","unstructured":"Zengo. Class: Rust library for building iqc. https:\/\/github.com\/ZenGo-X\/class"}],"container-title":["Journal of Cryptology"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00145-023-09459-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00145-023-09459-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00145-023-09459-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,8,9]],"date-time":"2023-08-09T16:10:05Z","timestamp":1691597405000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00145-023-09459-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,4,26]]},"references-count":57,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2023,7]]}},"alternative-id":["9459"],"URL":"https:\/\/doi.org\/10.1007\/s00145-023-09459-1","relation":{},"ISSN":["0933-2790","1432-1378"],"issn-type":[{"value":"0933-2790","type":"print"},{"value":"1432-1378","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,4,26]]},"assertion":[{"value":"7 October 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 March 2023","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"21 March 2023","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"26 April 2023","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}],"article-number":"17"}}