{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,27]],"date-time":"2026-09-27T09:04:58Z","timestamp":1790499898500,"version":"4.1.0"},"publisher-location":"New York, NY, USA","reference-count":36,"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\/"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2024,12,2]]},"DOI":"10.1145\/3658644.3670338","type":"proceedings-article","created":{"date-parts":[[2024,12,9]],"date-time":"2024-12-09T12:19:20Z","timestamp":1733746760000},"page":"2460-2474","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":13,"title":["Non-Transferable Anonymous Tokens by Secret Binding"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0009-0001-0701-868X","authenticated-orcid":false,"given":"F. Bet\u00fcl","family":"Durak","sequence":"first","affiliation":[{"name":"Microsoft Research, Redmond, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0009-5693-210X","authenticated-orcid":false,"given":"Laurane","family":"Marco","sequence":"additional","affiliation":[{"name":"EPFL, Lausanne, Switzerland"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0001-3252-5245","authenticated-orcid":false,"given":"Abdullah","family":"Talayhan","sequence":"additional","affiliation":[{"name":"EPFL, Lausanne, Switzerland"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9185-1449","authenticated-orcid":false,"given":"Serge","family":"Vaudenay","sequence":"additional","affiliation":[{"name":"EPFL, Lausanne, Switzerland"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2024,12,9]]},"reference":[{"key":"e_1_3_2_1_1_1","unstructured":"2023. Criterion.rs Statistics-driven Microbenchmarking in Rust. https:\/\/github.com\/bheisler\/criterion.rs"},{"key":"e_1_3_2_1_2_1","unstructured":"arkworks contributors. 2022. arkworks zkSNARK ecosystem. https:\/\/arkworks.rs"},{"key":"e_1_3_2_1_3_1","volume-title":"Security and Cryptography for Networks","author":"Au Man Ho","unstructured":"Man Ho Au, Willy Susilo, and Yi Mu. 2006. Constant-Size Dynamic k-TAA. In Security and Cryptography for Networks, Roberto De Prisco and Moti Yung (Eds.). Springer Berlin Heidelberg, Berlin, Heidelberg, 111--125."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/2508859.2516687"},{"key":"e_1_3_2_1_5_1","volume-title":"Selected Areas in Cryptography -- SAC","author":"Barki Amira","year":"2016","unstructured":"Amira Barki, Solenn Brunet, Nicolas Desmoulins, and Jacques Traor\u00e9. 2017. Improved Algebraic MACs and Practical Keyed-Verification Anonymous Credentials. In Selected Areas in Cryptography -- SAC 2016. 360--380."},{"key":"e_1_3_2_1_6_1","volume-title":"Advances in Cryptology: Proceedings of EUROCRYPT.","author":"Benhamouda Fabrice","year":"2021","unstructured":"Fabrice Benhamouda, Tancr\u00e8de Lepoint, Julian Loss, Michele Orr\u00f9, and Mariana Raykova. 2021. On the (in)security of ROS. In Advances in Cryptology: Proceedings of EUROCRYPT."},{"key":"e_1_3_2_1_7_1","volume-title":"Advances in Cryptology - CRYPTO? 93","author":"Brands Stefan","unstructured":"Stefan Brands. 1994. Untraceable Offline Cash in Wallet with Observers. In Advances in Cryptology - CRYPTO? 93. Springer Berlin Heidelberg, 302--318."},{"key":"e_1_3_2_1_8_1","first-page":"93","article-title":"An Efficient System for Nontransferable Anonymous Credentials with Optional Anonymity Revocation","volume":"2001","author":"Camenisch Jan","year":"2001","unstructured":"Jan Camenisch and Anna Lysyanskaya. 2001. An Efficient System for Nontransferable Anonymous Credentials with Optional Anonymity Revocation. In Advances in Cryptology - EUROCRYPT 2001. 93--118.","journal-title":"Advances in Cryptology - EUROCRYPT"},{"key":"e_1_3_2_1_9_1","unstructured":"Melissa Chase F. Bet\u00fcl Durak and Serge Vaudenay. 2022. Anonymous Tokens with Hidden Metadata Bit from Algebraic MACs. Cryptology ePrint Archive Paper 2022\/1622. https:\/\/eprint.iacr.org\/2022\/1622 https:\/\/eprint.iacr.org\/2022\/ 1622."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1007\/978--3-031--38545-2_14"},{"key":"e_1_3_2_1_11_1","volume-title":"Algebraic MACs and Keyed-Verification Anonymous Credentials. In ACM CCS","author":"Chase Melissa","year":"2014","unstructured":"Melissa Chase, Sarah Meiklejohn, and Greg Zaverucha. 2014. Algebraic MACs and Keyed-Verification Anonymous Credentials. In ACM CCS 2014."},{"key":"e_1_3_2_1_12_1","volume-title":"Blind Signatures for Untraceable Payments. In Advances in Cryptology: Proceedings of CRYPTO '82","author":"Chaum David","year":"1982","unstructured":"David Chaum. 1982. Blind Signatures for Untraceable Payments. In Advances in Cryptology: Proceedings of CRYPTO '82. Plenum, 199--203."},{"key":"e_1_3_2_1_13_1","volume-title":"Security without Identification: Transaction Systems to Make Big Brother Obsolete. COmmunications of ACM","author":"Chaum David","year":"1985","unstructured":"David Chaum. 1985. Security without Identification: Transaction Systems to Make Big Brother Obsolete. COmmunications of ACM (1985), 1030--1044."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1515\/popets-2018-0026"},{"key":"e_1_3_2_1_15_1","volume-title":"Advances in Cryptology -- EUROCRYPT","author":"Dodis Yevgeniy","year":"2012","unstructured":"Yevgeniy Dodis, Eike Kiltz, Krzysztof Pietrzak, and Daniel Wichs. 2012. Message Authentication, Revisited. In Advances in Cryptology -- EUROCRYPT 2012. 355-- 374."},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2019.00050"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"crossref","unstructured":"F. Bet\u00fcl Durak Laurane Marco Abdullah Talayhan and Serge Vaudenay. 2024. Non-Transferable Anonymous Tokens by Secret Binding. Cryptology ePrint Archive Paper 2024\/711. https:\/\/eprint.iacr.org\/2024\/711 https:\/\/eprint.iacr.org\/ 2024\/711.","DOI":"10.1145\/3658644.3670338"},{"key":"e_1_3_2_1_18_1","volume-title":"Advances in Cryptology ' CRYPTO' 86","author":"Fiat Amos","unstructured":"Amos Fiat and Adi Shamir. 1999. How To Prove Yourself: Practical Solutions to Identification and Signature Problems. In Advances in Cryptology ' CRYPTO' 86, Vol. 263."},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-96881-0_2"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/3460120.3484582"},{"key":"e_1_3_2_1_21_1","volume-title":"Payman Mohassel, Ananth Raghunathan, Shaahid Shaikh, Yen-Chieh, and Sung Albert Zhang.","author":"Huang Sharon","year":"2021","unstructured":"Sharon Huang, Subodh Iyengar, Sundar Jeyaraman, Shiv Kushwah, Chen-Kuei, Lee Zutian Luo, Payman Mohassel, Ananth Raghunathan, Shaahid Shaikh, Yen-Chieh, and Sung Albert Zhang. 2021. DIT: De-Identified Authenticated Telemetry at Scale. https:\/\/research.fb.com\/privatestats."},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"crossref","unstructured":"Stanislaw Jarecki Aggelos Kiayias and Hugo Krawczyk. 2014. Round-Optimal Password-Protected Secret Sharing and T-PAKE in the Password-Only Model. Cryptology ePrint Archive Report 2014\/650. https:\/\/ia.cr\/2014\/650.","DOI":"10.1007\/978-3-662-45608-8_13"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"crossref","unstructured":"Julia Kastner Julian Loss and Omar Renawi. 2023. Concurrent Security of Anonymous Credentials Light Revisited. Cryptology ePrint Archive Paper 2023\/707. https:\/\/eprint.iacr.org\/2023\/707 https:\/\/eprint.iacr.org\/2023\/707.","DOI":"10.1145\/3576915.3623184"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-56784-2_11"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1109\/MSP.2013.158"},{"key":"e_1_3_2_1_26_1","unstructured":"M. Lodder T. Looker and A. Whitehead. 2023. Blind Signatures Extension of the BBS Signature Scheme. https:\/\/identity.foundation\/bbs-signature\/draft-blindbbs-signatures.html."},{"key":"e_1_3_2_1_27_1","volume-title":"Proceedings 38th Annual Symposium on Foundations of Computer Science. 458--467","author":"Naor M.","unstructured":"M. Naor and O. Reingold. 1997. Number-Theoretic Constructions of Efficient Pseudo-Random Functions. In Proceedings 38th Annual Symposium on Foundations of Computer Science. 458--467."},{"key":"e_1_3_2_1_28_1","volume-title":"The Future of Identity in the Information Society","author":"Pape Sebastian","unstructured":"Sebastian Pape. 2009. A Survey on Non-transferable Anonymous Credentials. In The Future of Identity in the Information Society. Springer Berlin Heidelberg, 107--118."},{"key":"e_1_3_2_1_29_1","unstructured":"Christian Paquin and Greg Zaverucha. 2022. U-Prove Cryptographic Specification V1.1 Revision 4. Microsoft Technical Report. https:\/\/github.com\/microsoft\/uprove-node-reference\/raw\/main\/doc\/UProve% 20Cryptographic%20Specification%20V1.1%20Revision%204.pdf."},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"crossref","unstructured":"David Pointcheval and Jacques Stern. 1996. Security Proofs for Signature Schemes. In Advances in Cryptology ' EUROCRYPT '96. 387--398.","DOI":"10.1007\/3-540-68339-9_33"},{"key":"e_1_3_2_1_31_1","volume-title":"Security Arguments for Digital Signatures and Blind Signatures. Journal of Cryptology","author":"Pointcheval David","year":"2001","unstructured":"David Pointcheval and Jacques Stern. 2001. Security Arguments for Digital Signatures and Blind Signatures. Journal of Cryptology (2001)."},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"crossref","unstructured":"C. P. Schnorr. 1990. Efficient Identification and Signatures for Smart Cards. In Advances in Cryptology ' CRYPTO' 89 Proceedings. 239--252.","DOI":"10.1007\/0-387-34805-0_22"},{"key":"e_1_3_2_1_33_1","unstructured":"Tjerand Silde and Martin Strand. 2021. Anonymous Tokens with Public Metadata and Applications to Private Contact Tracing. Cryptology ePrint Archive Report 2021\/203. https:\/\/ia.cr\/2021\/203."},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-30589-4_24"},{"key":"e_1_3_2_1_35_1","volume-title":"CAPTCHA: Using Hard AI Problems for Security. In Advances in Cryptology ' EUROCRYPT","author":"von Ahn Luis","year":"2003","unstructured":"Luis von Ahn, Manuel Blum, Nicholas J. Hopper, and John Langford. 2003. CAPTCHA: Using Hard AI Problems for Security. In Advances in Cryptology ' EUROCRYPT 2003. Springer Berlin Heidelberg, 294--311."},{"key":"e_1_3_2_1_36_1","volume-title":"Advances in Cryptology ' CRYPTO","year":"2002","unstructured":"DavidWagner. 2002. A Generalized Birthday Problem. In Advances in Cryptology ' CRYPTO 2002, Moti Yung (Ed.). Springer Berlin Heidelberg, Berlin, Heidelberg, 288--304."}],"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.3670338","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3658644.3670338","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,22]],"date-time":"2025-08-22T05:56:02Z","timestamp":1755842162000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3658644.3670338"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,12,2]]},"references-count":36,"alternative-id":["10.1145\/3658644.3670338","10.1145\/3658644"],"URL":"https:\/\/doi.org\/10.1145\/3658644.3670338","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"}}]}}