{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,13]],"date-time":"2026-02-13T23:39:14Z","timestamp":1771025954217,"version":"3.50.1"},"reference-count":70,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61932019"],"award-info":[{"award-number":["61932019"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61802021"],"award-info":[{"award-number":["61802021"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"EU Horizon 2020 Research and Innovation Program","award":["779391"],"award-info":[{"award-number":["779391"]}]},{"DOI":"10.13039\/501100000266","name":"Engineering and Physical Sciences Research Council (EPSRC) through the DICE Project","doi-asserted-by":"publisher","award":["EP\/N028295\/1"],"award-info":[{"award-number":["EP\/N028295\/1"]}],"id":[{"id":"10.13039\/501100000266","id-type":"DOI","asserted-by":"publisher"}]},{"name":"National Key Research and Development Program of China","award":["2017YFB0802504"],"award-info":[{"award-number":["2017YFB0802504"]}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["U1536205"],"award-info":[{"award-number":["U1536205"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans.Inform.Forensic Secur."],"published-print":{"date-parts":[[2021]]},"DOI":"10.1109\/tifs.2021.3051801","type":"journal-article","created":{"date-parts":[[2021,1,14]],"date-time":"2021-01-14T21:12:01Z","timestamp":1610658721000},"page":"2260-2275","source":"Crossref","is-referenced-by-count":13,"title":["Direct Anonymous Attestation With Optimal TPM Signing Efficiency"],"prefix":"10.1109","volume":"16","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-7453-4043","authenticated-orcid":false,"given":"Kang","family":"Yang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2680-4907","authenticated-orcid":false,"given":"Liqun","family":"Chen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhenfeng","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1262-2192","authenticated-orcid":false,"given":"Christopher J. P.","family":"Newton","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bo","family":"Yang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Li","family":"Xi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref70","first-page":"126","article-title":"Practical verifiable encryption and decryption of discrete logarithms","volume":"2729","author":"camenisch","year":"2003","journal-title":"Adv Cryptology"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-47721-7_12"},{"key":"ref38","first-page":"410","article-title":"Efficient group signature schemes for large groups","volume":"1296","author":"camenisch","year":"1997","journal-title":"Adv Cryptology"},{"key":"ref33","doi-asserted-by":"crossref","first-page":"228","DOI":"10.1007\/978-3-319-22846-4_14","article-title":"DAA-A: Direct anonymous attestation with attributes","volume":"9229","author":"chen","year":"2015","journal-title":"Trust and Trustworthy Computing"},{"key":"ref32","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1007\/11832072_8","article-title":"Constant-size dynamic k-TAA","volume":"4116","author":"au","year":"2006","journal-title":"Security and Cryptography for Networks"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-54631-0_10"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1145\/1030083.1030103"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1145\/3098243.3098258"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-29485-8_18"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-12280-9_14"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-38980-1_33"},{"key":"ref60","first-page":"61","article-title":"Dynamic accumulators and application to efficient revocation of anonymous credentials","volume":"2442","author":"camenisch","year":"2002","journal-title":"Adv Cryptology"},{"key":"ref62","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1007\/978-3-540-72738-5_17","article-title":"Universal accumulators with efficient nonmembership proofs","volume":"4521","author":"li","year":"2007","journal-title":"Applied Cryptography and Network Security"},{"key":"ref61","first-page":"571","article-title":"Group signatures with almost-for-free revocation","volume":"7417","author":"libert","year":"2012","journal-title":"Adv Cryptology"},{"key":"ref63","first-page":"295","article-title":"Dynamic universal accumulators for DDH groups and their application to attribute-based anonymous credential systems","volume":"5473","author":"au","year":"2009","journal-title":"Topics in Cryptology—CT-RSA"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-13869-0_4"},{"key":"ref64","first-page":"561","article-title":"Batching techniques for accumulators with applications to iops and stateless blockchains","volume":"11692","author":"boneh","year":"2019","journal-title":"Adv Cryptology"},{"key":"ref27","author":"camenisch","year":"2017","journal-title":"FIDO ECDAA algorithm implementation draft"},{"key":"ref65","first-page":"275","article-title":"Accumulators from bilinear pairings and applications","volume":"3376","author":"nguyen","year":"2005","journal-title":"Topics in Cryptology—CT-RSA"},{"key":"ref66","first-page":"481","article-title":"An accumulator based on bilinear maps and efficient revocation for anonymous credentials","volume":"5443","author":"camenisch","year":"2009","journal-title":"Public Key Cryptography Conf"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1515\/popets-2015-0019"},{"key":"ref67","first-page":"301","article-title":"Accumulators with applications to anonymity-preserving revocation","author":"baldimtsi","year":"2017","journal-title":"Proc IEEE Eur Symp Secur Privacy (EuroS P)"},{"key":"ref68","doi-asserted-by":"publisher","DOI":"10.1145\/1314333.1314337"},{"key":"ref69","doi-asserted-by":"publisher","DOI":"10.1109\/SocialCom.2010.118"},{"key":"ref2","article-title":"Privacy risk management for federal information systems","author":"brooks","year":"2015"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2017.22"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1007\/s10207-013-0191-z"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-46513-8_14"},{"key":"ref21","first-page":"304","article-title":"A (corrected) DAA scheme using batch proof and verification","volume":"6151","author":"brickell","year":"2011","journal-title":"Proc 3rd Int Conf Trusted Syst (INTRUST)"},{"key":"ref24","first-page":"350","article-title":"A DAA scheme requiring less TPM resources","volume":"6151","author":"chen","year":"1999","journal-title":"Proc 5th China Int Conf Inf Secur Cryptol (Inscrypt)"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.4304\/jcp.3.12.43-50"},{"key":"ref26","year":"2017","journal-title":"FIDO Alliance Universal Authentication Framework (UAF) 1 1 Specifications"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1007\/s00145-007-9005-7"},{"key":"ref50","article-title":"Efficient hash maps to G? on BLS curves","author":"budroni","year":"2017"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.1109\/EUC.2010.98"},{"key":"ref59","doi-asserted-by":"publisher","DOI":"10.1145\/3133956.3134025"},{"key":"ref58","first-page":"1","article-title":"BLACR: TTP-free blacklistable anonymous credentials with reputation","author":"au","year":"2012","journal-title":"Proc 19th Annu Netw Distrib Syst Secur Symp (NDSS)"},{"key":"ref57","author":"scott","year":"2019","journal-title":"The Apache Milagro Cryptographic Library"},{"key":"ref56","doi-asserted-by":"publisher","DOI":"10.1007\/s00145-018-9280-5"},{"key":"ref55","first-page":"543","article-title":"Extended tower number field sieve: A new complexity for the medium prime case","author":"kim","year":"2016","journal-title":"Adv Cryptology"},{"key":"ref54","doi-asserted-by":"crossref","first-page":"319","DOI":"10.1007\/11693383_22","article-title":"Pairing-friendly elliptic curves of prime order","volume":"3897","author":"barreto","year":"2006","journal-title":"Selected Areas in Cryptography"},{"key":"ref53","article-title":"U-prove cryptographic specification v1. 1 (revision 3)","author":"paquin","year":"2013"},{"key":"ref52","first-page":"129","article-title":"Non-interactive and information-theoretic secure verifiable secret sharing","volume":"576","author":"pedersen","year":"1991","journal-title":"Adv Cryptology"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-13869-0_12"},{"key":"ref11","first-page":"1","article-title":"Anonymous attestation using the strong diffie hellman assumption revisited","volume":"9824","author":"camenisch","year":"0","journal-title":"Trust and Trustworthy Computing"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1007\/s001450010003"},{"key":"ref12","year":"2020","journal-title":"About TCG"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1145\/3196494.3196497"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/VNC.2017.8275615"},{"key":"ref15","first-page":"438","article-title":"Exponentiating in pairing groups","volume":"8282","author":"bos","year":"2014","journal-title":"Select Areas Cryptogr"},{"key":"ref16","first-page":"234","article-title":"Universally composable direct anonymous attestation","volume":"9615","author":"camenisch","year":"2016","journal-title":"Public Key Cryptography Conf"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1007\/BF00196725"},{"key":"ref18","first-page":"166","article-title":"A new direct anonymous attestation scheme from bilinear maps","volume":"4968","author":"brickell","year":"2008","journal-title":"Proc 1st Int Conf Trusted Comput (TRUST)"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-85538-5_1"},{"key":"ref4","year":"2016","journal-title":"Eu general data protection regulation"},{"key":"ref3","author":"pfitzmann","year":"2010","journal-title":"A terminology for talking about privacy by data minimization Anonymity unlinkability undetectability unobservability pseudonymity and identity management"},{"key":"ref6","year":"2015"},{"key":"ref5","year":"2016","journal-title":"Trusted Platform Module Library Specification Family ‘2 0’ Level 00 Revision 01 38"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1145\/2508859.2516729"},{"key":"ref7","year":"2013"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-28496-0_25"},{"key":"ref9","first-page":"223","article-title":"On the design and implementation of an efficient DAA scheme","volume":"6035","author":"chen","year":"0","journal-title":"Smart Card Research and Advanced Applications (CARDIS)"},{"key":"ref46","first-page":"56","article-title":"Signature schemes and anonymous credentials from bilinear maps","volume":"3152","author":"camenisch","year":"2004","journal-title":"Adv Cryptology"},{"key":"ref45","first-page":"41","article-title":"Short group signatures","volume":"3152","author":"boneh","year":"2004","journal-title":"Adv Cryptology"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-63697-9_15"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-69453-5_20"},{"key":"ref42","doi-asserted-by":"crossref","first-page":"48","DOI":"10.1007\/BFb0054851","article-title":"The decision diffie-hellman problem","volume":"1423","author":"boneh","year":"1998","journal-title":"Algorithmic Number Theory"},{"key":"ref41","first-page":"223","article-title":"Efficient selective-ID secure identity-based encryption without random oracles","volume":"3027","author":"boneh","year":"2004","journal-title":"Adv Cryptology"},{"key":"ref44","article-title":"Direct anonymous attestation with optimal TPM signing efficiency","author":"yang","year":"2018"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.2001.959888"}],"container-title":["IEEE Transactions on Information Forensics and Security"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/10206\/9151439\/09323052.pdf?arnumber=9323052","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,10]],"date-time":"2022-05-10T14:52:41Z","timestamp":1652194361000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9323052\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"references-count":70,"URL":"https:\/\/doi.org\/10.1109\/tifs.2021.3051801","relation":{},"ISSN":["1556-6013","1556-6021"],"issn-type":[{"value":"1556-6013","type":"print"},{"value":"1556-6021","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021]]}}}