{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,30]],"date-time":"2025-07-30T17:05:03Z","timestamp":1753895103008,"version":"3.41.2"},"reference-count":56,"publisher":"International Association for Cryptologic Research","license":[{"start":{"date-parts":[[2024,1,8]],"date-time":"2024-01-08T00:00:00Z","timestamp":1704672000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IACR CiC"],"accepted":{"date-parts":[[2024,6,4]]},"abstract":"<jats:p>  Decentralized Multi-Client Functional Encryption (DMCFE) extends the basic functional encryption to multiple clients that do not trust each other.   They can independently encrypt the multiple plaintext-inputs to be given for evaluation to the function embedded in the functional decryption key, defined by multiple parameter-inputs. And they keep control on these functions as they all have to contribute to the generation of the functional decryption keys. Tags can be used in the ciphertexts and the keys to specify which inputs can be combined together.   As any encryption scheme, DMCFE provides privacy of the plaintexts. But the functions associated to the functional decryption keys might be sensitive too (e.g. a model in machine learning). The function-hiding property has thus been introduced to additionally protect the function evaluated during the decryption process.<\/jats:p>\n          <jats:p>  In this paper, we provide new proof techniques to analyze a new concrete construction of function-hiding DMCFE for inner products, with strong security guarantees: the adversary can adaptively query multiple challenge ciphertexts and multiple challenge keys, with unbounded repetitions of the same tags in the ciphertext-queries and a fixed polynomially-large number of repetitions of the same tags in the key-queries. Previous constructions were proven secure in the selective setting only. <\/jats:p>","DOI":"10.62056\/andkp2fgx","type":"journal-article","created":{"date-parts":[[2024,7,8]],"date-time":"2024-07-08T15:52:04Z","timestamp":1720453924000},"update-policy":"https:\/\/doi.org\/10.62056\/adfjwm02dj","source":"Crossref","is-referenced-by-count":7,"title":["Decentralized Multi-Client Functional Encryption with Strong Security"],"prefix":"10.62056","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-3867-4209","authenticated-orcid":false,"given":"Ky","family":"Nguyen","sequence":"first","affiliation":[{"name":"DIENS, Ecole normale superieure, CNRS, Inria, PSL University","place":["Paris, 75005, France"]}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6668-683X","authenticated-orcid":false,"given":"David","family":"Pointcheval","sequence":"additional","affiliation":[{"name":"DIENS, Ecole normale superieure, CNRS, Inria, PSL University","place":["Paris, 75005, France"]}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8643-9046","authenticated-orcid":false,"given":"Robert","family":"Sch\u00e4dlich","sequence":"additional","affiliation":[{"name":"DIENS, Ecole normale superieure, CNRS, Inria, PSL University","place":["Paris, 75005, France"]}]}],"member":"48349","published-online":{"date-parts":[[2024,7,8]]},"reference":[{"key":"ref1:EC:SahWat05","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"457","DOI":"10.1007\/11426639_27","article-title":"Fuzzy Identity-Based Encryption","volume-title":"EUROCRYPT\u00a02005","volume":"3494","author":"Amit Sahai","year":"2005"},{"key":"ref2:TCC:BonSahWat11","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1007\/978-3-642-19571-6_16","article-title":"Functional Encryption: Definitions and Challenges","volume-title":"TCC\u00a02011","volume":"6597","author":"Dan Boneh","year":"2011"},{"key":"ref3:C:Shamir84wDOI","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1007\/3-540-39568-7_5","article-title":"Identity-Based Cryptosystems and Signature Schemes","volume-title":"CRYPTO'84","volume":"196","author":"Adi Shamir","year":"1984"},{"key":"ref4:IMA:Cocks01wDOI","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"360","DOI":"10.1007\/3-540-45325-3_32","article-title":"An Identity Based Encryption Scheme Based on Quadratic\n  Residues","volume-title":"8th IMA International Conference on Cryptography and\n  Coding","volume":"2260","author":"Clifford Cocks","year":"2001"},{"key":"ref5:C:BonFra01","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1007\/3-540-44647-8_13","article-title":"Identity-Based Encryption from the Weil Pairing","volume-title":"CRYPTO\u00a02001","volume":"2139","author":"Dan Boneh","year":"2001"},{"key":"ref6:CCS:GPSW06","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1145\/1180405.1180418","article-title":"Attribute-Based Encryption for Fine-Grained Access Control\n  of Encrypted Data","volume-title":"ACM CCS 2006","author":"Vipul Goyal","year":"2006"},{"key":"ref7:CCS:OstSahWat07","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1145\/1315245.1315270","article-title":"Attribute-based encryption with non-monotonic access\n  structures","volume-title":"ACM CCS 2007","author":"Rafail Ostrovsky","year":"2007"},{"key":"ref8:PKC:AttLibPan11","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"90","DOI":"10.1007\/978-3-642-19379-8_6","article-title":"Expressive Key-Policy Attribute-Based Encryption with\n  Constant-Size Ciphertexts","volume-title":"PKC\u00a02011","volume":"6571","author":"Nuttapong Attrapadung","year":"2011"},{"key":"ref9:AC:OkaTak12","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"349","DOI":"10.1007\/978-3-642-34961-4_22","article-title":"Fully Secure Unbounded Inner-Product and Attribute-Based\n  Encryption","volume-title":"ASIACRYPT\u00a02012","volume":"7658","author":"Tatsuaki Okamoto","year":"2012"},{"key":"ref10:PKC:ABDP15","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"733","DOI":"10.1007\/978-3-662-46447-2_33","article-title":"Simple Functional Encryption Schemes for Inner Products","volume-title":"PKC\u00a02015","volume":"9020","author":"Michel Abdalla","year":"2015"},{"key":"ref11:C:AgrLibSte16","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1007\/978-3-662-53015-3_12","article-title":"Fully Secure Functional Encryption for Inner Products, from\n  Standard Assumptions","volume-title":"CRYPTO\u00a02016, Part\u00a0III","volume":"9816","author":"Shweta Agrawal","year":"2016"},{"key":"ref12:PKC:BenBouLip17","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1007\/978-3-662-54388-7_2","article-title":"CCA-Secure Inner-Product Functional Encryption from\n  Projective Hash Functions","volume-title":"PKC\u00a02017, Part\u00a0II","volume":"10175","author":"Fabrice Benhamouda","year":"2017"},{"key":"ref13:AC:CasLagTuc18","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"733","DOI":"10.1007\/978-3-030-03329-3_25","article-title":"Practical Fully Secure Unrestricted Inner Product Functional\n  Encryption Modulo p","volume-title":"ASIACRYPT\u00a02018, Part\u00a0II","volume":"11273","author":"Guilhem Castagnos","year":"2018"},{"key":"ref14:C:BCFG17","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1007\/978-3-319-63688-7_3","article-title":"Practical Functional Encryption for Quadratic Functions with\n  Applications to Predicate Encryption","volume-title":"CRYPTO\u00a02017, Part\u00a0I","volume":"10401","author":"Carmen Elisabetta Zaira Baltico","year":"2017"},{"key":"ref15:PKC:Gay20","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1007\/978-3-030-45374-9_4","article-title":"A New Paradigm for Public-Key Functional Encryption for\n  Degree-2 Polynomials","volume-title":"PKC\u00a02020, Part\u00a0I","volume":"12110","author":"Romain Gay","year":"2020"},{"key":"ref16:EC:AnaSah17","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"152","DOI":"10.1007\/978-3-319-56620-7_6","article-title":"Projective Arithmetic Functional Encryption and\n  Indistinguishability Obfuscation from Degree-5 Multilinear Maps","volume-title":"EUROCRYPT\u00a02017, Part\u00a0I","volume":"10210","author":"Prabhanjan Ananth","year":"2017"},{"key":"ref17:C:Lin17","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"599","DOI":"10.1007\/978-3-319-63688-7_20","article-title":"Indistinguishability Obfuscation from SXDH on 5-Linear\n  Maps and Locality-5 PRGs","volume-title":"CRYPTO\u00a02017, Part\u00a0I","volume":"10401","author":"Huijia Lin","year":"2017"},{"key":"ref18:C:GorVaiWee15","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"503","DOI":"10.1007\/978-3-662-48000-7_25","article-title":"Predicate Encryption for Circuits from LWE","volume-title":"CRYPTO\u00a02015, Part\u00a0II","volume":"9216","author":"Sergey Gorbunov","year":"2015"},{"key":"ref19:C:AnaJai15","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"308","DOI":"10.1007\/978-3-662-47989-6_15","article-title":"Indistinguishability Obfuscation from Compact Functional\n  Encryption","volume-title":"CRYPTO\u00a02015, Part\u00a0I","volume":"9215","author":"Prabhanjan Ananth","year":"2015"},{"key":"ref20:FOCS:BitVai15","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1109\/FOCS.2015.20","article-title":"Indistinguishability Obfuscation from Functional\n  Encryption","volume-title":"56th FOCS","author":"Nir Bitansky","year":"2015"},{"key":"ref21:EC:GGGJKL14","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"578","DOI":"10.1007\/978-3-642-55220-5_32","article-title":"Multi-input Functional Encryption","volume-title":"EUROCRYPT\u00a02014","volume":"8441","author":"Shafi Goldwasser","year":"2014"},{"article-title":"Multi-Input Functional Encryption","year":"2013","author":"S. Dov Gordon","key":"ref22:EPRINT:GKLSZ13"},{"key":"ref23:PKC:DatOkaTom18","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1007\/978-3-319-76581-5_9","article-title":"Full-Hiding (Unbounded) Multi-input Inner Product Functional\n  Encryption from the $k$-Linear Assumption","volume-title":"PKC\u00a02018, Part\u00a0II","volume":"10770","author":"Pratish Datta","year":"2018"},{"key":"ref24:AC:CDGPP18","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"703","DOI":"10.1007\/978-3-030-03329-3_24","article-title":"Decentralized Multi-Client Functional Encryption for Inner\n  Product","volume-title":"ASIACRYPT\u00a02018, Part\u00a0II","volume":"11273","author":"J\u00e9r\u00e9my Chotard","year":"2018"},{"article-title":"Multi-Client Functional Encryption with Repetition for Inner\n  Product","year":"2018","author":"J\u00e9r\u00e9my Chotard","key":"ref25:EPRINT:CDGPP18"},{"key":"ref26:C:ACFGU18","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"597","DOI":"10.1007\/978-3-319-96884-1_20","article-title":"Multi-Input Functional Encryption for Inner Products:\n  Function-Hiding Realizations and Constructions Without Pairings","volume-title":"CRYPTO\u00a02018, Part\u00a0I","volume":"10991","author":"Michel Abdalla","year":"2018"},{"key":"ref27:PKC:ABKW19","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"128","DOI":"10.1007\/978-3-030-17259-6_5","article-title":"Decentralizing Inner-Product Functional Encryption","volume-title":"PKC\u00a02019, Part\u00a0II","volume":"11443","author":"Michel Abdalla","year":"2019"},{"key":"ref28:AC:AbdBenGay19","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"552","DOI":"10.1007\/978-3-030-34618-8_19","article-title":"From Single-Input to Multi-client Inner-Product Functional\n  Encryption","volume-title":"ASIACRYPT\u00a02019, Part\u00a0III","volume":"11923","author":"Michel Abdalla","year":"2019"},{"key":"ref29:AC:LibTit19","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"520","DOI":"10.1007\/978-3-030-34618-8_18","article-title":"Multi-Client Functional Encryption for Linear Functions in\n  the Standard Model from LWE","volume-title":"ASIACRYPT\u00a02019, Part\u00a0III","volume":"11923","author":"Beno\u00eet Libert","year":"2019"},{"key":"ref30:C:CDGPP20","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"747","DOI":"10.1007\/978-3-030-56784-2_25","article-title":"Dynamic Decentralized Functional Encryption","volume-title":"CRYPTO\u00a02020, Part\u00a0I","volume":"12170","author":"J\u00e9r\u00e9my Chotard","year":"2020"},{"key":"ref31:AC:ACGU20","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"467","DOI":"10.1007\/978-3-030-64840-4_16","article-title":"Inner-Product Functional Encryption with Fine-Grained Access\n  Control","volume-title":"ASIACRYPT\u00a02020, Part\u00a0III","volume":"12493","author":"Michel Abdalla","year":"2020"},{"key":"ref32:AC:NguPhaPoi22","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1007\/978-3-031-22963-3_4","article-title":"Multi-Client Functional Encryption with Fine-Grained Access\n  Control","volume-title":"ASIACRYPT\u00a02022, Part\u00a0I","volume":"13791","author":"Ky Nguyen","year":"2022"},{"key":"ref33:C:AgrTomYad23","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"464","DOI":"10.1007\/978-3-031-38551-3_15","article-title":"Attribute-Based Multi-input FE (and More) for\n  Attribute-Weighted Sums","volume-title":"CRYPTO\u00a02023, Part\u00a0IV","volume":"14084","author":"Shweta Agrawal","year":"2023"},{"key":"ref34:C:AgrGoyTom21","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"208","DOI":"10.1007\/978-3-030-84259-8_8","article-title":"Multi-input Quadratic Functional Encryption from Pairings","volume-title":"CRYPTO\u00a02021, Part\u00a0IV","volume":"12828","author":"Shweta Agrawal","year":"2021"},{"key":"ref35:TCC:AgrGoyTom22","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"711","DOI":"10.1007\/978-3-031-22318-1_25","article-title":"Multi-Input Quadratic Functional Encryption: Stronger\n  Security, Broader Functionality","volume-title":"TCC\u00a02022, Part\u00a0I","volume":"13747","author":"Shweta Agrawal","year":"2022"},{"key":"ref36:AC:BisJaiKow15","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"470","DOI":"10.1007\/978-3-662-48797-6_20","article-title":"Function-Hiding Inner Product Encryption","volume-title":"ASIACRYPT\u00a02015, Part\u00a0I","volume":"9452","author":"Allison Bishop","year":"2015"},{"key":"ref37:PKC:DatDutMuk16","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"164","DOI":"10.1007\/978-3-662-49384-7_7","article-title":"Functional Encryption for Inner Product with Full Function\n  Privacy","volume-title":"PKC\u00a02016, Part\u00a0I","volume":"9614","author":"Pratish Datta","year":"2016"},{"key":"ref38:ISC:TomAbeOka16","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"408","DOI":"10.1007\/978-3-319-45871-7_24","article-title":"Efficient Functional Encryption for Inner-Product Values\n  with Full-Hiding Security","volume-title":"ISC\u00a02016","volume":"9866","author":"Junichi Tomida","year":"2016"},{"key":"ref39:TCS:KimKimSeo19","doi-asserted-by":"publisher","first-page":"22","DOI":"10.1016\/J.TCS.2019.03.016","article-title":"A new approach to practical function-private inner product\n  encryption","volume":"783","author":"Sungwook Kim","year":"2019","journal-title":"Theoretical Computer Science"},{"key":"ref40:SCN:KLMMRW18","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"544","DOI":"10.1007\/978-3-319-98113-0_29","article-title":"Function-Hiding Inner Product Encryption Is Practical","volume-title":"SCN 18","volume":"11035","author":"Sam Kim","year":"2018"},{"key":"ref41:AC:Tomida19","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"459","DOI":"10.1007\/978-3-030-34618-8_16","article-title":"Tightly Secure Inner Product Functional Encryption:\n  Multi-input and Function-Hiding Constructions","volume-title":"ASIACRYPT\u00a02019, Part\u00a0III","volume":"11923","author":"Junichi Tomida","year":"2019"},{"key":"ref42:TCS:Tomida20","doi-asserted-by":"publisher","first-page":"56","DOI":"10.1016\/J.TCS.2020.05.008","article-title":"Tightly secure inner product functional encryption:\n  Multi-input and function-hiding constructions","volume":"833","author":"Junichi Tomida","year":"2020","journal-title":"Theoretical Computer Science"},{"key":"ref43:C:OkaTak10","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1007\/978-3-642-14623-7_11","article-title":"Fully Secure Functional Encryption with General Relations\n  from the Decisional Linear Assumption","volume-title":"CRYPTO\u00a02010","volume":"6223","author":"Tatsuaki Okamoto","year":"2010"},{"key":"ref44:EC:OkaTak12","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"591","DOI":"10.1007\/978-3-642-29011-4_35","article-title":"Adaptively Attribute-Hiding (Hierarchical) Inner Product\n  Encryption","volume-title":"EUROCRYPT\u00a02012","volume":"7237","author":"Tatsuaki Okamoto","year":"2012"},{"key":"ref45:TCC:AgrGoyTom21","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"224","DOI":"10.1007\/978-3-030-90453-1_8","article-title":"Multi-Party Functional Encryption","volume-title":"TCC\u00a02021, Part\u00a0II","volume":"13043","author":"Shweta Agrawal","year":"2021"},{"key":"ref46:PKC:ShiVan23","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"622","DOI":"10.1007\/978-3-031-31368-4_22","article-title":"Multi-Client Inner Product Encryption: Function-Hiding\n  Instantiations Without Random Oracles","volume-title":"PKC\u00a02023, Part\u00a0I","volume":"13940","author":"Elaine Shi","year":"2023"},{"key":"ref47:EC:Unal20","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1007\/978-3-030-45721-1_7","article-title":"Impossibility Results for Lattice-Based Functional\n  Encryption Schemes","volume-title":"EUROCRYPT\u00a02020, Part\u00a0I","volume":"12105","author":"Akin \u00dcnal","year":"2020"},{"key":"ref48:C:EHKRV13","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1007\/978-3-642-40084-1_8","article-title":"An Algebraic Framework for Diffie-Hellman Assumptions","volume-title":"CRYPTO\u00a02013, Part\u00a0II","volume":"8043","author":"Alex Escala","year":"2013"},{"key":"ref49:EPRINT:NguPoiSch24","doi-asserted-by":"crossref","DOI":"10.62056\/andkp2fgx","article-title":"Decentralized Multi-Client Functional Encryption with Strong\n  Security","author":"Ky Nguyen","year":"2024"},{"key":"ref50:C:Waters09","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"619","DOI":"10.1007\/978-3-642-03356-8_36","article-title":"Dual System Encryption: Realizing Fully Secure IBE and\n  HIBE under Simple Assumptions","volume-title":"CRYPTO\u00a02009","volume":"5677","author":"Brent Waters","year":"2009"},{"key":"ref51:TCC:LewWat10","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"455","DOI":"10.1007\/978-3-642-11799-2_27","article-title":"New Techniques for Dual System Encryption and Fully Secure\n  HIBE with Short Ciphertexts","volume-title":"TCC\u00a02010","volume":"5978","author":"Allison B. Lewko","year":"2010"},{"key":"ref52:PAIRING:CLLWW12","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"122","DOI":"10.1007\/978-3-642-36334-4_8","article-title":"Shorter IBE and Signatures via Asymmetric Pairings","volume-title":"PAIRING 2012","volume":"7708","author":"Jie Chen","year":"2013"},{"key":"ref53:EC:BelRog06","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"409","DOI":"10.1007\/11761679_25","article-title":"The Security of Triple Encryption and a Framework for\n  Code-Based Game-Playing Proofs","volume-title":"EUROCRYPT\u00a02006","volume":"4004","author":"Mihir Bellare","year":"2006"},{"key":"ref54:ACNS:NguPhaPoi23","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"336","DOI":"10.1007\/978-3-031-33491-7_13","article-title":"Optimal Security Notion for Decentralized Multi-Client\n  Functional Encryption","volume-title":"ACNS 23, Part\u00a0II","volume":"13906","author":"Ky Nguyen","year":"2023"},{"key":"ref55:FOCS:LinVai16","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1109\/FOCS.2016.11","article-title":"Indistinguishability Obfuscation from DDH-Like Assumptions\n  on Constant-Degree Graded Encodings","volume-title":"57th FOCS","author":"Huijia Lin","year":"2016"},{"key":"ref56:JC:JutRoy17","doi-asserted-by":"publisher","first-page":"1116","DOI":"10.1007\/s00145-016-9243-7","article-title":"Shorter Quasi-Adaptive NIZK Proofs for Linear Subspaces","volume":"30","author":"Charanjit S. Jutla","year":"2017","journal-title":"Journal of Cryptology"}],"container-title":["IACR Communications in Cryptology"],"original-title":[],"language":"en","deposited":{"date-parts":[[2024,12,10]],"date-time":"2024-12-10T21:26:51Z","timestamp":1733866011000},"score":1,"resource":{"primary":{"URL":"https:\/\/cic.iacr.org\/p\/1\/2\/3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,7,8]]},"references-count":56,"URL":"https:\/\/doi.org\/10.62056\/andkp2fgx","archive":["Internet Archive","Internet Archive"],"relation":{},"ISSN":["3006-5496"],"issn-type":[{"type":"electronic","value":"3006-5496"}],"subject":[],"published":{"date-parts":[[2024,7,8]]},"assertion":[{"value":"2024-01-08","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2024-06-04","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}}],"article-number":"cc1-1-61"}}