{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,9]],"date-time":"2026-01-09T03:56:31Z","timestamp":1767930991638,"version":"3.49.0"},"reference-count":16,"publisher":"International Association for Cryptologic Research","issue":"4","license":[{"start":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T00:00:00Z","timestamp":1759622400000},"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":[[2025,12,2]]},"abstract":"<jats:p>Traceable Anonymous Credentials (TACs) are an important extension of Anonymous Credentials (ACs).  TAC systems protect user privacy during credential verifications while also allowing for the de-anonymization of credentials in cases of misbehavior. Although TACs have been studied with several constructions based on number-theoretic assumptions, the formal security definitions of credential tracing and efficient constructions with post-quantum security remain absent. This work addresses both gaps by presenting the first formalization of TACs and the first post-quantum construction based on module lattices. We design a new trapdoor for a lattice-based commitment, which allows partial recovery of commitment randomness. We integrate our trapdoor commitment into the state-of-the-art lattice-based AC system by Jeudy et al. (Crypto 2023) to derive our efficient TAC system.<\/jats:p>","DOI":"10.62056\/ak5wl8n4e","type":"journal-article","created":{"date-parts":[[2026,1,8]],"date-time":"2026-01-08T23:39:47Z","timestamp":1767915587000},"update-policy":"https:\/\/doi.org\/10.62056\/adfjwm02dj","source":"Crossref","is-referenced-by-count":0,"title":["Post-Quantum Traceable Anonymous Credentials from Lattices"],"prefix":"10.62056","volume":"2","author":[{"ORCID":"https:\/\/orcid.org\/0009-0005-0331-4915","authenticated-orcid":false,"given":"Madusha","family":"Chathurangi","sequence":"first","affiliation":[{"id":[{"id":"https:\/\/ror.org\/02sc3r913","id-type":"ROR","asserted-by":"publisher"}],"name":"Griffith University","place":["Brisbane, 4111, Australia"]}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1064-2600","authenticated-orcid":false,"given":"Qinyi","family":"Li","sequence":"additional","affiliation":[{"id":[{"id":"https:\/\/ror.org\/02sc3r913","id-type":"ROR","asserted-by":"publisher"}],"name":"Griffith University","place":["Brisbane, 4111, Australia"]}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3971-6415","authenticated-orcid":false,"given":"Ernest","family":"Foo","sequence":"additional","affiliation":[{"id":[{"id":"https:\/\/ror.org\/02sc3r913","id-type":"ROR","asserted-by":"publisher"}],"name":"Griffith University","place":["Brisbane, 4111, Australia"]}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9330-2662","authenticated-orcid":false,"given":"Leo","family":"Zhang","sequence":"additional","affiliation":[{"id":[{"id":"https:\/\/ror.org\/02sc3r913","id-type":"ROR","asserted-by":"publisher"}],"name":"Griffith University","place":["Brisbane, 4111, Australia"]}]}],"member":"48349","published-online":{"date-parts":[[2026,1,8]]},"reference":[{"key":"ref1:chaum1985security","doi-asserted-by":"publisher","first-page":"1030","DOI":"10.1145\/4372.4373","article-title":"Security without identification: Transaction systems to make\n  big brother obsolete","volume":"28","author":"David Chaum","year":"1985","journal-title":"Communications of the ACM"},{"key":"ref2:camenisch2012efficient","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2133375.2133379","article-title":"Efficient attributes for anonymous credentials","volume":"15","author":"Jan Camenisch","year":"2012","journal-title":"ACM Transactions on Information and System Security\n  (TISSEC)"},{"key":"ref3:rosenberg2023zk","doi-asserted-by":"publisher","first-page":"790","DOI":"10.1109\/SP46215.2023.10179430","article-title":"zk-creds: Flexible anonymous credentials from zksnarks and\n  existing identity infrastructure","author":"Michael Rosenberg","year":"2023"},{"key":"ref4:canard2007divisible","doi-asserted-by":"publisher","first-page":"482","DOI":"10.1007\/978-3-540-72540-4_28","article-title":"Divisible e-cash systems can be truly anonymous","author":"S\u00e9bastien Canard","year":"2007"},{"key":"ref5:hebant2023traceable","doi-asserted-by":"publisher","first-page":"105060","DOI":"10.1007\/978-3-031-14791-3_18","article-title":"Traceable constant-size multi-authority credentials","author":"Chlo\u00e9 H\u00e9bant","year":"2023","journal-title":"Information and Computation"},{"key":"ref6:camenisch2001efficient","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1007\/3-540-44987-6_7","article-title":"An efficient system for non-transferable anonymous\n  credentials with optional anonymity revocation","author":"Jan Camenisch","year":"2001"},{"key":"ref7:canard2013protecting","doi-asserted-by":"publisher","first-page":"381","DOI":"10.1145\/2484313.2484363","article-title":"Protecting privacy by sanitizing personal data: a new\n  approach to anonymous credentials","author":"S\u00e9bastien Canard","year":"2013"},{"key":"ref8:jeudy2023lattice","doi-asserted-by":"publisher","first-page":"351","DOI":"10.1007\/978-3-031-38545-2_12","article-title":"Lattice signature with efficient protocols, application to\n  anonymous credentials","author":"Corentin Jeudy","year":"2023"},{"key":"ref9:bootle2023framework","doi-asserted-by":"publisher","first-page":"384","DOI":"10.1007\/978-3-031-38545-2_13","article-title":"A framework for practical anonymous credentials from\n  lattices","author":"Jonathan Bootle","year":"2023"},{"key":"ref10:fuchsbauer2019structure","doi-asserted-by":"publisher","first-page":"498","DOI":"10.1007\/s00145-018-9281-4","article-title":"Structure-preserving signatures on equivalence classes and\n  constant-size anonymous credentials","volume":"32","author":"Georg Fuchsbauer","year":"2019","journal-title":"Journal of Cryptology"},{"key":"ref11:bellare2005foundations","doi-asserted-by":"publisher","first-page":"136","DOI":"10.1007\/978-3-540-30574-3_11","article-title":"Foundations of group signatures: The case of dynamic\n  groups","author":"Mihir Bellare","year":"2005"},{"key":"ref12:lyubashevsky2022lattice","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1007\/978-3-031-15979-4_3","article-title":"Lattice-based zero-knowledge proofs and applications:\n  shorter, simpler, and more general","author":"Vadim Lyubashevsky","year":"2022"},{"key":"ref13:micciancio2012trapdoors","doi-asserted-by":"publisher","first-page":"700","DOI":"10.1007\/978-3-642-29011-4_41","article-title":"Trapdoors for lattices: Simpler, tighter, faster, smaller","author":"Daniele Micciancio","year":"2012"},{"key":"ref14:langlois2015worst","doi-asserted-by":"publisher","first-page":"565","DOI":"10.1007\/s10623-014-9938-4","article-title":"Worst-case to average-case reductions for module lattices","volume":"75","author":"Adeline Langlois","year":"2015","journal-title":"Designs, Codes and Cryptography"},{"key":"ref15:yang2019efficient","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1007\/978-3-030-26948-7_6","article-title":"Efficient lattice-based zero-knowledge arguments with\n  standard soundness: construction and applications","author":"Rupeng Yang","year":"2019"},{"key":"ref16:lyubashevsky2012lattice","doi-asserted-by":"publisher","first-page":"738","DOI":"10.1007\/978-3-642-29011-4_43","article-title":"Lattice signatures without trapdoors","author":"Vadim Lyubashevsky","year":"2012"}],"container-title":["IACR Communications in Cryptology"],"original-title":[],"language":"en","deposited":{"date-parts":[[2026,1,8]],"date-time":"2026-01-08T23:40:35Z","timestamp":1767915635000},"score":1,"resource":{"primary":{"URL":"https:\/\/cic.iacr.org\/p\/2\/4\/12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,1,8]]},"references-count":16,"journal-issue":{"issue":"4","published-online":{"date-parts":[[2026,1,8]]}},"URL":"https:\/\/doi.org\/10.62056\/ak5wl8n4e","archive":["Internet Archive","Internet Archive"],"relation":{},"ISSN":["3006-5496"],"issn-type":[{"value":"3006-5496","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,1,8]]},"assertion":[{"value":"2025-10-05","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2025-12-02","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}}],"article-number":"cc2-4-23"}}