{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,11]],"date-time":"2026-07-11T17:35:23Z","timestamp":1783791323103,"version":"3.55.0"},"publisher-location":"New York, NY, USA","reference-count":57,"publisher":"ACM","license":[{"start":{"date-parts":[[2024,12,2]],"date-time":"2024-12-02T00:00:00Z","timestamp":1733097600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100006374","name":"Bundesministerium f\u00fcr Bildung und Forschung","doi-asserted-by":"publisher","award":["16KIS1038"],"award-info":[{"award-number":["16KIS1038"]}],"id":[{"id":"10.13039\/501100006374","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100006374","name":"Bundesministerium f\u00fcr Bildung und Forschung","doi-asserted-by":"publisher","award":["16KISK038"],"award-info":[{"award-number":["16KISK038"]}],"id":[{"id":"10.13039\/501100006374","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100006374","name":"Bundesministerium f\u00fcr Bildung und Forschung","doi-asserted-by":"publisher","award":["16KIS1044"],"award-info":[{"award-number":["16KIS1044"]}],"id":[{"id":"10.13039\/501100006374","id-type":"DOI","asserted-by":"publisher"}]},{"name":"French National Research Agency","award":["ANR-18-CE-39-0019-02,ANR-21-ASTR-0016"],"award-info":[{"award-number":["ANR-18-CE-39-0019-02,ANR-21-ASTR-0016"]}]},{"DOI":"10.13039\/501100006374","name":"Deutsche Forschungsgemeinschaft","doi-asserted-by":"publisher","award":["390781972"],"award-info":[{"award-number":["390781972"]}],"id":[{"id":"10.13039\/501100006374","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2024,12,2]]},"DOI":"10.1145\/3658644.3670297","type":"proceedings-article","created":{"date-parts":[[2024,12,9]],"date-time":"2024-12-09T12:19:20Z","timestamp":1733746760000},"page":"1523-1537","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":18,"title":["Practical Post-Quantum Signatures for Privacy"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0009-0009-5544-6417","authenticated-orcid":false,"given":"Sven","family":"Argo","sequence":"first","affiliation":[{"name":"Faculty of Computer Science, HGI, Ruhr University Bochum, Bochum, Germany"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3293-4989","authenticated-orcid":false,"given":"Tim","family":"G\u00fcneysu","sequence":"additional","affiliation":[{"name":"Faculty of Computer Science, HGI, Ruhr University Bochum & Cyber Physical Systems, DFKI GmbH, Bochum, Germany"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2869-3833","authenticated-orcid":false,"given":"Corentin","family":"Jeudy","sequence":"additional","affiliation":[{"name":"Orange Labs, Applied Crypto Group & Univ Rennes, CNRS, IRISA, Cesson-S\u00e9vign\u00e9, France"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1533-3583","authenticated-orcid":false,"given":"Georg","family":"Land","sequence":"additional","affiliation":[{"name":"Faculty of Computer Science, HGI, Ruhr-University Bochum, Bochum, Germany"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0617-9606","authenticated-orcid":false,"given":"Adeline","family":"Roux-Langlois","sequence":"additional","affiliation":[{"name":"Normandie Univ, UNICAEN, ENSICAEN, CNRS, GREYC, Caen, France"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1283-7257","authenticated-orcid":false,"given":"Olivier","family":"Sanders","sequence":"additional","affiliation":[{"name":"Orange Labs, Cesson-S\u00e9vign\u00e9, France"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2024,12,9]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"crossref","unstructured":"M. R. Albrecht R. Player and S. Scott. 2015. On the Concrete Hardness of Learning With Errors. J. Math. Cryptol. (2015).","DOI":"10.1515\/jmc-2015-0016"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"crossref","unstructured":"S. Argo T. G\u00fcneysu C. Jeudy G. Land A. Roux-Langlois and O. Sanders. 2024. Practical Post-Quantum Signatures for Privacy. IACR Cryptol. ePrint Arch. (2024) 131.","DOI":"10.1145\/3658644.3670297"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","unstructured":"S. Bai T. Lepoint A. Roux-Langlois A. Sakzad D. Stehl\u00e9 and R. Steinfeld. 2018. Improved Security Proofs in Lattice-Based Cryptography: Using the R\u00e9nyi Divergence Rather than the Statistical Distance. J. Cryptol. (2018). https:\/\/doi.org\/10.1007\/s00145-017--9265--9","DOI":"10.1007\/s00145-017--9265--9"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"crossref","unstructured":"W. Banaszczyk. 1993. New Bounds in Some Transference Theorems in the Geometry of Numbers. Math. Ann. (1993).","DOI":"10.1007\/BF01445125"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","unstructured":"A. Barki N. Desmoulins S. Gharout and J. Traor\u00e9. 2017. Anonymous attestations made practical. In WISEC. https:\/\/doi.org\/10.1145\/3098243.3098258","DOI":"10.1145\/3098243.3098258"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","unstructured":"M. Bellare H. Shi and C. Zhang. 2005. Foundations of Group Signatures: The Case of Dynamic Groups. In CT-RSA. https:\/\/doi.org\/10.1007\/978--3--540--30574--3_11","DOI":"10.1007\/978--3--540--30574--3_11"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","unstructured":"P. Bert G. Eberhart L. Prabel A. Roux-Langlois and M. Sabt. 2021. Implementation of Lattice Trapdoors on Modules and Applications. In PQCrypto. https:\/\/doi.org\/10.1007\/978--3-030--81293--5_11","DOI":"10.1007\/978--3-030--81293--5_11"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","unstructured":"O. Blazy C. Chevalier G. Renaut T. Ricosset E. Sageloli and H. Senet. 2023. Efficient Implementation of a Post-Quantum Anonymous Credential Protocol. In ARES. https:\/\/doi.org\/10.1145\/3600160.3600188","DOI":"10.1145\/3600160.3600188"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","unstructured":"D. Boneh and X. Boyen. 2008. Short Signatures Without Random Oracles and the SDH Assumption in Bilinear Groups. J. Cryptol. (2008). https:\/\/doi.org\/10.1007\/s00145-007--9005--7","DOI":"10.1007\/s00145-007--9005--7"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","unstructured":"D. Boneh S. Eskandarian and B. Fisch. 2019. Post-quantum EPID Signatures from Symmetric Primitives. In CT-RSA. https:\/\/doi.org\/10.1007\/978--3-030--12612--4_13","DOI":"10.1007\/978--3-030--12612--4_13"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","unstructured":"J. Bootle V. Lyubashevsky N. K. Nguyen and A. Sorniotti. 2023. A Framework for Practical Anonymous Credentials from Lattices. In CRYPTO. https:\/\/doi.org\/10.1007\/978--3-031--38545--2_13","DOI":"10.1007\/978--3-031--38545--2_13"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/1314333.1314337"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","unstructured":"E. F. Brickell J. Camenisch and L. Chen. 2004. Direct Anonymous Attestation. In CCS. https:\/\/doi.org\/10.1145\/1030083.1030103","DOI":"10.1145\/1030083.1030103"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","unstructured":"J. Camenisch M. Drijvers and A. Lehmann. 2016. Anonymous Attestation Using the Strong Diffie Hellman Assumption Revisited. In TRUST. https:\/\/doi.org\/10.1007\/978--3--319--45572--3_1","DOI":"10.1007\/978--3--319--45572--3_1"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","unstructured":"J. Camenisch and A. Lysyanskaya. 2004. Signature Schemes and Anonymous Credentials from Bilinear Maps. In CRYPTO. https:\/\/doi.org\/10.1007\/978--3--540--28628--8_4","DOI":"10.1007\/978--3--540--28628--8_4"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/3402457"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","unstructured":"D. Chaum. 1982. Blind Signatures for Untraceable Payments. In CRYPTO. https:\/\/doi.org\/10.1007\/978--1--4757-0602--4_18","DOI":"10.1007\/978--1--4757-0602--4_18"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","unstructured":"D. Chaum and E. van Heyst. 1991. Group Signatures. In EUROCRYPT. https:\/\/doi.org\/10.1007\/3--540--46416--6_22","DOI":"10.1007\/3--540--46416--6_22"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","unstructured":"L. Chen N. El Kassem A. Lehmann and V. Lyubashevsky. 2019. A Framework for Efficient Lattice-Based DAA. In CYSARM@CCS. https:\/\/doi.org\/10.1145\/3338511.3357349","DOI":"10.1145\/3338511.3357349"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","unstructured":"Y. Chen N. Genise and P. Mukherjee. 2019. Approximate Trapdoors for Lattices and Smaller Hash-and-Sign Signatures. In ASIACRYPT. https:\/\/doi.org\/10.1007\/978--3-030--34618--8_1","DOI":"10.1007\/978--3-030--34618--8_1"},{"key":"e_1_3_2_1_21_1","volume":"202","author":"Christ M.","unstructured":"M. Christ, F. Baldimtsi, K. K. Chalkias, D. Maram, A. Roy, and J. Wang. 2024. SoK: Zero-Knowledge Range Proofs. IACR Cryptol. ePrint Arch. (2024), 430.","journal-title":"J. Wang."},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","unstructured":"R. del Pino V. Lyubashevsky and G. Seiler. 2018. Lattice-Based Group Signatures and Zero-Knowledge Proofs of Automorphism Stability. In CCS. https:\/\/doi.org\/10.1145\/3243734.3243852","DOI":"10.1145\/3243734.3243852"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","unstructured":"C. Delerabl\u00e9e and D. Pointcheval. 2006. Dynamic Fully Anonymous Short Group Signatures. In VIETCRYPT. https:\/\/doi.org\/10.1007\/11958239_13","DOI":"10.1007\/11958239_13"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1007\/978--3-031-07082--2_9"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","unstructured":"T. Espitau M. Tibouchi A. Wallet and Y. Yu. 2022. Shorter Hash-and-Sign Lattice-Based Signatures. In CRYPTO. https:\/\/doi.org\/10.1007\/978--3-031--15979--4_9","DOI":"10.1007\/978--3-031--15979--4_9"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","unstructured":"M. Fischlin. 2006. Round-Optimal Composable Blind Signatures in the Common Reference String Model. In CRYPTO. https:\/\/doi.org\/10.1007\/11818175_4","DOI":"10.1007\/11818175_4"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","unstructured":"G. Fuchsbauer C. Hanser and D. Slamanig. 2019. Structure-Preserving Signatures on Equivalence Classes and Constant-Size Anonymous Credentials. J. Cryptol. (2019). https:\/\/doi.org\/10.1007\/s00145-018--9281--4","DOI":"10.1007\/s00145-018--9281--4"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","unstructured":"Nicholas Genise and Daniele Micciancio. 2018. Faster Gaussian Sampling for Trapdoor Lattices with Arbitrary Modulus. In EUROCRYPT. https:\/\/doi.org\/10.1007\/978--3--319--78381--9_7","DOI":"10.1007\/978--3--319--78381--9_7"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","unstructured":"N. Genise D. Micciancio C. Peikert and M. Walter. 2020. Improved Discrete Gaussian and Subgaussian Analysis for Lattice Cryptography. In PKC. https:\/\/doi.org\/10.1007\/978--3-030--45374--9_21","DOI":"10.1007\/978--3-030--45374--9_21"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","unstructured":"C. Gentry S. Halevi and V. Lyubashevsky. 2022. Practical Non-interactive Publicly Verifiable Secret Sharing with Thousands of Parties. In EUROCRYPT. https:\/\/doi.org\/10.1007\/978--3-031-06944--4_16","DOI":"10.1007\/978--3-031-06944--4_16"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","unstructured":"C. Gentry C. Peikert and V. Vaikuntanathan. 2008. Trapdoors for Hard Lattices and New Cryptographic Constructions. In STOC. https:\/\/doi.org\/10.1145\/1374376.1374407","DOI":"10.1145\/1374376.1374407"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","unstructured":"S. Goldwasser S. Micali and C. Rackoff. 1985. The Knowledge Complexity of Interactive Proof-Systems (Extended Abstract). In STOC. https:\/\/doi.org\/10.1145\/22145.22178","DOI":"10.1145\/22145.22178"},{"key":"e_1_3_2_1_33_1","unstructured":"Intel. 2016. A Cost-Effective Foundation for End-to-End IoT Security White Paper. https:\/\/www.intel.com\/content\/dam\/www\/public\/us\/en\/documents\/white-papers\/intel-epid-iot-security-white-paper.pdf."},{"key":"e_1_3_2_1_34_1","unstructured":"ISO\/IEC. 2013. ISO\/IEC 18370--2:2016 Information Technology ? Security Techniques ' Blind Digital Signatures ' Part 2: Discrete Logarithm Based Mechanisms. https:\/\/www.iso.org\/standard\/62544.html."},{"key":"e_1_3_2_1_35_1","unstructured":"ISO\/IEC. 2013. ISO\/IEC 20008--2:2013 Information Technology Security Techniques Anonymous Digital Signatures Part 2: Mechanisms using a Group Public Key. https:\/\/www.iso.org\/standard\/56916.html."},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","unstructured":"C. Jeudy A. Roux-Langlois and O. Sanders. 2023. Lattice Signature with Efficient Protocols Application to Anonymous Credentials. In CRYPTO. https:\/\/doi.org\/10.1007\/978--3-031--38545--2_12","DOI":"10.1007\/978--3-031--38545--2_12"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","unstructured":"H. Jia Y. Hu and C. Tang. 2022. Lattice-Based Hash-and-Sign Signatures using Approximate Trapdoor Revisited. IET Inf. Secur. (2022). https:\/\/doi.org\/10.1049\/ise2.12039","DOI":"10.1049\/ise2.12039"},{"key":"e_1_3_2_1_38_1","unstructured":"P. N. Klein. 2000. Finding the Closest Lattice Vector when it's Unusually Close. In SODA."},{"key":"e_1_3_2_1_39_1","unstructured":"Q. Lai F.-H. Liu A. Lysyanskaya and Z. Wang. 2023. Lattice-based Commit-Transferrable Signatures and Applications to Anonymous Credentials. IACR Cryptol. ePrint Arch. (2023) 766."},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","unstructured":"A. Langlois and D. Stehl\u00e9. 2015. Worst-case to Average-case Reductions for Module Lattices. DCC (2015). https:\/\/doi.org\/10.1007\/s10623-014--9938--4","DOI":"10.1007\/s10623-014--9938--4"},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"publisher","unstructured":"B. Libert S. Ling F. Mouhartem K. Nguyen and H. Wang. 2016. Signature Schemes with Efficient Protocols and Dynamic Group Signatures from Lattice Assumptions. In ASIACRYPT. https:\/\/doi.org\/10.1007\/978--3--662--53890--6_13","DOI":"10.1007\/978--3--662--53890--6_13"},{"key":"e_1_3_2_1_42_1","doi-asserted-by":"publisher","unstructured":"V. Lyubashevsky N. K. Nguyen and M. Planccon. 2022. Lattice-Based Zero-Knowledge Proofs and Applications: Shorter Simpler and More General. CRYPTO (2022). https:\/\/doi.org\/10.1007\/978--3-031--15979--4_3","DOI":"10.1007\/978--3-031--15979--4_3"},{"key":"e_1_3_2_1_43_1","doi-asserted-by":"publisher","unstructured":"V. Lyubashevsky N. K. Nguyen M. Planccon and G. Seiler. 2021. Shorter Lattice-Based Group Signatures via \"Almost Free\" Encryption and Other Optimizations. In ASIACRYPT. https:\/\/doi.org\/10.1007\/978--3-030--92068--5_8","DOI":"10.1007\/978--3-030--92068--5_8"},{"key":"e_1_3_2_1_44_1","doi-asserted-by":"publisher","unstructured":"V. Lyubashevsky N. K. Nguyen and G. Seiler. 2021. Shorter Lattice-Based Zero-Knowledge Proofs via One-Time Commitments. In PKC. https:\/\/doi.org\/10.1007\/978--3-030--75245--3_9","DOI":"10.1007\/978--3-030--75245--3_9"},{"key":"e_1_3_2_1_45_1","doi-asserted-by":"publisher","unstructured":"V. Lyubashevsky and D. Wichs. 2015. Simple Lattice Trapdoor Sampling from a Broad Class of Distributions. In PKC. https:\/\/doi.org\/10.1007\/978--3--662--46447--2_32","DOI":"10.1007\/978--3--662--46447--2_32"},{"key":"e_1_3_2_1_46_1","doi-asserted-by":"publisher","unstructured":"D. Micciancio and C. Peikert. 2012. Trapdoors for Lattices: Simpler Tighter Faster Smaller. In EUROCRYPT. https:\/\/doi.org\/10.1007\/978--3--642--29011--4_41","DOI":"10.1007\/978--3--642--29011--4_41"},{"key":"e_1_3_2_1_47_1","doi-asserted-by":"publisher","unstructured":"D. Micciancio and O. Regev. 2007. Worst-Case to Average-Case Reductions Based on Gaussian Measures. SIAM J. Comput. (2007). https:\/\/doi.org\/10.1137\/S0097539705447360","DOI":"10.1137\/S0097539705447360"},{"key":"e_1_3_2_1_48_1","doi-asserted-by":"publisher","unstructured":"C. Peikert. 2010. An Efficient and Parallel Gaussian Sampler for Lattices. In CRYPTO. https:\/\/doi.org\/10.1007\/978--3--642--14623--7_5","DOI":"10.1007\/978--3--642--14623--7_5"},{"key":"e_1_3_2_1_49_1","unstructured":"D. Pointcheval and O. Sanders. 2015. Short Randomizable Signatures. IACR Cryptol. ePrint Arch. (2015) 525."},{"key":"e_1_3_2_1_50_1","doi-asserted-by":"publisher","unstructured":"D. Pointcheval and O. Sanders. 2016. Short Randomizable Signatures. In CT-RSA. https:\/\/doi.org\/10.1007\/978--3--319--29485--8_7","DOI":"10.1007\/978--3--319--29485--8_7"},{"key":"e_1_3_2_1_51_1","doi-asserted-by":"publisher","unstructured":"T. Prest. 2017. Sharper Bounds in Lattice-Based Cryptography Using the R\u00e9nyi Divergence. In ASIACRYPT. https:\/\/doi.org\/10.1007\/978--3--319--70694--8_13","DOI":"10.1007\/978--3--319--70694--8_13"},{"key":"e_1_3_2_1_52_1","unstructured":"T. Prest P.-A. Fouque J. Hoffstein P. Kirchner V. Lyubashevsky T. Pornin T. Ricosset G. Seiler W. Whyte and Z. Zhang. 2020. FALCON. Tech. rep. Available at https:\/\/csrc.nist.gov\/Projects\/post-quantum-cryptography\/selected-algorithms-2022."},{"key":"e_1_3_2_1_53_1","doi-asserted-by":"publisher","unstructured":"O. Sanders. 2021. Improving Revocation for Group Signature with Redactable Signature. In PKC. https:\/\/doi.org\/10.1007\/978--3-030--75245--3_12","DOI":"10.1007\/978--3-030--75245--3_12"},{"key":"e_1_3_2_1_54_1","doi-asserted-by":"publisher","unstructured":"O. Sanders and J. Traor\u00e9. 2021. EPID with Malicious Revocation. In CT-RSA. https:\/\/doi.org\/10.1007\/978--3-030--75539--3_8","DOI":"10.1007\/978--3-030--75539--3_8"},{"key":"e_1_3_2_1_55_1","unstructured":"TCG. 2015. https:\/\/trustedcomputinggroup.org\/authentication\/."},{"key":"e_1_3_2_1_56_1","volume-title":"FLINT: Fast Library for Number Theory. Version 3.0.0, https:\/\/flintlib.org.","author":"LINT","year":"2023","unstructured":"The FLINT team. 2023. FLINT: Fast Library for Number Theory. Version 3.0.0, https:\/\/flintlib.org."},{"key":"e_1_3_2_1_57_1","doi-asserted-by":"publisher","unstructured":"R. Vershynin. 2012. Introduction to the Non-Asymptotic Analysis of Random Matrices. In Compressed Sensing. https:\/\/doi.org\/10.1017\/cbo9780511794308.006","DOI":"10.1017\/cbo9780511794308.006"}],"event":{"name":"CCS '24: ACM SIGSAC Conference on Computer and Communications Security","location":"Salt Lake City UT USA","acronym":"CCS '24","sponsor":["SIGSAC ACM Special Interest Group on Security, Audit, and Control"]},"container-title":["Proceedings of the 2024 on ACM SIGSAC Conference on Computer and Communications Security"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3658644.3670297","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3658644.3670297","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,22]],"date-time":"2025-08-22T06:04:40Z","timestamp":1755842680000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3658644.3670297"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,12,2]]},"references-count":57,"alternative-id":["10.1145\/3658644.3670297","10.1145\/3658644"],"URL":"https:\/\/doi.org\/10.1145\/3658644.3670297","relation":{},"subject":[],"published":{"date-parts":[[2024,12,2]]},"assertion":[{"value":"2024-12-09","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}