{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,26]],"date-time":"2026-09-26T12:28:56Z","timestamp":1790425736394,"version":"4.1.0"},"publisher-location":"Berlin, Heidelberg","reference-count":37,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642163418","type":"print"},{"value":"9783642163425","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-16342-5_26","type":"book-chapter","created":{"date-parts":[[2010,11,16]],"date-time":"2010-11-16T12:29:50Z","timestamp":1289910590000},"page":"350-365","source":"Crossref","is-referenced-by-count":39,"title":["A DAA Scheme Requiring Less TPM Resources"],"prefix":"10.1007","author":[{"given":"Liqun","family":"Chen","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"26_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1007\/11832072_8","volume-title":"Security and Cryptography for Networks","author":"M.H. Au","year":"2006","unstructured":"Au, M.H., Susilo, W., Mu, Y.: Constant-size dynamic k-TAA. In: De Prisco, R., Yung, M. (eds.) SCN 2006. LNCS, vol.\u00a04116, pp. 111\u2013125. Springer, Heidelberg (2006)"},{"key":"26_CR2","doi-asserted-by":"crossref","unstructured":"Backes, M., Maffei, M., Unruh, D.: Zero knowledge in the applied Pi\u2013calculus and automated verification of the direct anonymous attestation protocol. In: IEEE Symposium on Security and Privacy \u2013 SSP 2008, pp. 202\u2013215 (2008)","DOI":"10.1109\/SP.2008.23"},{"key":"26_CR3","doi-asserted-by":"crossref","first-page":"271","DOI":"10.1049\/PBPC006E_ch10","volume-title":"Trusted Computing, ch. 10","author":"S. Balfe","year":"2005","unstructured":"Balfe, S., Lakhani, A.D., Paterson, K.G.: Securing peer-to-peer networks using trusted computing. In: Mitchell (ed.) Trusted Computing, ch. 10, pp. 271\u2013298. IEEE, London (2005)"},{"key":"26_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"614","DOI":"10.1007\/3-540-39200-9_38","volume-title":"Advances in Cryptology \u2013 EUROCRPYT 2003","author":"M. Bellare","year":"2003","unstructured":"Bellare, M., Micciancio, D., Warinschi, B.: Foundations of group signatures: formal definitions, simplified requirements, and a construction based on general assumptions. In: Biham, E. (ed.) EUROCRYPT 2003. LNCS, vol.\u00a02656, pp. 614\u2013629. Springer, Heidelberg (2003)"},{"key":"26_CR5","doi-asserted-by":"publisher","first-page":"62","DOI":"10.1145\/168588.168596","volume-title":"The 1st ACM Conference on Computer and Communications Security","author":"M. Bellare","year":"1993","unstructured":"Bellare, M., Rogaway, P.: Random oracles are practical: A paradigm for designing efficient protocols. In: The 1st ACM Conference on Computer and Communications Security, pp. 62\u201373. ACM Press, New York (1993)"},{"key":"26_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"136","DOI":"10.1007\/978-3-540-30574-3_11","volume-title":"Topics in Cryptology \u2013 CT-RSA 2005","author":"M. Bellare","year":"2005","unstructured":"Bellare, M., Shi, H., Zhang, C.: Foundations of group signatures: The case of dynamic groups. In: Menezes, A. (ed.) CT-RSA 2005. LNCS, vol.\u00a03376, pp. 136\u2013153. Springer, Heidelberg (2005)"},{"key":"26_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"56","DOI":"10.1007\/978-3-540-24676-3_4","volume-title":"Advances in Cryptology - EUROCRYPT 2004","author":"D. Boneh","year":"2004","unstructured":"Boneh, D., Boyen, X.: Sort signatures without random oracles. In: Cachin, C., Camenisch, J.L. (eds.) EUROCRYPT 2004. LNCS, vol.\u00a03027, pp. 56\u201373. Springer, Heidelberg (2004)"},{"key":"26_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1007\/978-3-540-28628-8_3","volume-title":"Advances in Cryptology \u2013 CRYPTO 2004","author":"D. Boneh","year":"2004","unstructured":"Boneh, D., Boyen, X., Shacham, H.: Short group signatures. In: Franklin, M. (ed.) CRYPTO 2004. LNCS, vol.\u00a03152, pp. 41\u201355. Springer, Heidelberg (2004)"},{"key":"26_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"58","DOI":"10.1007\/3-540-44448-3_5","volume-title":"Advances in Cryptology - ASIACRYPT 2000","author":"C. Boyd","year":"2000","unstructured":"Boyd, C., Pavlovski, C.: Attacking and repairing batch verification schemes. In: Okamoto, T. (ed.) ASIACRYPT 2000. LNCS, vol.\u00a01976, pp. 58\u201371. Springer, Heidelberg (2000)"},{"key":"26_CR10","doi-asserted-by":"publisher","first-page":"132","DOI":"10.1145\/1030083.1030103","volume-title":"The 11th ACM Conference on Computer and Communications Security","author":"E. Brickell","year":"2004","unstructured":"Brickell, E., Camenisch, J., Chen, L.: Direct anonymous attestation. In: The 11th ACM Conference on Computer and Communications Security, pp. 132\u2013145. ACM Press, New York (2004)"},{"key":"26_CR11","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1049\/PBPC006E_ch5","volume-title":"Trusted Computing, ch. 5","author":"E. Brickell","year":"2005","unstructured":"Brickell, E., Camenisch, J., Chen, L.: Direct anonymous attestation in context. In: Mitchell (ed.) Trusted Computing, ch. 5, pp. 143\u2013174. IEEE, London (2005)"},{"key":"26_CR12","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1007\/s10207-009-0076-3","volume":"8","author":"E. Brickell","year":"2009","unstructured":"Brickell, E., Chen, L., Li, J.: Simplified security notions for direct anonymous attestation and a concrete scheme from pairings. Int. Journal of Information Security\u00a08, 315\u2013330 (2009)","journal-title":"Int. Journal of Information Security"},{"key":"26_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"166","DOI":"10.1007\/978-3-540-68979-9_13","volume-title":"Trusted Computing - Challenges and Applications","author":"E. Brickell","year":"2008","unstructured":"Brickell, E., Chen, L., Li, J.: A new direct anonymous attestation scheme from bilinear maps. In: Lipp, P., Sadeghi, A.-R., Koch, K.-M. (eds.) Trust 2008. LNCS, vol.\u00a04968, pp. 166\u2013178. Springer, Heidelberg (2008)"},{"key":"26_CR14","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1145\/1314333.1314337","volume-title":"The 6th ACM Workshop on Privacy in the Electronic Society \u2013 WPES 2007","author":"E. Brickell","year":"2007","unstructured":"Brickell, E., Li, J.: Enhanced privacy ID: A direct anonymous attestation scheme with enhanced revocation capabilities. In: The 6th ACM Workshop on Privacy in the Electronic Society \u2013 WPES 2007, pp. 21\u201330. ACM Press, New York (2007)"},{"key":"26_CR15","unstructured":"Brickell, E., Li, J.: Enhanced privacy ID from bilinear pairing. In: Cryptology ePrint Archive. Report 2009\/095, http:\/\/eprint.iacr.org\/2009\/095"},{"key":"#cr-split#-26_CR16.1","unstructured":"Canard, S., Traore, J.: List signature schemes and application to electronic voting. Presented in International Workshop on Coding and Cryptography 2003 (2003);"},{"key":"#cr-split#-26_CR16.2","doi-asserted-by":"crossref","unstructured":"See also the Journal Version of This Paper by Canard, S., Schoenmakers, B., Stam, M., Traore, J.: List signature schemes. Discrete Applied Mathematics\u00a0154(2), 189\u2013201 (2006)","DOI":"10.1016\/j.dam.2005.08.003"},{"key":"26_CR17","doi-asserted-by":"crossref","unstructured":"Chen, L.: A DAA scheme requiring less TPM resources. In: Cryptology ePrint Archive. Report 2010\/008, http:\/\/eprint.iacr.org\/2010\/008","DOI":"10.1007\/978-3-642-16342-5_26"},{"key":"26_CR18","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1007\/s10207-006-0011-9","volume":"6","author":"L. Chen","year":"2007","unstructured":"Chen, L., Cheng, Z., Smart, N.P.: Identity-based key agreement protocols from pairings. Int. Journal of Information Security\u00a06, 213\u2013242 (2007)","journal-title":"Int. Journal of Information Security"},{"key":"26_CR19","unstructured":"Chen, L., Li, J.: A note on the Chen-Morrissey-Smart Direct Anonymous Attestation scheme (preprint)"},{"key":"26_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-540-85538-5_1","volume-title":"Pairing-Based Cryptography \u2013 Pairing 2008","author":"L. Chen","year":"2008","unstructured":"Chen, L., Morrissey, P., Smart, N.P.: Pairings in trusted computing. In: Galbraith, S.D., Paterson, K.G. (eds.) Pairing 2008. LNCS, vol.\u00a05209, pp. 1\u201317. Springer, Heidelberg (2008)"},{"key":"26_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"156","DOI":"10.1007\/978-3-540-88733-1_11","volume-title":"Provable Security","author":"L. Chen","year":"2008","unstructured":"Chen, L., Morrissey, P., Smart, N.P.: On proofs of security of DAA schemes. In: Baek, J., Bao, F., Chen, K., Lai, X. (eds.) ProvSec 2008. LNCS, vol.\u00a05324, pp. 156\u2013175. Springer, Heidelberg (2008)"},{"key":"26_CR22","doi-asserted-by":"crossref","unstructured":"Chen, L., Morrissey, P., Smart, N.P.: DAA: Fixing the pairing based protocols. In: Cryptology ePrint Archive. Report 2009\/198, http:\/\/eprint.iacr.org\/2009\/198","DOI":"10.1109\/CINC.2009.116"},{"issue":"12","key":"26_CR23","first-page":"43","volume":"3","author":"X. Chen","year":"2008","unstructured":"Chen, X., Feng, D.: Direct anonymous attestation for next generation TPM. Journal of Computers\u00a03(12), 43\u201350 (2008)","journal-title":"Journal of Computers"},{"key":"26_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1007\/11958239_13","volume-title":"Progress in Cryptology - VIETCRYPT 2006","author":"C. Delerablee","year":"2006","unstructured":"Delerablee, C., Pointcheval, D.: Dynamic fully anonymous short group signatures. In: Nguy\u00ean, P.Q. (ed.) VIETCRYPT 2006. LNCS, vol.\u00a04341, pp. 193\u2013210. Springer, Heidelberg (2006), http:\/\/www.di.ens.fr\/users\/pointche\/Documents\/Papers\/2006_vietcrypt.pdf for a corrected version of this paper"},{"key":"26_CR25","doi-asserted-by":"publisher","first-page":"3113","DOI":"10.1016\/j.dam.2007.12.010","volume":"156","author":"S. Galbraith","year":"2008","unstructured":"Galbraith, S., Paterson, K., Smart, N.P.: Pairings for cryptographers. Discrete Applied Mathematics\u00a0156, 3113\u20133121 (2008)","journal-title":"Discrete Applied Mathematics"},{"key":"26_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1007\/978-3-540-71677-8_2","volume-title":"Public Key Cryptography \u2013 PKC 2007","author":"H. Ge","year":"2007","unstructured":"Ge, H., Tate, S.R.: A Direct anonymous attestation scheme for embedded devices. In: Okamoto, T., Wang, X. (eds.) PKC 2007. LNCS, vol.\u00a04450, pp. 16\u201330. Springer, Heidelberg (2007)"},{"key":"26_CR27","unstructured":"ISO\/IEC 11889:2009 Information technology \u2013 Security techniques \u2013 Trusted Platform Module"},{"key":"26_CR28","unstructured":"ISO\/IEC 14888-3 Information technology \u2013 Security techniques \u2013 Digital signatures with appendix \u2013 Part 3: Discrete logarithm based mechanisms"},{"key":"26_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1007\/978-3-540-68979-9_14","volume-title":"Trusted Computing - Challenges and Applications","author":"A. Leung","year":"2008","unstructured":"Leung, A., Chen, L., Mitchell, C.J.: On a possible privacy flaw in direct anonymous attestation (DAA). In: Lipp, P., Sadeghi, A.-R., Koch, K.-M. (eds.) Trust 2008. LNCS, vol.\u00a04968, pp. 179\u2013190. Springer, Heidelberg (2008)"},{"key":"26_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"249","DOI":"10.1007\/BFb0052240","volume-title":"Advances in Cryptology - CRYPTO \u201997","author":"C.H. Lim","year":"1997","unstructured":"Lim, C.H., Lee, P.J.: A key recovery attack on discrete log-based schemes using a prime order subgroup. In: Kaliski Jr., B.S. (ed.) CRYPTO 1997. LNCS, vol.\u00a01294, pp. 249\u2013263. Springer, Heidelberg (1997)"},{"key":"26_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"184","DOI":"10.1007\/3-540-46513-8_14","volume-title":"Selected Areas in Cryptography","author":"A. Lysyanskaya","year":"2000","unstructured":"Lysyanskaya, A., Rivest, R., Sahai, A., Wolf, S.: Pseudonym systems. In: Heys, H.M., Adams, C.M. (eds.) SAC 1999. LNCS, vol.\u00a01758, pp. 184\u2013199. Springer, Heidelberg (2000)"},{"key":"26_CR32","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1049\/PBPC006E_ch6","volume-title":"Trusted Computing, ch. 6","author":"A. Pashalidis","year":"2005","unstructured":"Pashalidis, A., Mitchell, C.J.: Single sign-on using TCG-conformant platforms. In: Mitchell (ed.) Trusted Computing, ch. 6, pp. 175\u2013193. IEEE, London (2005)"},{"key":"26_CR33","doi-asserted-by":"crossref","unstructured":"Rudolph, C.: Covert identity information in direct anonymous attestation (DAA). In: The 22nd IFIP TC-11 International Information Security Conference \u2013 SEC 2007 (2007)","DOI":"10.1007\/978-0-387-72367-9_38"},{"key":"26_CR34","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"239","DOI":"10.1007\/0-387-34805-0_22","volume-title":"Advances in Cryptology - CRYPTO \u201989","author":"C.P. Schnorr","year":"1990","unstructured":"Schnorr, C.P.: Efficient identification and signatures for smart cards. In: Brassard, G. (ed.) CRYPTO 1989. LNCS, vol.\u00a0435, pp. 239\u2013252. Springer, Heidelberg (1990)"},{"key":"26_CR35","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"218","DOI":"10.1007\/978-3-540-73275-4_16","volume-title":"Security and Privacy in Ad-hoc and Sensor Networks","author":"B. Smyth","year":"2007","unstructured":"Smyth, B., Chen, L., Ryan, M.: Direct Anonymous Attestation (DAA): Ensuring privacy with corrupt administrators. In: Stajano, F., Meadows, C., Capkun, S., Moore, T. (eds.) ESAS 2007. LNCS, vol.\u00a04572, pp. 218\u2013231. Springer, Heidelberg (2007)"},{"key":"26_CR36","unstructured":"Trusted Computing Group. TCG TPM specification 1.2 (2003), http:\/\/www.trustedcomputinggroup.org"}],"container-title":["Lecture Notes in Computer Science","Information Security and Cryptology"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-16342-5_26.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,11,13]],"date-time":"2021-11-13T16:22:18Z","timestamp":1636820538000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-16342-5_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642163418","9783642163425"],"references-count":37,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-16342-5_26","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010]]}}}