{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,15]],"date-time":"2026-06-15T10:24:37Z","timestamp":1781519077344,"version":"3.54.1"},"reference-count":61,"publisher":"Association for Computing Machinery (ACM)","issue":"1","license":[{"start":{"date-parts":[[2024,2,5]],"date-time":"2024-02-05T00:00:00Z","timestamp":1707091200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"European Union\u2019s Horizon research and innovation","award":["101069688 (CONNECT), 101070627 (REWIRE), 779391 (FutureTPM), 952697 (ASSURED), 101019645 (SECANT) and 101095634 (ENTRUST)"],"award-info":[{"award-number":["101069688 (CONNECT), 101070627 (REWIRE), 779391 (FutureTPM), 952697 (ASSURED), 101019645 (SECANT) and 101095634 (ENTRUST)"]}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"crossref","award":["62072132 and 62261160651"],"award-info":[{"award-number":["62072132 and 62261160651"]}],"id":[{"id":"10.13039\/501100001809","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":[[2024,2,29]]},"abstract":"<jats:p>\n            Group signatures and their variants have been widely used in privacy-sensitive scenarios such as anonymous authentication and attestation. In this paper, we present a new post-quantum group signature scheme from symmetric primitives. Using only symmetric primitives makes the scheme less prone to unknown attacks than basing the design on newly proposed hard problems whose security is less well-understood. However, symmetric primitives do not have rich algebraic properties, and this makes it extremely challenging to design a group signature scheme on top of them. It is even more challenging if we want a group signature scheme suitable for real-world applications, one that can support large groups and require few trust assumptions. Our scheme is based on MPC-in-the-head non-interactive zero-knowledge proofs, and we specifically design a novel hash-based group credential scheme, which is rooted in the SPHINCS+ signature scheme but with various modifications to make it MPC (multi-party computation) friendly. The security of the scheme has been proved under the fully dynamic group signature model. We provide an implementation of the scheme and demonstrate the feasibility of handling a group size as large as 2\n            <jats:sup>60<\/jats:sup>\n            . This is the first group signature scheme from symmetric primitives that supports such a large group size and meets all the security requirements.\n          <\/jats:p>","DOI":"10.1145\/3638763","type":"journal-article","created":{"date-parts":[[2023,12,27]],"date-time":"2023-12-27T22:11:07Z","timestamp":1703715067000},"page":"1-35","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":11,"title":["Sphinx-in-the-Head: Group Signatures from Symmetric Primitives"],"prefix":"10.1145","volume":"27","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-2680-4907","authenticated-orcid":false,"given":"Liqun","family":"Chen","sequence":"first","affiliation":[{"name":"The University of Surrey, UK"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8625-0275","authenticated-orcid":false,"given":"Changyu","family":"Dong","sequence":"additional","affiliation":[{"name":"Guangzhou University, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1262-2192","authenticated-orcid":false,"given":"Christopher J. P.","family":"Newton","sequence":"additional","affiliation":[{"name":"The University of Surrey, UK"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6963-7582","authenticated-orcid":false,"given":"Yalan","family":"Wang","sequence":"additional","affiliation":[{"name":"The University of Surrey, UK"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2024,2,5]]},"reference":[{"key":"e_1_3_2_2_2","doi-asserted-by":"publisher","DOI":"10.1007\/s10623-016-0276-6"},{"key":"e_1_3_2_3_2","unstructured":"Martin Albrecht and Gregory Bard. Accessed in Oct. 2023. The M4RI Library. https:\/\/bitbucket.org\/malb\/m4ri"},{"key":"e_1_3_2_4_2","first-page":"441","volume-title":"PQCrypto","author":"Bansarkhani Rachid El","year":"2018","unstructured":"Rachid El Bansarkhani and Rafael Misoczki. 2018. G-Merkle: A hash-based group signature scheme from standard assumptions. In PQCrypto. 441\u2013463."},{"key":"e_1_3_2_5_2","first-page":"495","volume-title":"PKC","author":"Baum Carsten","year":"2020","unstructured":"Carsten Baum and Ariel Nof. 2020. Concretely-efficient zero-knowledge arguments for arithmetic circuits and their application to lattice-based cryptography. In PKC. 495\u2013526."},{"key":"e_1_3_2_6_2","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1996.548510"},{"key":"e_1_3_2_7_2","first-page":"2129","volume-title":"ACM CCS","author":"Bernstein Daniel J.","year":"2019","unstructured":"Daniel J. Bernstein, Andreas H\u00fclsing, Stefan K\u00f6lbl, Ruben Niederhagen, Joost Rijneveld, and Peter Schwabe. 2019. The SPHINCS \\({}^{\\mbox{+}}\\) signature framework. In ACM CCS. 2129\u20132146."},{"key":"e_1_3_2_8_2","first-page":"95","volume-title":"EUROCRYPT","author":"Beullens Ward","year":"2022","unstructured":"Ward Beullens, Samuel Dobson, Shuichi Katsumata, Yi-Fu Lai, and Federico Pintore. 2022. Group signatures and more from isogenies and lattices: Generic, simple, and efficient. In EUROCRYPT, Orr Dunkelman and Stefan Dziembowski (Eds.). 95\u2013126."},{"key":"e_1_3_2_9_2","first-page":"251","volume-title":"CT-RSA","author":"Boneh Dan","year":"2019","unstructured":"Dan Boneh, Saba Eskandarian, and Ben Fisch. 2019. Post-quantum EPID signatures from symmetric primitives. In CT-RSA. 251\u2013271."},{"key":"e_1_3_2_10_2","doi-asserted-by":"crossref","first-page":"168","DOI":"10.1145\/1030083.1030106","volume-title":"ACM CCS","author":"Boneh Dan","year":"2004","unstructured":"Dan Boneh and Hovav Shacham. 2004. Group signatures with verifier-local revocation. In ACM CCS. 168\u2013177."},{"key":"e_1_3_2_11_2","doi-asserted-by":"publisher","DOI":"10.1007\/s00145-020-09357-w"},{"key":"e_1_3_2_12_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-93387-0_9"},{"key":"e_1_3_2_13_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-99136-8_1"},{"key":"e_1_3_2_14_2","first-page":"247","volume-title":"PQCrypto","author":"Boschini Cecilia","year":"2020","unstructured":"Cecilia Boschini, Jan Camenisch, Max Ovsiankin, and Nicholas Spooner. 2020. Efficient post-quantum snarks for RSIS and RLWE and their applications to privacy. In PQCrypto, Jintai Ding and Jean-Pierre Tillich (Eds.). 247\u2013267."},{"key":"e_1_3_2_15_2","doi-asserted-by":"publisher","DOI":"10.1109\/TDSC.2011.63"},{"key":"e_1_3_2_16_2","doi-asserted-by":"crossref","first-page":"132","DOI":"10.1145\/1030083.1030103","volume-title":"ACM CCS","author":"Brickell Ernest F.","year":"2004","unstructured":"Ernest F. Brickell, Jan Camenisch, and Liqun Chen. 2004. Direct anonymous attestation. In ACM CCS. 132\u2013145."},{"key":"e_1_3_2_17_2","first-page":"194","volume-title":"ESORICS","author":"Buser Maxime","year":"2019","unstructured":"Maxime Buser, Joseph K. Liu, Ron Steinfeld, Amin Sakzad, and Shifeng Sun. 2019. DGM: A dynamic and revocable group Merkle signature. In ESORICS. 194\u2013214."},{"key":"e_1_3_2_18_2","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1145\/586110.586114","volume-title":"ACM CCS","author":"Camenisch Jan","year":"2002","unstructured":"Jan Camenisch and Els Van Herreweghen. 2002. Design and implementation of the idemix anonymous credential system. In ACM CCS. 21\u201330."},{"key":"e_1_3_2_19_2","first-page":"61","volume-title":"CRYPTO","author":"Camenisch Jan","year":"2002","unstructured":"Jan Camenisch and Anna Lysyanskaya. 2002. Dynamic accumulators and application to efficient revocation of anonymous credentials. In CRYPTO. 61\u201376."},{"key":"e_1_3_2_20_2","first-page":"1825","volume-title":"ACM CCS","author":"Chase Melissa","year":"2017","unstructured":"Melissa Chase, David Derler, Steven Goldfeder, Claudio Orlandi, Sebastian Ramacher, Christian Rechberger, Daniel Slamanig, and Greg Zaverucha. 2017. Post-quantum zero-knowledge and signatures from symmetric-key primitives. In ACM CCS. 1825\u20131842."},{"key":"e_1_3_2_21_2","first-page":"257","volume-title":"EUROCRYPT","author":"Chaum David","year":"1991","unstructured":"David Chaum and Eug\u00e8ne van Heyst. 1991. Group signatures. In EUROCRYPT, Donald W. Davies (Ed.). 257\u2013265."},{"key":"e_1_3_2_22_2","article-title":"Group Signatures and Accountable Ring Signatures from Isogeny-based Assumptions","author":"Chung Kai-Min","year":"2021","unstructured":"Kai-Min Chung, Yao-Ching Hsieh, Mi-Ying Huang, Yu-Hsuan Huang, Tanja Lange, and Bo-Yin Yang. 2021. Group Signatures and Accountable Ring Signatures from Isogeny-based Assumptions. Cryptology ePrint Archive, Paper 2021\/1368. https:\/\/eprint.iacr.org\/2021\/1368","journal-title":"Cryptology ePrint Archive, Paper 2021\/1368"},{"key":"e_1_3_2_23_2","first-page":"3022","volume-title":"ACM CCS","author":"Guilhem Cyprien Delpech de Saint","year":"2021","unstructured":"Cyprien Delpech de Saint Guilhem, Emmanuela Orsini, and Titouan Tanguy. 2021. Limbo: Efficient zero-knowledge MPCitH-based arguments. In ACM CCS. 3022\u20133036."},{"key":"e_1_3_2_24_2","first-page":"574","volume-title":"ACM CCS","author":"Pino Rafa\u00ebl del","year":"2018","unstructured":"Rafa\u00ebl del Pino, Vadim Lyubashevsky, and Gregor Seiler. 2018. Lattice-based group signatures and zero-knowledge proofs of automorphism stability. In ACM CCS. 574\u2013591."},{"key":"e_1_3_2_25_2","first-page":"843","volume-title":"ACM CCS","author":"Dobraunig Christoph","year":"2022","unstructured":"Christoph Dobraunig, Daniel Kales, Christian Rechberger, Markus Schofnegger, and Greg Zaverucha. 2022. Shorter signatures based on tailor-made minimalist symmetric-key crypto. In ACM CCS. 843\u2013857."},{"key":"e_1_3_2_26_2","first-page":"567","volume-title":"ACM CCS","author":"Esgin Muhammed F.","year":"2019","unstructured":"Muhammed F. Esgin, Raymond K. Zhao, Ron Steinfeld, Joseph K. Liu, and Dongxi Liu. 2019. MatRiCT: Efficient, scalable and post-quantum blockchain confidential transactions protocol. In ACM CCS, Lorenzo Cavallaro, Johannes Kinder, XiaoFeng Wang, and Jonathan Katz (Eds.). 567\u2013584."},{"key":"e_1_3_2_27_2","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2020.2976073"},{"key":"e_1_3_2_28_2","article-title":"GCC, the GNU Compiler Collection","author":"Inc. Free Software Foundation,","year":"2022","unstructured":"Free Software Foundation, Inc.2022. GCC, the GNU Compiler Collection. https:\/\/gcc.gnu.org","journal-title":"https:\/\/gcc.gnu.org"},{"key":"e_1_3_2_29_2","first-page":"1069","volume-title":"USENIX Security","author":"Giacomelli Irene","year":"2016","unstructured":"Irene Giacomelli, Jesper Madsen, and Claudio Orlandi. 2016. ZKBoo: Faster zero-knowledge for Boolean circuits. In USENIX Security. 1069\u20131083."},{"key":"e_1_3_2_30_2","volume-title":"Foundations of Cryptography: Volume 2, Basic Applications","author":"Goldreich Oded","year":"2009","unstructured":"Oded Goldreich. 2009. Foundations of Cryptography: Volume 2, Basic Applications. Cambridge University Press."},{"key":"e_1_3_2_31_2","article-title":"Dynamic Group Signature Scheme on Lattice with Verifier-local Revocation","author":"Huang Xiuju","year":"2022","unstructured":"Xiuju Huang, Jiashuo Song, and Zichen Li. 2022. Dynamic Group Signature Scheme on Lattice with Verifier-local Revocation. Cryptology ePrint Archive, Paper 2022\/022. https:\/\/eprint.iacr.org\/2022\/022","journal-title":"Cryptology ePrint Archive, Paper 2022\/022"},{"key":"e_1_3_2_32_2","doi-asserted-by":"publisher","DOI":"10.17487\/RFC8391"},{"key":"e_1_3_2_33_2","unstructured":"Intel. 2021. Intel Enhanced Privacy ID (EPID) Security Technology. https:\/\/www.intel.com\/content\/www\/us\/en\/developer\/articles\/technical\/intel-enhanced-privacy-id-epid-security-technology.html"},{"key":"e_1_3_2_34_2","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1145\/1250790.1250794","volume-title":"STOC","author":"Ishai Yuval","year":"2007","unstructured":"Yuval Ishai, Eyal Kushilevitz, Rafail Ostrovsky, and Amit Sahai. 2007. Zero-knowledge from secure multiparty computation. In STOC. 21\u201330."},{"key":"e_1_3_2_35_2","article-title":"Efficient Lifting for Shorter Zero-Knowledge Proofs and Post-Quantum Signatures","author":"Kales Daniel","year":"2022","unstructured":"Daniel Kales and Greg Zaverucha. 2022. Efficient Lifting for Shorter Zero-Knowledge Proofs and Post-Quantum Signatures. Cryptology ePrint Archive, Paper 2022\/588. https:\/\/eprint.iacr.org\/2022\/588","journal-title":"Cryptology ePrint Archive, Paper 2022\/588"},{"key":"e_1_3_2_36_2","article-title":"Forward Secure Efficient Group Signature in Dynamic Setting using Lattices","author":"Kansal Meenakshi","year":"2017","unstructured":"Meenakshi Kansal, Ratna Dutta, and Sourav Mukhopadhyay. 2017. Forward Secure Efficient Group Signature in Dynamic Setting using Lattices. Cryptology ePrint Archive, Paper 2017\/1128. https:\/\/eprint.iacr.org\/2017\/1128","journal-title":"Cryptology ePrint Archive, Paper 2017\/1128"},{"key":"e_1_3_2_37_2","first-page":"312","volume-title":"EUROCRYPT","author":"Katsumata Shuichi","year":"2019","unstructured":"Shuichi Katsumata and Shota Yamada. 2019. Group signatures without NIZK: From lattices in the standard model. In EUROCRYPT. 312\u2013344."},{"key":"e_1_3_2_38_2","first-page":"525","volume-title":"ACM CCS","author":"Katz Jonathan","year":"2018","unstructured":"Jonathan Katz, Vladimir Kolesnikov, and Xiao Wang. 2018. Improved non-interactive zero knowledge with applications to post-quantum signatures. In ACM CCS. 525\u2013537."},{"key":"e_1_3_2_39_2","first-page":"630","volume-title":"EUROCRYPT","author":"Kiayias Aggelos","year":"2003","unstructured":"Aggelos Kiayias and Moti Yung. 2003. Extracting group signatures from traitor tracing schemes. In EUROCRYPT. 630\u2013648."},{"key":"e_1_3_2_40_2","article-title":"AIM: Symmetric primitive for shorter signatures with stronger security","author":"Kim Seongkwang","unstructured":"Seongkwang Kim, Jincheol Ha, Mincheol Son, ByeongHak Lee, Dukjae Moon, Joohee Lee, Sangyup Lee, Jihoon Kwon, Jihoon Cho, Hyojin Yoon, and Jooyoung Lee. 2022\/1387. AIM: Symmetric primitive for shorter signatures with stronger security. Cryptology ePrint Archive (2022\/1387).","journal-title":"Cryptology ePrint Archive"},{"key":"e_1_3_2_41_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-42045-0_3"},{"key":"e_1_3_2_42_2","article-title":"Collusion Resistant Revocable Ring Signatures and Group Signatures from Hard Homogeneous Spaces","author":"Lai Yi-Fu","year":"2021","unstructured":"Yi-Fu Lai and Samuel Dobson. 2021. Collusion Resistant Revocable Ring Signatures and Group Signatures from Hard Homogeneous Spaces. Cryptology ePrint Archive, Paper 2021\/1365. https:\/\/eprint.iacr.org\/2021\/1365","journal-title":"Cryptology ePrint Archive, Paper 2021\/1365"},{"key":"e_1_3_2_43_2","article-title":"Constructing digital signatures from a one-way function","author":"Lamport Leslie","year":"1979","unstructured":"Leslie Lamport. 1979. Constructing digital signatures from a one-way function. Tech. Report: SRI International Computer Science Laboratory (1979).","journal-title":"Tech. Report: SRI International Computer Science Laboratory"},{"key":"e_1_3_2_44_2","first-page":"345","volume-title":"International Workshop on Public Key Cryptography","author":"Langlois Adeline","year":"2014","unstructured":"Adeline Langlois, San Ling, Khoa Nguyen, and Huaxiong Wang. 2014. Lattice-based group signature scheme with verifier-local revocation. In International Workshop on Public Key Cryptography. Springer, 345\u2013361."},{"key":"e_1_3_2_45_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-53890-6_13"},{"key":"e_1_3_2_46_2","first-page":"427","volume-title":"IACR International Workshop on Public Key Cryptography","author":"Ling San","year":"2015","unstructured":"San Ling, Khoa Nguyen, and Huaxiong Wang. 2015. Group signatures from lattices: Simpler, tighter, shorter, ring-based. In IACR International Workshop on Public Key Cryptography. Springer, 427\u2013449."},{"key":"e_1_3_2_47_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-61204-1_15"},{"key":"e_1_3_2_48_2","first-page":"58","volume-title":"IACR International Workshop on Public Key Cryptography","author":"Ling San","year":"2018","unstructured":"San Ling, Khoa Nguyen, Huaxiong Wang, and Yanhong Xu. 2018. Constant-size group signatures from lattices. In IACR International Workshop on Public Key Cryptography. Springer, 58\u201388."},{"key":"e_1_3_2_49_2","first-page":"218","volume-title":"ASIACRYPT","author":"Lyubashevsky Vadim","year":"2021","unstructured":"Vadim Lyubashevsky, Ngoc Khanh Nguyen, Maxime Plan\u00e7on, and Gregor Seiler. 2021. Shorter lattice-based group signatures via \u201calmost free\u201d encryption and other optimizations. In ASIACRYPT, Mehdi Tibouchi and Huaxiong Wang (Eds.). 218\u2013248."},{"key":"e_1_3_2_50_2","first-page":"369","volume-title":"CRYPTO","author":"Merkle Ralph C.","year":"1987","unstructured":"Ralph C. Merkle. 1987. A digital signature based on a conventional encryption function. In CRYPTO. 369\u2013378."},{"key":"e_1_3_2_51_2","first-page":"218","volume-title":"CRYPTO","author":"Merkle Ralph C.","year":"1989","unstructured":"Ralph C. Merkle. 1989. A certified digital signature. In CRYPTO, Gilles Brassard (Ed.). 218\u2013238."},{"key":"e_1_3_2_52_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-34621-8_2"},{"key":"e_1_3_2_53_2","unstructured":"NIST. 2017-2022. Post-Quantum Cryptography Standardization. https:\/\/csrc.nist.gov\/projects\/post-quantum-cryptography\/post-quantum-cryptography-standardization"},{"key":"e_1_3_2_54_2","article-title":"NIST Announces First Four Quantum-Resistant Cryptographic Algorithms","year":"2022","unstructured":"NIST. 2022. NIST Announces First Four Quantum-Resistant Cryptographic Algorithms. https:\/\/nist.gov\/news-events\/news\/2022\/07\/nist-announces-first-four-quantum-resistant-cryptographic-algorithms","journal-title":"https:\/\/nist.gov\/news-events\/news\/2022\/07\/nist-announces-first-four-quantum-resistant-cryptographic-algorithms"},{"key":"e_1_3_2_55_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-981-33-4084-8_60"},{"key":"e_1_3_2_56_2","first-page":"715","volume-title":"International Workshop on Public Key Cryptography","author":"Sakai Yusuke","year":"2012","unstructured":"Yusuke Sakai, Jacob C. N. Schuldt, Keita Emura, Goichiro Hanaoka, and Kazuo Ohta. 2012. On the security of dynamic group signatures: Preventing signature hijacking. In International Workshop on Public Key Cryptography. Springer, 715\u2013732."},{"key":"e_1_3_2_57_2","first-page":"239","volume-title":"CRYPTO","author":"Schnorr Claus-Peter","year":"1989","unstructured":"Claus-Peter Schnorr. 1989. Efficient identification and signatures for smart cards. In CRYPTO. 239\u2013252."},{"key":"e_1_3_2_58_2","doi-asserted-by":"publisher","DOI":"10.1007\/s10623-021-00857-9"},{"key":"e_1_3_2_59_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-21031-0_14"},{"key":"e_1_3_2_60_2","first-page":"136","volume-title":"CANS","author":"Yehia Mahmoud","year":"2021","unstructured":"Mahmoud Yehia, Riham AlTawy, and T. Aaron Gulliver. 2021. GM \\({}^{\\mbox{MT}}\\) : A revocable group Merkle multi-tree signature scheme. In CANS. 136\u2013157."},{"key":"e_1_3_2_61_2","first-page":"61","volume-title":"Inscrypt","author":"Yehia Mahmoud","year":"2021","unstructured":"Mahmoud Yehia, Riham AlTawy, and T. Aaron Gulliver. 2021. Security analysis of DGM and GM group signature schemes instantiated with XMSS-T. In Inscrypt. 61\u201381."},{"key":"e_1_3_2_62_2","unstructured":"Greg Zaverucha Sebastian Ramacher Daniel Kales and Steven Goldfeder. 2020. Reference Implementation of the Picnic Post-quantum Signature Scheme. https:\/\/github.com\/Microsoft\/Picnic"}],"container-title":["ACM Transactions on Privacy and Security"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3638763","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3638763","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T00:03:33Z","timestamp":1750291413000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3638763"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,2,5]]},"references-count":61,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2024,2,29]]}},"alternative-id":["10.1145\/3638763"],"URL":"https:\/\/doi.org\/10.1145\/3638763","relation":{},"ISSN":["2471-2566","2471-2574"],"issn-type":[{"value":"2471-2566","type":"print"},{"value":"2471-2574","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,2,5]]},"assertion":[{"value":"2023-01-04","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2023-12-06","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2024-02-05","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}