{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,8]],"date-time":"2026-08-08T22:05:17Z","timestamp":1786226717012,"version":"build-2736575974"},"reference-count":48,"publisher":"Springer Science and Business Media LLC","issue":"10","license":[{"start":{"date-parts":[[2023,5,29]],"date-time":"2023-05-29T00:00:00Z","timestamp":1685318400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,5,29]],"date-time":"2023-05-29T00:00:00Z","timestamp":1685318400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"name":"Guangdong Major Project of Basic and Applied Basic Research","award":["2019B030302008"],"award-info":[{"award-number":["2019B030302008"]}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"crossref","award":["http:\/\/dx.doi.org\/10.13039\/501100001809"],"award-info":[{"award-number":["http:\/\/dx.doi.org\/10.13039\/501100001809"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Des. Codes Cryptogr."],"published-print":{"date-parts":[[2023,10]]},"DOI":"10.1007\/s10623-023-01223-7","type":"journal-article","created":{"date-parts":[[2023,5,29]],"date-time":"2023-05-29T09:02:05Z","timestamp":1685350925000},"page":"3141-3166","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["Fast subgroup membership testings for $$\\mathbb {G}_1$$, $$\\mathbb {G}_2$$ and $$\\mathbb {G}_T$$ on pairing-friendly curves"],"prefix":"10.1007","volume":"91","author":[{"given":"Yu","family":"Dai","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Kaizhan","family":"Lin","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1792-0589","authenticated-orcid":false,"given":"Chang-An","family":"Zhao","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Zijian","family":"Zhou","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2023,5,29]]},"reference":[{"key":"1223_CR1","unstructured":"Aranha D.F., Gouv\u00eaa C.P.L.: RELIC is an Efficient LIbrary for Cryptography. https:\/\/github.com\/relic-toolkit\/relic."},{"key":"1223_CR2","doi-asserted-by":"publisher","first-page":"320","DOI":"10.1007\/978-3-030-88238-9_16","volume-title":"Progress in Cryptology\u2014LATINCRYPT 2021","author":"DF Aranha","year":"2021","unstructured":"Aranha D.F., Pagnin E., Rodr\u00edguez-Henr\u00edquez F.: LOVE a pairing. In: Longa P., R\u00e0fols C. (eds.) Progress in Cryptology\u2014LATINCRYPT 2021, pp. 320\u2013340. Springer, Cham (2021)."},{"key":"1223_CR3","doi-asserted-by":"publisher","unstructured":"Aranha D.F., El Housni Y., Guillevic A.: A survey of elliptic curves for proof systems. Des. Codes Cryptogr. (2022). https:\/\/doi.org\/10.1007\/s10623-022-01135-y.","DOI":"10.1007\/s10623-022-01135-y"},{"issue":"2","key":"1223_CR4","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1007\/s001459900040","volume":"11","author":"R Balasubramanian","year":"1998","unstructured":"Balasubramanian R., Koblitz N.: The improbability that an elliptic curve has subexponential discrete log problem under the Menezes\u2013Okamoto\u2013Vanstone algorithm. J. Cryptol. 11(2), 141\u2013145 (1998).","journal-title":"J. Cryptol."},{"issue":"4","key":"1223_CR5","doi-asserted-by":"publisher","first-page":"1298","DOI":"10.1007\/s00145-018-9280-5","volume":"32","author":"R Barbulescu","year":"2019","unstructured":"Barbulescu R., Duquesne S.: Updating key size estimations for pairings. J. Cryptol. 32(4), 1298\u20131336 (2019).","journal-title":"J. Cryptol."},{"key":"1223_CR6","first-page":"319","volume-title":"Selected Areas in Cryptography\u2014SAC 2005","author":"PSLM Barreto","year":"2006","unstructured":"Barreto P.S.L.M., Naehrig M.: Pairing-friendly elliptic curves of prime order. In: Preneel B., Tavares S. (eds.) Selected Areas in Cryptography\u2014SAC 2005, pp. 319\u2013331. Springer, Berlin (2006)."},{"key":"1223_CR7","first-page":"17","volume-title":"Selected Areas in Cryptography\u2014SAC 2003","author":"PSLM Barreto","year":"2004","unstructured":"Barreto P.S.L.M., Lynn B., Scott M.: On the selection of pairing-friendly groups. In: Matsui M., Zuccherato R.J. (eds.) Selected Areas in Cryptography\u2014SAC 2003, pp. 17\u201325. Springer, Berlin (2004)."},{"key":"1223_CR8","doi-asserted-by":"crossref","unstructured":"Barreto P.S.L.M., Costello C., Misoczki R., Naehrig M., Pereira G.C.C.F., Zanon G.: Subgroup security in pairing-based cryptography. In: Lauter K., Rodr\u00edguez-Henr\u00edquez F. (eds.) Progress in Cryptology\u2014LATINCRYPT 2015, pp. 245\u2013265. Springer, Cham (2015).","DOI":"10.1007\/978-3-319-22174-8_14"},{"key":"1223_CR9","doi-asserted-by":"crossref","unstructured":"Boneh D., Franklin M.: Identity-based encryption from the Weil pairing. In: Kilian J. (ed.) Advances in Cryptology\u2014CRYPTO 2001, pp. 213\u2013229. Springer, Berlin (2001).","DOI":"10.1007\/3-540-44647-8_13"},{"key":"1223_CR10","doi-asserted-by":"crossref","unstructured":"Bosma W., Cannon J., Playoust C.: The Magma Algebra System. I. The user language. J. Symb. Comput. 24(3\u20134), 235\u2013265 (1997). Computational algebra and number theory (London, 1993).","DOI":"10.1006\/jsco.1996.0125"},{"key":"1223_CR11","doi-asserted-by":"crossref","unstructured":"Bowe S., Chiesa A., Green M., Miers I., Mishra P., Wu H.: Zexe: enabling decentralized private computation. In: 2020 IEEE Symposium on Security and Privacy (SP), pp. 947\u2013964 (2020).","DOI":"10.1109\/SP40000.2020.00050"},{"issue":"3","key":"1223_CR12","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1109\/TDSC.2011.63","volume":"9","author":"E Brickell","year":"2012","unstructured":"Brickell E., Li J.: Enhanced Privacy ID: a direct anonymous attestation scheme with enhanced revocation capabilities. IEEE Trans. Depend. Secure Comput. 9(3), 345\u2013360 (2012).","journal-title":"IEEE Trans. Depend. Secure Comput."},{"key":"1223_CR13","doi-asserted-by":"crossref","unstructured":"Brickell E., Camenisch J., Chen L.: Direct anonymous attestation. In: Proceedings of the 11th ACM Conference on Computer and Communications Security\u2014CCS2004, pp. 132\u2013145. Association for Computing Machinery, New York (2004).","DOI":"10.1145\/1030083.1030103"},{"issue":"3","key":"1223_CR14","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1007\/s00200-020-00453-9","volume":"33","author":"A Budroni","year":"2022","unstructured":"Budroni A., Pintore F.: Efficient Hash maps to $${\\mathbb{G} }_2$$ on BLS curves. Appl. Algebra Eng. Commun. Comput. 33(3), 261\u2013281 (2022).","journal-title":"Appl. Algebra Eng. Commun. Comput."},{"issue":"4","key":"1223_CR15","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1007\/s10207-006-0011-9","volume":"6","author":"L Chen","year":"2007","unstructured":"Chen L., Cheng Z., Smart N.P.: Identity-based key agreement protocols from pairings. Int. J. Inf. Security 6(4), 213\u2013241 (2007).","journal-title":"Int. J. Inf. Security"},{"key":"1223_CR16","first-page":"280","volume-title":"Cryptology and Network Security - CANS 2020","author":"R Clarisse","year":"2020","unstructured":"Clarisse R., Duquesne S., Sanders O.: Curves with Fast Computations in the First Pairing Group. In: Krenn S., Shulman H., Vaudenay S. (eds.) Cryptology and Network Security - CANS 2020, pp. 280\u2013298. Springer, Cham (2020)."},{"key":"1223_CR17","doi-asserted-by":"crossref","unstructured":"Costello C., Fournet C., Howell J., Kohlweiss M., Kreuter B., Naehrig M., Parno B., Zahur S.: Geppetto: versatile verifiable computation. In: 2015 IEEE Symposium on Security and Privacy, pp. 253\u2013270 (2015).","DOI":"10.1109\/SP.2015.23"},{"key":"1223_CR18","unstructured":"Dai Y., Zhang F., Zhao C.-A.: Fast Hashing to $${\\mathbb{G}}_2$$ in direct anonymous attestation. Cryptology. ePrint Archive, Paper 2022\/996 (2022). https:\/\/eprint.iacr.org\/2022\/996."},{"issue":"4","key":"1223_CR19","doi-asserted-by":"publisher","first-page":"593","DOI":"10.1007\/s00145-007-9014-6","volume":"21","author":"C Diem","year":"2008","unstructured":"Diem C., Thom\u00e9 E.: Index calculus in class groups of non-hyperelliptic curves of genus three. J. Cryptol. 21(4), 593\u2013611 (2008).","journal-title":"J. Cryptol."},{"key":"1223_CR20","volume-title":"Cryptology and Network Security","author":"Y El Housni","year":"2020","unstructured":"El Housni Y., Guillevic A.: Optimized and secure pairing-friendly elliptic curves suitable for one layer proof composition. In: Krenn S., Shulman H., Vaudenay S. (eds.) Cryptology and Network Security. Springer, Heidelberg (2020)."},{"key":"1223_CR21","doi-asserted-by":"publisher","first-page":"518","DOI":"10.1007\/978-3-031-17433-9_22","volume-title":"Progress in Cryptology\u2014AFRICACRYPT 2022","author":"Y El Housni","year":"2022","unstructured":"El Housni Y., Guillevic A., Piellard T.: Co-factor clearing and subgroup membership testing on pairing-friendly curves. In: Batina L., Daemen J. (eds.) Progress in Cryptology\u2014AFRICACRYPT 2022, pp. 518\u2013536. Springer, Cham (2022)."},{"key":"1223_CR22","first-page":"28","volume-title":"Security, Privacy, and Applied Cryptography Engineering\u2014SPACE 2014","author":"A Enge","year":"2014","unstructured":"Enge A., Milan J.: Implementing cryptographic pairings at standard security levels. In: Chakraborty R.S., Matyas V., Schaumont P. (eds.) Security, Privacy, and Applied Cryptography Engineering\u2014SPACE 2014, pp. 28\u201346. Springer, Cham (2014)."},{"issue":"2","key":"1223_CR23","doi-asserted-by":"publisher","first-page":"224","DOI":"10.1007\/s00145-009-9048-z","volume":"23","author":"D Freeman","year":"2010","unstructured":"Freeman D., Scott M., Teske E.: A taxonomy of pairing-friendly elliptic curves. J. Cryptol. 23(2), 224\u2013280 (2010).","journal-title":"J. Cryptol."},{"key":"1223_CR24","first-page":"412","volume-title":"Selected Areas in Cryptography\u2014SAC 2011","author":"L Fuentes-Casta\u00f1eda","year":"2012","unstructured":"Fuentes-Casta\u00f1eda L., Knapp E., Rodr\u00edguez-Henr\u00edquez F.: Faster Hashing to $${\\mathbb{G} }_2$$. In: Miri A., Vaudenay S. (eds.) Selected Areas in Cryptography\u2014SAC 2011, pp. 412\u2013430. Springer, Berlin (2012)."},{"key":"1223_CR25","unstructured":"Galbraith S.D.: Mathematics of Public Key Cryptography, version 2. Cambridge University Press, Cambridge (2018)."},{"key":"1223_CR26","doi-asserted-by":"publisher","unstructured":"Galbraith S.D.: Pairings. In: Blake I.F., Seroussi G., Smart N.P. (eds.) Advances in Elliptic Curve Cryptography. London Mathematical Society Lecture Note Series, vol. 317, pp. 183\u2013214. Cambridge University Press, Cambridge (2005). https:\/\/doi.org\/10.1017\/CBO9780511546570.011.","DOI":"10.1017\/CBO9780511546570.011"},{"key":"1223_CR27","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1007\/978-3-540-85538-5_15","volume-title":"Pairing-Based Cryptography\u2014Pairing 2008","author":"SD Galbraith","year":"2008","unstructured":"Galbraith S.D., Scott M.: Exponentiation in pairing-friendly groups using homomorphisms. In: Galbraith S.D., Paterson K.G. (eds.) Pairing-Based Cryptography\u2014Pairing 2008, pp. 211\u2013224. Springer, Berlin (2008)."},{"key":"1223_CR28","doi-asserted-by":"publisher","first-page":"518","DOI":"10.1007\/978-3-642-01001-9_30","volume-title":"Advances in Cryptology\u2014EUROCRYPT 2009","author":"SD Galbraith","year":"2009","unstructured":"Galbraith S.D., Lin X., Scott M.: Endomorphisms for faster elliptic curve cryptography on a large class of curves. In: Joux A. (ed.) Advances in Cryptology\u2014EUROCRYPT 2009, pp. 518\u2013535. Springer, Berlin (2009)."},{"key":"1223_CR29","doi-asserted-by":"publisher","first-page":"190","DOI":"10.1007\/3-540-44647-8_11","volume-title":"Advances in Cryptology\u2014CRYPTO 2001","author":"RP Gallant","year":"2001","unstructured":"Gallant R.P., Lambert R.J., Vanstone S.A.: Faster point multiplication on elliptic curves with efficient endomorphisms. In: Kilian J. (ed.) Advances in Cryptology\u2014CRYPTO 2001, pp. 190\u2013200. Springer, Berlin (2001)."},{"issue":"1","key":"1223_CR30","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1007\/s00145-001-0011-x","volume":"15","author":"P Gaudry","year":"2002","unstructured":"Gaudry P., Hess F., Smart N.P.: Constructive and destructive facets of Weil descent on elliptic curves. J. Cryptol. 15(1), 19\u201346 (2002).","journal-title":"J. Cryptol."},{"key":"1223_CR31","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1007\/978-3-642-13013-7_13","volume-title":"Public Key Cryptography\u2014PKC 2010","author":"R Granger","year":"2010","unstructured":"Granger R., Scott M.: Faster squaring in the cyclotomic subgroup of sixth degree extensions. In: Nguyen P.Q., Pointcheval D. (eds.) Public Key Cryptography\u2014PKC 2010, pp. 209\u2013223. Springer, Berlin (2010)."},{"key":"1223_CR32","doi-asserted-by":"publisher","first-page":"535","DOI":"10.1007\/978-3-030-45388-6_19","volume-title":"Public-Key Cryptography\u2014PKC 2020","author":"A Guillevic","year":"2020","unstructured":"Guillevic A.: A short-list of pairing-friendly curves resistant to special TNFS at the 128-bit security level. In: Kiayias A., Kohlweiss M., Wallden P., Zikas V. (eds.) Public-Key Cryptography\u2014PKC 2020, pp. 535\u2013564. Springer, Cham (2020)."},{"key":"1223_CR33","doi-asserted-by":"crossref","unstructured":"Hamburg M.: Decaf: eliminating cofactors through point compression. In: Gennaro R., Robshaw M. (eds.) Advances in Cryptology\u2014CRYPTO 2015, pp. 705\u2013723. Springer, Berlin (2015).","DOI":"10.1007\/978-3-662-47989-6_34"},{"issue":"10","key":"1223_CR34","doi-asserted-by":"publisher","first-page":"4595","DOI":"10.1109\/TIT.2006.881709","volume":"52","author":"F Hess","year":"2006","unstructured":"Hess F., Smart N.P., Vercauteren F.: The eta pairing revisited. IEEE Trans. Inf. Theory 52(10), 4595\u20134602 (2006).","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"3","key":"1223_CR35","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1007\/s10623-011-9558-1","volume":"63","author":"Z Hu","year":"2012","unstructured":"Hu Z., Longa P., Xu M.: Implementing the 4-dimensional GLV method on GLS elliptic curves with j-invariant 0. Des. Codes Cryptogr. 63(3), 331\u2013343 (2012).","journal-title":"Des. Codes Cryptogr."},{"key":"1223_CR36","doi-asserted-by":"crossref","unstructured":"Joux A.: A one round protocol for tripartite Diffie\u2013Hellman. In: Bosma W. (ed.) Algorithmic Number Theory Symposium\u2014ANTS 2000, pp. 385\u2013393. Springer, Berlin (2000).","DOI":"10.1007\/10722028_23"},{"key":"1223_CR37","volume-title":"Identity-based Cryptography. Cryptology and Information Security","author":"M Joye","year":"2009","unstructured":"Joye M., Neven G.: Identity-based Cryptography. Cryptology and Information Security. IOS Press, Amsterdam (2009)."},{"key":"1223_CR38","doi-asserted-by":"publisher","first-page":"126","DOI":"10.1007\/978-3-540-85538-5_9","volume-title":"Pairing-Based Cryptography\u2014Pairing 2008","author":"EJ Kachisa","year":"2008","unstructured":"Kachisa E.J., Schaefer E.F., Scott M.: Constructing Brezing\u2013Weng pairing-friendly elliptic curves using elements in the cyclotomic field. In: Galbraith S.D., Paterson K.G. (eds.) Pairing-Based Cryptography\u2014Pairing 2008, pp. 126\u2013135. Springer, Berlin (2008)."},{"issue":"281","key":"1223_CR39","doi-asserted-by":"publisher","first-page":"555","DOI":"10.1090\/S0025-5718-2012-02625-1","volume":"82","author":"K Karabina","year":"2012","unstructured":"Karabina K.: Squaring in cyclotomic subgroups. Math. Comput. 82(281), 555\u2013579 (2012).","journal-title":"Math. Comput."},{"issue":"6","key":"1223_CR40","doi-asserted-by":"publisher","first-page":"4033","DOI":"10.1109\/TIT.2013.2240763","volume":"59","author":"T Kim","year":"2013","unstructured":"Kim T., Kim S., Cheon J.H.: On the final exponentiation in Tate pairing computations. IEEE Trans. Inf. Theory 59(6), 4033\u20134041 (2013).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"1223_CR41","doi-asserted-by":"crossref","unstructured":"Lim C.H., Lee P.J.: A key recovery attack on discrete log-based schemes using a prime order subgroup. In: Kaliski B.S. (ed.) Advances in Cryptology\u2014CRYPTO 1997, pp. 249\u2013263. Springer, Berlin (1997).","DOI":"10.1007\/BFb0052240"},{"issue":"1","key":"1223_CR42","doi-asserted-by":"publisher","first-page":"106","DOI":"10.1109\/TIT.1978.1055817","volume":"24","author":"S Pohlig","year":"1978","unstructured":"Pohlig S., Hellman M.: An improved algorithm for computing logarithms over GF(p) and its cryptographic significance. IEEE Trans. Inf. Theory 24(1), 106\u2013110 (1978).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"1223_CR43","unstructured":"Scott M.: Unbalancing pairing-based key exchange protocols. Cryptology. ePrint Archive, Paper 2013\/688 (2013). https:\/\/eprint.iacr.org\/2013\/688."},{"key":"1223_CR44","unstructured":"Scott M.: A note on group membership tests for $${\\mathbb{G}}_1$$, $${\\mathbb{G}}_2$$ and $${\\mathbb{G}}_T$$ on BLS pairing-friendly curves. Cryptology. ePrint Archive, Paper 2021\/1130 (2021). https:\/\/eprint.iacr.org\/2021\/1130."},{"key":"1223_CR45","doi-asserted-by":"publisher","first-page":"102","DOI":"10.1007\/978-3-642-03298-1_8","volume-title":"Pairing-Based Cryptography\u2014Pairing 2009","author":"M Scott","year":"2009","unstructured":"Scott M., Benger N., Charlemagne M., Dominguez Perez L.J., Kachisa E.J.: Fast Hashing to $${\\mathbb{G} }_2$$ on pairing-friendly curves. In: Shacham H., Waters B. (eds.) Pairing-Based Cryptography\u2014Pairing 2009, pp. 102\u2013113. Springer, Berlin (2009)."},{"issue":"11","key":"1223_CR46","doi-asserted-by":"publisher","first-page":"2451","DOI":"10.1007\/s10623-018-0457-6","volume":"86","author":"S Tian","year":"2018","unstructured":"Tian S., Li B., Wang K., Yu W.: Cover attacks for elliptic curves with cofactor two. Des. Codes Cryptogr. 86(11), 2451\u20132468 (2018).","journal-title":"Des. Codes Cryptogr."},{"issue":"1","key":"1223_CR47","doi-asserted-by":"publisher","first-page":"455","DOI":"10.1109\/TIT.2009.2034881","volume":"56","author":"F Vercauteren","year":"2009","unstructured":"Vercauteren F.: Optimal pairings. IEEE Trans. Inf. Theory 56(1), 455\u2013461 (2009).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"1223_CR48","doi-asserted-by":"publisher","unstructured":"Washington L.C.: Elliptic Curves. Number Theory and Cryptography, 2nd edn. CRC Press, Boca Raton (2008). https:\/\/doi.org\/10.1201\/9781420071474.","DOI":"10.1201\/9781420071474"}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-023-01223-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10623-023-01223-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-023-01223-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,9,28]],"date-time":"2023-09-28T18:05:22Z","timestamp":1695924322000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10623-023-01223-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,5,29]]},"references-count":48,"journal-issue":{"issue":"10","published-print":{"date-parts":[[2023,10]]}},"alternative-id":["1223"],"URL":"https:\/\/doi.org\/10.1007\/s10623-023-01223-7","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"value":"0925-1022","type":"print"},{"value":"1573-7586","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,5,29]]},"assertion":[{"value":"8 September 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":"28 March 2023","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"29 May 2023","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}