{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,13]],"date-time":"2025-05-13T02:43:11Z","timestamp":1747104191860},"publisher-location":"Berlin, Heidelberg","reference-count":30,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540689782"},{"type":"electronic","value":"9783540689799"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-68979-9_13","type":"book-chapter","created":{"date-parts":[[2008,8,12]],"date-time":"2008-08-12T12:02:26Z","timestamp":1218542546000},"page":"166-178","source":"Crossref","is-referenced-by-count":57,"title":["A New Direct Anonymous Attestation Scheme from Bilinear Maps"],"prefix":"10.1007","author":[{"given":"Ernie","family":"Brickell","sequence":"first","affiliation":[]},{"given":"Liqun","family":"Chen","sequence":"additional","affiliation":[]},{"given":"Jiangtao","family":"Li","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"13_CR1","doi-asserted-by":"crossref","unstructured":"Backes, M., Maffei, M., Unruh, D.: Zero-knowledge in the applied pi-calculus and automated verification of the direct anonymous attestaion protocol. Cryptology ePrint Archive, Report 2007\/289 (2007), http:\/\/eprint.iacr.org\/","DOI":"10.1109\/SP.2008.23"},{"key":"13_CR2","doi-asserted-by":"crossref","first-page":"271","DOI":"10.1049\/PBPC006E_ch10","volume-title":"ch.10 of Trusted Computing","author":"S. Balfe","year":"2005","unstructured":"Balfe, S., Lakhani, A.D., Paterson, K.G.: Securing peer-to-peer networks using trusted computing. In: Mitchell, C. (ed.) Trusted Computing, ch.10, pp. 271\u2013298. IEE, London (2005)"},{"key":"13_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"354","DOI":"10.1007\/3-540-45708-9_23","volume-title":"Advances in Cryptology - CRYPTO 2002","author":"P.S.L.M. Barreto","year":"2002","unstructured":"Barreto, P.S.L.M., Kim, H.Y., Lynn, B., Scott, M.: Efficient algorithms for pairing-based cryptosystems. In: Yung, M. (ed.) CRYPTO 2002. LNCS, vol.\u00a02442, pp. 354\u2013368. Springer, Heidelberg (2002)"},{"key":"13_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1007\/978-3-540-24676-3_14","volume-title":"Advances in Cryptology - EUROCRYPT 2004","author":"D. Boneh","year":"2004","unstructured":"Boneh, D., Boyen, X.: Efficient selective-ID secure identity based encryption without random oracles. In: Cachin, C., Camenisch, J.L. (eds.) EUROCRYPT 2004. LNCS, vol.\u00a03027, pp. 223\u2013238. Springer, Heidelberg (2004)"},{"key":"13_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1007\/3-540-44647-8_13","volume-title":"Advances in Cryptology - CRYPTO 2001","author":"D. Boneh","year":"2001","unstructured":"Boneh, D., Franklin, M.: Identity-based encryption from the Weil pairing. In: Kilian, J. (ed.) CRYPTO 2001. LNCS, vol.\u00a02139, pp. 213\u2013229. Springer, Heidelberg (2001)"},{"key":"13_CR6","doi-asserted-by":"publisher","first-page":"132","DOI":"10.1145\/1030083.1030103","volume-title":"Proceedings of 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: Proceedings of the 11th ACM Conference on Computer and Communications Security, pp. 132\u2013145. ACM Press, New York (2004)"},{"key":"13_CR7","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1049\/PBPC006E_ch5","volume-title":"ch.5 of Trusted Computing","author":"E. Brickell","year":"2005","unstructured":"Brickell, E., Camenisch, J., Chen, L.: Direct anonymous attestation in context. In: Mitchell, C. (ed.) Trusted Computing, ch.5, pp. 143\u2013174. IEE, London (2005)"},{"key":"13_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"156","DOI":"10.1007\/3-540-48184-2_11","volume-title":"Advances in Cryptology - CRYPTO \u201987","author":"E. Brickell","year":"1988","unstructured":"Brickell, E., Chaum, D., Damg\u00e5rd, I., van de Graaf, J.: Gradual and verifiable release of a secret. In: Pomerance, C. (ed.) CRYPTO 1987. LNCS, vol.\u00a0293, pp. 156\u2013166. Springer, Heidelberg (1988)"},{"key":"13_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"120","DOI":"10.1007\/978-3-540-30598-9_9","volume-title":"Security in Communication Networks","author":"J. Camenisch","year":"2005","unstructured":"Camenisch, J., Groth, J.: Group signatures: Better efficiency and new theoretical aspects. In: Blundo, C., Cimato, S. (eds.) SCN 2004. LNCS, vol.\u00a03352, pp. 120\u2013133. Springer, Heidelberg (2005)"},{"key":"13_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"268","DOI":"10.1007\/3-540-36413-7_20","volume-title":"Proceedings of the 3rd Conference on Security in Communication Networks","author":"J. Camenisch","year":"2003","unstructured":"Camenisch, J., Lysyanskaya, A.: A signature scheme with efficient protocols. In: Cimato, S., Galdi, C., Persiano, G. (eds.) SCN 2002. LNCS, vol.\u00a02576, pp. 268\u2013289. Springer, Heidelberg (2003)"},{"key":"13_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"56","DOI":"10.1007\/978-3-540-28628-8_4","volume-title":"Advances in Cryptology \u2013 CRYPTO 2004","author":"J. Camenisch","year":"2004","unstructured":"Camenisch, J., Lysyanskaya, A.: Signature schemes and anonymous credentials from bilinear maps. In: Franklin, M. (ed.) CRYPTO 2004. LNCS, vol.\u00a03152, pp. 56\u201372. Springer, Heidelberg (2004)"},{"key":"13_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"410","DOI":"10.1007\/BFb0052252","volume-title":"Advances in Cryptology \u2014 CRYPTO 1997","author":"J. Camenisch","year":"1997","unstructured":"Camenisch, J., Stadler, M.: Efficient group signature schemes for large groups. In: CAIP 1997. LNCS, vol.\u00a01296, pp. 410\u2013424. Springer, Heidelberg (1997)"},{"issue":"1","key":"13_CR13","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1007\/s001459910006","volume":"13","author":"R. Canetti","year":"2000","unstructured":"Canetti, R.: Security and composition of multiparty cryptographic protocols. Journal of Cryptology\u00a013(1), 143\u2013202 (2000)","journal-title":"Journal of Cryptology"},{"key":"13_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"458","DOI":"10.1007\/3-540-46877-3_41","volume-title":"Advances in Cryptology - EUROCRYPT \u201990","author":"D. Chaum","year":"1991","unstructured":"Chaum, D.: Zero-knowledge undeniable signatures. In: Damg\u00e5rd, I.B. (ed.) EUROCRYPT 1990. LNCS, vol.\u00a0473, pp. 458\u2013464. Springer, Heidelberg (1991)"},{"key":"13_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1007\/3-540-39118-5_13","volume-title":"Advances in Cryptology - EUROCRYPT \u201987","author":"D. Chaum","year":"1988","unstructured":"Chaum, D., Evertse, J.-H., van de Graaf, J.: An improved protocol for demonstrating possession of discrete logarithms and some generalizations. In: Price, W.L., Chaum, D. (eds.) EUROCRYPT 1987. LNCS, vol.\u00a0304, pp. 127\u2013141. Springer, Heidelberg (1988)"},{"key":"13_CR16","series-title":"Lecture Notes in Computer Science","first-page":"186","volume-title":"Advances in Cryptology - CRYPTO \u201986","author":"A. Fiat","year":"1987","unstructured":"Fiat, A., Shamir, A.: How to prove yourself: Practical solutions to identification and signature problems. In: Odlyzko, A.M. (ed.) CRYPTO 1986. LNCS, vol.\u00a0263, pp. 186\u2013194. Springer, Heidelberg (1987)"},{"key":"13_CR17","doi-asserted-by":"publisher","first-page":"324","DOI":"10.1007\/3-540-45455-1_26","volume-title":"Proceedings of the 5th International Symposium on Algorithmic Number Theory","author":"S.D. Galbraith","year":"2002","unstructured":"Galbraith, S.D., Harrison, K., Soldera, D.: Implementing the Tate pairing. In: Proceedings of the 5th International Symposium on Algorithmic Number Theory, London, UK, pp. 324\u2013337. Springer, London (2002)"},{"key":"13_CR18","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":"13_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1007\/978-3-540-74853-3_5","volume-title":"UbiComp 2007: Ubiquitous Computing","author":"A. Leung","year":"2007","unstructured":"Leung, A., Mitchell, C.J.: Ninja: Non identity based, privacy preserving authentication for ubiquitous environments. In: Krumm, J., Abowd, G.D., Seneviratne, A., Strang, T. (eds.) UbiComp 2007. LNCS, vol.\u00a04717, pp. 73\u201390. Springer, Heidelberg (2007)"},{"key":"13_CR20","unstructured":"Lynn, B.: On the implementation of pairing-based cryptosystems. PhD thesis, Stanford University, Stanford, California (2007)"},{"key":"13_CR21","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.L., 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":"13_CR22","first-page":"80","volume-title":"Proceedings of the 23rd annual ACM Symposium on Theory of Computing (STOC)","author":"A. Menezes","year":"1991","unstructured":"Menezes, A., Vanstone, S., Okamoto, T.: Reducing elliptic curve logarithms to logarithms in a finite field. In: Proceedings of the 23rd annual ACM Symposium on Theory of Computing (STOC), pp. 80\u201389. ACM Press, New York (1991)"},{"key":"13_CR23","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1049\/PBPC006E_ch6","volume-title":"ch. 6 of Trusted Computing","author":"A. Pashalidis","year":"2005","unstructured":"Pashalidis, A., Mitchell, C.J.: Single sign-on using TCG-conformant platforms. In: Mitchell, C. (ed.) Trusted Computing, ch. 6, pp. 175\u2013193. IEE, London (2005)"},{"key":"13_CR24","first-page":"184","volume-title":"Proceedings of the IEEE Symposium on Security and Privacy","author":"B. Pfitzmann","year":"2001","unstructured":"Pfitzmann, B., Waidner, M.: A model for asynchronous reactive systems and its application to secure message transmission. In: Proceedings of the IEEE Symposium on Security and Privacy, pp. 184\u2013200. IEEE Computer Society Press, Los Alamitos (2001)"},{"key":"13_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"387","DOI":"10.1007\/3-540-68339-9_33","volume-title":"Advances in Cryptology - EUROCRYPT \u201996","author":"D. Pointcheval","year":"1996","unstructured":"Pointcheval, D., Stern, J.: Security proofs for signature schemes. In: Maurer, U.M. (ed.) EUROCRYPT 1996. LNCS, vol.\u00a01070, pp. 387\u2013398. Springer, Heidelberg (1996)"},{"key":"13_CR26","doi-asserted-by":"crossref","unstructured":"Rudolph, C.: Covert identity information in direct anonymous attestation (DAA). In: Proceedings of the 22nd IFIP TC-11 International Information Security Conference (SEC 2007) (2007)","DOI":"10.1007\/978-0-387-72367-9_38"},{"issue":"3","key":"13_CR27","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1007\/BF00196725","volume":"4","author":"C.P. Schnorr","year":"1991","unstructured":"Schnorr, C.P.: Efficient identification and signatures for smart cards. Journal of Cryptology\u00a04(3), 161\u2013174 (1991)","journal-title":"Journal of Cryptology"},{"key":"13_CR28","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. (ed.) ESAS 2007. LNCS, vol.\u00a04572, pp. 218\u2013231. Springer, Heidelberg (2007)"},{"key":"13_CR29","unstructured":"Trusted Computing Group. TCG TPM specification 1.2 (2003), http:\/\/www.trustedcomputinggroup.org"},{"key":"13_CR30","unstructured":"Trusted Computing Group website, http:\/\/www.trustedcomputinggroup.org"}],"container-title":["Lecture Notes in Computer Science","Trusted Computing - Challenges and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-68979-9_13.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,19]],"date-time":"2020-11-19T05:30:49Z","timestamp":1605763849000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-68979-9_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540689782","9783540689799"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-68979-9_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[]}}