{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:47:56Z","timestamp":1750308476649,"version":"3.41.0"},"reference-count":41,"publisher":"Association for Computing Machinery (ACM)","issue":"3","license":[{"start":{"date-parts":[[2023,7,19]],"date-time":"2023-07-19T00:00:00Z","timestamp":1689724800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100001665","name":"French National Research Agency","doi-asserted-by":"crossref","award":["TECAP ANR-17-CE39-0004-01"],"award-info":[{"award-number":["TECAP ANR-17-CE39-0004-01"]}],"id":[{"id":"10.13039\/501100001665","id-type":"DOI","asserted-by":"crossref"}]},{"name":"National Funds through the FCT","award":["PTDC\/CCI-INF\/31698\/2017"],"award-info":[{"award-number":["PTDC\/CCI-INF\/31698\/2017"]}]},{"name":"France 2030 program managed by the French National Research Agency","award":["ANR-22-PECY-0006"],"award-info":[{"award-number":["ANR-22-PECY-0006"]}]},{"DOI":"10.13039\/100000006","name":"Office of Naval Research","doi-asserted-by":"crossref","award":["N00014-15-1-2750"],"award-info":[{"award-number":["N00014-15-1-2750"]}],"id":[{"id":"10.13039\/100000006","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Priv. Secur."],"published-print":{"date-parts":[[2023,8,30]]},"abstract":"<jats:p>In this work, we enhance the EasyCrypt proof assistant to reason about the computational complexity of adversaries. The key technical tool is a Hoare logic for reasoning about computational complexity (execution time and oracle calls) of adversarial computations. Our Hoare logic is built on top of the module system used by EasyCrypt for modeling adversaries. We prove that our logic is sound w.r.t. the semantics of EasyCrypt programs\u2014we also provide full semantics for the EasyCrypt module system, which was lacking previously.<\/jats:p>\n          <jats:p>We showcase (for the first time in EasyCrypt and in other computer-aided cryptographic tools) how our approach can express precise relationships between the probability of adversarial success and their execution time. In particular, we can quantify existentially over adversaries in a complexity class and express general composition statements in simulation-based frameworks. Moreover, such statements can be composed to derive standard concrete security bounds for cryptographic constructions whose security is proved in a modular way. As a main benefit of our approach, we revisit security proofs of some well-known cryptographic constructions and present a new formalization of universal composability.<\/jats:p>","DOI":"10.1145\/3589962","type":"journal-article","created":{"date-parts":[[2023,3,31]],"date-time":"2023-03-31T12:19:46Z","timestamp":1680265186000},"page":"1-34","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["Mechanized Proofs of Adversarial Complexity and Application to Universal Composability"],"prefix":"10.1145","volume":"26","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-6848-5564","authenticated-orcid":false,"given":"Manuel","family":"Barbosa","sequence":"first","affiliation":[{"name":"University of Porto (FCUP) &amp; INESC TEC"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3853-1777","authenticated-orcid":false,"given":"Gilles","family":"Barthe","sequence":"additional","affiliation":[{"name":"MPI-SP and IMDEA Software Institute"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6650-9924","authenticated-orcid":false,"given":"Benjamin","family":"Gr\u00e9goire","sequence":"additional","affiliation":[{"name":"Inria &amp; Universit\u00e9 C\u00f4te d\u2019Azur"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5891-154X","authenticated-orcid":false,"given":"Adrien","family":"Koutsos","sequence":"additional","affiliation":[{"name":"Inria"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8196-7875","authenticated-orcid":false,"given":"Pierre-Yves","family":"Strub","sequence":"additional","affiliation":[{"name":"Meta"}]}],"member":"320","published-online":{"date-parts":[[2023,7,19]]},"reference":[{"issue":"1","key":"e_1_3_2_2_2","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1016\/j.entcs.2009.12.008","article-title":"Termination and cost analysis with COSTA and its user interfaces","volume":"258","author":"Albert Elvira","year":"2009","unstructured":"Elvira Albert, Puri Arenas, Samir Genaim, Miguel G\u00f3mez-Zamalloa, German Puebla, D. Ram\u00edrez, G. Rom\u00e1n, and Damiano Zanardini. 2009. Termination and cost analysis with COSTA and its user interfaces. Electr. Notes Theor. Comput. Sci. 258, 1 (2009), 109\u2013121.","journal-title":"Electr. Notes Theor. Comput. Sci."},{"key":"e_1_3_2_3_2","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1145\/3319535.3354228","volume-title":"Proceedings of the 2019 ACM SIGSAC Conference on Computer and Communications Security (CCS\u201919)","author":"Almeida Jos\u00e9 Bacelar","year":"2019","unstructured":"Jos\u00e9 Bacelar Almeida, Manuel Barbosa, Gilles Barthe, Matthew Campagna, Ernie Cohen, Benjamin Gr\u00e9goire, Vitor Pereira, Bernardo Portela, Pierre-Yves Strub, and Serdar Tasiran. 2019. A machine-checked proof of security for AWS key management service. In Proceedings of the 2019 ACM SIGSAC Conference on Computer and Communications Security (CCS\u201919). ACM, New York, NY, 63\u201378. 10.1145\/3319535.3354228"},{"key":"e_1_3_2_4_2","doi-asserted-by":"crossref","first-page":"1607","DOI":"10.1145\/3319535.3363211","volume-title":"Proceedings of the 2019 ACM SIGSAC Conference on Computer and Communications Security (CCS\u201919)","author":"Almeida Jos\u00e9 Bacelar","year":"2019","unstructured":"Jos\u00e9 Bacelar Almeida, Cecile Baritel-Ruet, Manuel Barbosa, Gilles Barthe, Fran\u00e7ois Dupressoir, Benjamin Gr\u00e9goire, Vincent Laporte, Tiago Oliveira, Alley Stoughton, and Pierre-Yves Strub. 2019. Machine-checked proofs for cryptographic standards: Indifferentiability of sponge and secure high-assurance implementations of SHA-3. In Proceedings of the 2019 ACM SIGSAC Conference on Computer and Communications Security (CCS\u201919). ACM, New York, NY, 1607\u20131622. 10.1145\/3319535.3363211"},{"doi-asserted-by":"crossref","unstructured":"Patrick Baillot Gilles Barthe and Ugo Dal Lago. 2015. Implicit computational complexity of subrecursive definitions and applications to cryptographic proofs. In Logic for Programming Artificial Intelligence and Reasoning . Lecture Notes in Computer Science Vol. 9450. Springer 203\u2013218. 10.1007\/978-3-662-48899-7_15","key":"e_1_3_2_5_2","DOI":"10.1007\/978-3-662-48899-7_15"},{"key":"e_1_3_2_6_2","doi-asserted-by":"crossref","first-page":"777","DOI":"10.1109\/SP40001.2021.00008","volume-title":"Proceedings of the 2021 IEEE Symposium on Security and Privacy (SP\u201921)","author":"Barbosa Manuel","year":"2021","unstructured":"Manuel Barbosa, Gilles Barthe, Karthikeyan Bhargavan, Bruno Blanchet, Cas Cremers, Kevin Liao, and Bryan Parno. 2021. SoK: Computer-aided cryptography. In Proceedings of the 2021 IEEE Symposium on Security and Privacy (SP\u201921). IEEE, Los Alamitos, CA, 777\u2013795. 10.1109\/SP40001.2021.00008"},{"key":"e_1_3_2_7_2","doi-asserted-by":"crossref","first-page":"2541","DOI":"10.1145\/3460120.3484548","volume-title":"Proceedings of the 2021 ACM SIGSAC Conference on Computer and Communications Security (CCS\u201921)","author":"Barbosa Manuel","year":"2021","unstructured":"Manuel Barbosa, Gilles Barthe, Benjamin Gr\u00e9goire, Adrien Koutsos, and Pierre-Yves Strub. 2021. Mechanized proofs of adversarial complexity and application to universal composability. In Proceedings of the 2021 ACM SIGSAC Conference on Computer and Communications Security (CCS\u201921). ACM, New York, NY, 2541\u20132563."},{"doi-asserted-by":"crossref","unstructured":"Manuel Barbosa Gilles Barthe Benjamin Gr\u00e9goire Adrien Koutsos and Pierre-Yves Strub. 2023. Mechanized Proofs of Adversarial Complexity and Application to Universal Composability. Retrieved April 12 2023 from https:\/\/hal.inria.fr\/hal-04048217.","key":"e_1_3_2_8_2","DOI":"10.1145\/3589962"},{"key":"e_1_3_2_9_2","first-page":"375","volume-title":"Proceedings of the 17th ACM Conference on Computer and Communications Security (CCS\u201910)","author":"Barthe Gilles","year":"2010","unstructured":"Gilles Barthe, Marion Daubignard, Bruce M. Kapron, and Yassine Lakhnech. 2010. Computational indistinguishability logic. In Proceedings of the 17th ACM Conference on Computer and Communications Security (CCS\u201910). ACM, New York, NY, 375\u2013386. 10.1145\/1866307.1866350"},{"doi-asserted-by":"crossref","unstructured":"Gilles Barthe Fran\u00e7ois Dupressoir Benjamin Gr\u00e9goire C\u00e9sar Kunz Benedikt Schmidt and Pierre-Yves Strub. 2013. EasyCrypt: A tutorial. In Foundations of Security Analysis and Design VII . Lecture Notes in Computer Science Vol. 8604. Springer 146\u2013166. 10.1007\/978-3-319-10082-1_6","key":"e_1_3_2_10_2","DOI":"10.1007\/978-3-319-10082-1_6"},{"unstructured":"Gilles Barthe Marco Gaboardi Benjamin Gr\u00e9goire Justin Hsu and Pierre-Yves Strub. 2016. A program logic for union bounds. In 43rd International Colloquium on Automata Languages and Programming (ICALP 2016) Ioannis Chatzigiannakis Michael Mitzenmacher Yuval Rabani and Davide Sangiorgi (Eds.). Leibniz International Proceedings in Informatics Vol. 55. Schloss Dagstuhl\u2013Leibniz-Zentrum f\u00fcr Informatik Dagstuhl Germany Article 107 15 pages. 10.4230\/LIPIcs.ICALP.2016.107","key":"e_1_3_2_11_2"},{"key":"e_1_3_2_12_2","first-page":"90","volume-title":"Proceedings of the 36th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL\u201909)","author":"Barthe Gilles","year":"2009","unstructured":"Gilles Barthe, Benjamin Gr\u00e9goire, and Santiago Zanella B\u00e9guelin. 2009. Formal certification of code-based cryptographic proofs. In Proceedings of the 36th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL\u201909). ACM, New York, NY, 90\u2013101. 10.1145\/1480881.1480894"},{"doi-asserted-by":"crossref","unstructured":"Gilles Barthe Benjamin Gr\u00e9goire Sylvain Heraud and Santiago Zanella B\u00e9guelin. 2011. Computer-aided security proofs for the working cryptographer. In Advances in Cryptology\u2014CRYPTO 2011 . Lecture Notes in Computer Science Vol. 6841. Springer 71\u201390. 10.1007\/978-3-642-22792-9_5","key":"e_1_3_2_13_2","DOI":"10.1007\/978-3-642-22792-9_5"},{"doi-asserted-by":"publisher","key":"e_1_3_2_14_2","DOI":"10.1007\/s00145-019-09341-z"},{"key":"e_1_3_2_15_2","doi-asserted-by":"crossref","first-page":"62","DOI":"10.1145\/168588.168596","volume-title":"Proceedings of the 1st ACM Conference on Computer and Communications Security (CCS\u201993)","author":"Bellare Mihir","year":"1993","unstructured":"Mihir Bellare and Phillip Rogaway. 1993. Random oracles are practical: A paradigm for designing efficient protocols. In Proceedings of the 1st ACM Conference on Computer and Communications Security (CCS\u201993). ACM, New York, NY, 62\u201373. 10.1145\/168588.168596"},{"key":"e_1_3_2_16_2","first-page":"140","volume-title":"Proceedings of the 2006 IEEE Symposium on Security and Privacy (S&P\u201906)","author":"Blanchet Bruno","year":"2006","unstructured":"Bruno Blanchet. 2006. A computationally sound mechanized prover for security protocols. In Proceedings of the 2006 IEEE Symposium on Security and Privacy (S&P\u201906). IEEE, Los Alamitos, CA, 140\u2013154. 10.1109\/SP.2006.1"},{"doi-asserted-by":"crossref","unstructured":"Marc Brockschmidt Fabian Emmes Stephan Falke Carsten Fuhs and J\u00fcrgen Giesl. 2014. Alternating runtime and size complexity analysis of integer programs. In Tools and Algorithms for the Construction and Analysis of Systems . Lecture Notes in Computer Science Vol. 8413. Springer 140\u2013155.","key":"e_1_3_2_17_2","DOI":"10.1007\/978-3-642-54862-8_10"},{"doi-asserted-by":"crossref","unstructured":"Chris Brzuska Antoine Delignat-Lavaud C\u00e9dric Fournet Konrad Kohbrok and Markulf Kohlweiss. 2018. State separation for code-based game-playing proofs. In Advances in Cryptology\u2014ASIACRYPT 2018 . Lecture Notes in Computer Science Vol. 11274. Springer 222\u2013249. 10.1007\/978-3-030-03332-3_9","key":"e_1_3_2_18_2","DOI":"10.1007\/978-3-030-03332-3_9"},{"key":"e_1_3_2_19_2","article-title":"Universally Composable Security: A New Paradigm for Cryptographic Protocols","author":"Canetti Ran","year":"2000","unstructured":"Ran Canetti. 2000. Universally Composable Security: A New Paradigm for Cryptographic Protocols. Report 2000\/067. Cryptology ePrint Archive. https:\/\/eprint.iacr.org\/2000\/067.","journal-title":"Report 2000\/067"},{"key":"e_1_3_2_20_2","first-page":"136","volume-title":"Proceedings of the 42nd Annual Symposium on Foundations of Computer Science (FOCS\u201901)","author":"Canetti Ran","year":"2001","unstructured":"Ran Canetti. 2001. Universally composable security: A new paradigm for cryptographic protocols. In Proceedings of the 42nd Annual Symposium on Foundations of Computer Science (FOCS\u201901). IEEE, Los Alamitos, CA, 136\u2013145. 10.1109\/SFCS.2001.959888"},{"key":"e_1_3_2_21_2","first-page":"IEEE, Los Alami","volume-title":"Proceedings of the 42nd Annual Symposium on Foundations of Computer Science","author":"Canetti Ran","year":"2001","unstructured":"Ran Canetti. 2001. Universally composable security: A new paradigm for cryptographic protocols. In Proceedings of the 42nd Annual Symposium on Foundations of Computer Science(FOCS\u201901). IEEE, Los Alamitos, CA, 136\u2013145. 10.1109\/SFCS.2001.959888"},{"key":"e_1_3_2_22_2","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1007\/978-3-662-48000-7_1","volume-title":"Advances in Cryptology\u2014CRYPTO 2015","author":"Canetti Ran","year":"2015","unstructured":"Ran Canetti, Asaf Cohen, and Yehuda Lindell. 2015. A simpler variant of universally composable security for standard multiparty computation. In Advances in Cryptology\u2014CRYPTO 2015. Lecture Notes in Computer Science, Vol. 9216. Springer, 3\u201322."},{"key":"e_1_3_2_23_2","first-page":"167","volume-title":"Proceedings of the 32nd IEEE Computer Security Foundations Symposium (CSF\u201919)","author":"Canetti Ran","year":"2019","unstructured":"Ran Canetti, Alley Stoughton, and Mayank Varia. 2019. EasyUC: Using easycrypt to mechanize proofs of universally composable security. In Proceedings of the 32nd IEEE Computer Security Foundations Symposium (CSF\u201919). IEEE, Los Alamitos, CA, 167\u2013183. 10.1109\/CSF.2019.00019"},{"key":"e_1_3_2_24_2","first-page":"133","volume-title":"Proceedings of the 2011 IEEE 26th Annual Symposium on Logic in Computer Science (LICS\u201911)","author":"Lago Ugo Dal","year":"2011","unstructured":"Ugo Dal Lago and Marco Gaboardi. 2011. Linear dependent types and relative completeness. In Proceedings of the 2011 IEEE 26th Annual Symposium on Logic in Computer Science (LICS\u201911). 133\u2013142."},{"unstructured":"The EasyCrypt Development Team. 2021. Source Code of Our EasyCrypt. Retrieved April 12 2023 from https:\/\/github.com\/EasyCrypt\/easycrypt.","key":"e_1_3_2_25_2"},{"doi-asserted-by":"publisher","key":"e_1_3_2_26_2","DOI":"10.1007\/s00145-009-9050-5"},{"key":"e_1_3_2_27_2","first-page":"127","volume-title":"Proceedings of the 36th Annual Symposium on Principles of Programming Languages (POPL\u201909)","author":"Gulwani Sumit","year":"2009","unstructured":"Sumit Gulwani, Krishna K. Mehra, and Trishul Chilimbi. 2009. SPEED: Precise and efficient static estimation of program computational complexity. In Proceedings of the 36th Annual Symposium on Principles of Programming Languages (POPL\u201909). 127\u2013139."},{"key":"e_1_3_2_28_2","first-page":"119","volume-title":"Proceedings of the 31st IEEE Computer Security Foundations Symposium (CSF\u201918)","author":"Haagh Helene","year":"2018","unstructured":"Helene Haagh, Aleksandr Karbyshev, Sabine Oechsner, Bas Spitters, and Pierre-Yves Strub. 2018. Computer-aided proofs for multiparty computation with active security. In Proceedings of the 31st IEEE Computer Security Foundations Symposium (CSF\u201918). IEEE, Los Alamitos, CA, 119\u2013131. 10.1109\/CSF.2018.00016"},{"unstructured":"Shai Halevi. 2005. A Plausible Approach to Computer-Aided Cryptographic Proofs . Paper 2005\/181. IACR Cryptology ePrint Archive. http:\/\/eprint.iacr.org\/2005\/181.","key":"e_1_3_2_29_2"},{"doi-asserted-by":"publisher","key":"e_1_3_2_30_2","DOI":"10.1145\/3371105"},{"key":"e_1_3_2_31_2","volume-title":"Types with Potential: Polynomial Resource Bounds via Automatic Amortized Analysis","author":"Hoffmann Jan","year":"2011","unstructured":"Jan Hoffmann. 2011. Types with Potential: Polynomial Resource Bounds via Automatic Amortized Analysis. Ph. D. Dissertation. Ludwig-Maximilians-Universi\u00e4t M\u00fcnchen."},{"doi-asserted-by":"crossref","unstructured":"Benjamin Lucien Kaminski Joost-Pieter Katoen Christoph Matheja and Federico Olmedo. 2016. Weakest precondition reasoning for expected run-times of probabilistic programs. In Programming Languages and Systems . Lecture Note in Computer Science Vol. 9632. Springer 364\u2013389. 10.1007\/978-3-662-49498-1_15","key":"e_1_3_2_32_2","DOI":"10.1007\/978-3-662-49498-1_15"},{"doi-asserted-by":"publisher","key":"e_1_3_2_33_2","DOI":"10.1016\/0022-0000(85)90012-1"},{"key":"e_1_3_2_34_2","first-page":"142","volume-title":"Proceedings of the 22nd ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL\u201995)","author":"Leroy Xavier","year":"1995","unstructured":"Xavier Leroy. 1995. Applicative functors and fully transparent higher-order modules. In Proceedings of the 22nd ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL\u201995). ACM, New York, NY, 142\u2013153."},{"key":"e_1_3_2_35_2","doi-asserted-by":"crossref","first-page":"640","DOI":"10.1145\/3314221.3314607","volume-title":"Proceedings of the 40th ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI\u201919)","author":"Liao Kevin","year":"2019","unstructured":"Kevin Liao, Matthew A. Hammer, and Andrew Miller. 2019. ILC: A calculus for composable, computational cryptography. In Proceedings of the 40th ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI\u201919). ACM, New York, NY, 640\u2013654. 10.1145\/3314221.3314607"},{"doi-asserted-by":"publisher","key":"e_1_3_2_36_2","DOI":"10.1145\/229542.229547"},{"key":"e_1_3_2_37_2","first-page":"496","volume-title":"Proceedings of the 39th ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI\u201918)","author":"Ngo Van Chan","year":"2018","unstructured":"Van Chan Ngo, Quentin Carbonneaux, and Jan Hoffmann. 2018. Bounded expectations: Resource analysis for probabilistic programs. In Proceedings of the 39th ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI\u201918). ACM, New York, NY, 496\u2013512."},{"doi-asserted-by":"publisher","key":"e_1_3_2_38_2","DOI":"10.1016\/0167-6423(87)90029-3"},{"key":"e_1_3_2_39_2","doi-asserted-by":"crossref","first-page":"481","DOI":"10.1109\/CSF.2015.36","volume-title":"Proceedings of the IEEE 28th Computer Security Foundations Symposium (CSF\u201915)","author":"Petcher Adam","year":"2015","unstructured":"Adam Petcher and Greg Morrisett. 2015. A mechanized proof of security for searchable symmetric encryption. In Proceedings of the IEEE 28th Computer Security Foundations Symposium (CSF\u201915). IEEE, Los Alamitos, CA, 481\u2013494."},{"doi-asserted-by":"publisher","key":"e_1_3_2_40_2","DOI":"10.1145\/3158124"},{"key":"e_1_3_2_41_2","volume-title":"The Joy of Cryptography","author":"Rosulek Mike","year":"2020","unstructured":"Mike Rosulek. 2020. The Joy of Cryptography. Retrieved April 12, 2023 from https:\/\/joyofcryptography.com."},{"doi-asserted-by":"crossref","unstructured":"Asankhaya Sharma Shengyi Wang Andreea Costea Aquinas Hobor and Wei-Ngan Chin. 2015. Certified reasoning with infinity. In FM 2015: Formal Methods . Lecture Notes in Computer Science Vol. 9109. Springer 496\u2013513. 10.1007\/978-3-319-19249-9_31","key":"e_1_3_2_42_2","DOI":"10.1007\/978-3-319-19249-9_31"}],"container-title":["ACM Transactions on Privacy and Security"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3589962","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3589962","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T18:43:05Z","timestamp":1750272185000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3589962"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,7,19]]},"references-count":41,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2023,8,30]]}},"alternative-id":["10.1145\/3589962"],"URL":"https:\/\/doi.org\/10.1145\/3589962","relation":{},"ISSN":["2471-2566","2471-2574"],"issn-type":[{"type":"print","value":"2471-2566"},{"type":"electronic","value":"2471-2574"}],"subject":[],"published":{"date-parts":[[2023,7,19]]},"assertion":[{"value":"2022-08-22","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2023-03-13","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2023-07-19","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}