{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,22]],"date-time":"2026-09-22T09:46:42Z","timestamp":1790070402191,"version":"4.0.1"},"reference-count":42,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2009,2,10]],"date-time":"2009-02-10T00:00:00Z","timestamp":1234224000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Int. J. Inf. Secur."],"published-print":{"date-parts":[[2009,10]]},"DOI":"10.1007\/s10207-009-0076-3","type":"journal-article","created":{"date-parts":[[2009,2,9]],"date-time":"2009-02-09T07:09:57Z","timestamp":1234163397000},"page":"315-330","source":"Crossref","is-referenced-by-count":61,"title":["Simplified security notions of direct anonymous attestation and a concrete scheme from pairings"],"prefix":"10.1007","volume":"8","author":[{"given":"Ernie","family":"Brickell","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Liqun","family":"Chen","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jiangtao","family":"Li","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2009,2,10]]},"reference":[{"key":"76_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. In: Proceedings of IEEE Symposium on Security and Privacy, pp. 202\u2013215. IEEE Computer Society (2008)","DOI":"10.1109\/SP.2008.23"},{"key":"76_CR2","doi-asserted-by":"crossref","first-page":"271","DOI":"10.1049\/PBPC006E_ch10","volume-title":"Chapter 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. (eds) Chapter 10 of Trusted Computing, pp. 271\u2013298. IEE, London (2005)"},{"key":"76_CR3","doi-asserted-by":"crossref","unstructured":"Barreto, P.S.L.M., Kim, H.Y., Lynn, B., Scott, M.: Efficient algorithms for pairing-based cryptosystems. In: Advances in Cryptology\u2014CRYPTO\u201902, Lecture Notes in Computer Science, vol. 2442, pp. 354\u2013368. Springer, Heidelberg (2002)","DOI":"10.1007\/3-540-45708-9_23"},{"key":"76_CR4","doi-asserted-by":"crossref","unstructured":"Bellare, M., Micciancio, D., Warinschi, B.: Foundations of group signatures: formal definitions, simplified requirements, and a construction based on general assumptions. In: Advances in Cryptology\u2014EUROCRYPT\u201903, Lecture Notes in Computer Science, vol. 2656, pp. 614\u2013629. Springer, Heidelberg (2003)","DOI":"10.1007\/3-540-39200-9_38"},{"key":"76_CR5","doi-asserted-by":"crossref","unstructured":"Bellare, M., Rogaway, P.: Random oracles are practical: A paradigm for designing efficient protocols. In: Proceedings of the 1st ACM Conference on Computer and Communications Security, pp. 62\u201373. ACM Press, New York (1993)","DOI":"10.1145\/168588.168596"},{"key":"76_CR6","doi-asserted-by":"crossref","unstructured":"Boneh, D., Boyen, X.: Efficient selective-ID secure identity based encryption without random oracles. In: Advances in Cryptology\u2014EUROCRYPT\u201904, Lecture Notes in Computer Science, vol. 3027, pp. 223\u2013238. Springer, Heidelberg (2004)","DOI":"10.1007\/978-3-540-24676-3_14"},{"key":"76_CR7","doi-asserted-by":"crossref","unstructured":"Boneh, D., Franklin, M.: Identity-based encryption from the Weil pairing. In: Advances in Cryptology\u2014CRYPTO\u201901, Lecture Notes in Computer Science, vol. 2139, pp. 213\u2013229. Springer, Heidelberg (2001)","DOI":"10.1007\/3-540-44647-8_13"},{"key":"76_CR8","doi-asserted-by":"crossref","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)","DOI":"10.1145\/1030083.1030103"},{"key":"76_CR9","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1049\/PBPC006E_ch5","volume-title":"Chapter 5 of Trusted Computing","author":"E. Brickell","year":"2005","unstructured":"Brickell E., Camenisch J., Chen L.: Direct anonymous attestation in context. In: Mitchell, C. (eds) Chapter 5 of Trusted Computing, pp. 143\u2013174. IEE, London (2005)"},{"key":"76_CR10","doi-asserted-by":"crossref","unstructured":"Brickell, E., Chen, L., Li, J.: A new direct anonymous attestation scheme from bilinear maps. In: Trusted Computing\u2014Challenges and Applications\u2014TRUST 2008, Lecture Notes in Computer Science, vol. 4968, pp. 166\u2013178. Springer, Heidelberg (2008)","DOI":"10.1007\/978-3-540-68979-9_13"},{"key":"76_CR11","doi-asserted-by":"crossref","unstructured":"Brickell, E., Li, J.: Enhanced privacy ID: A direct anonymous attestation scheme with enhanced revocation capabilities. In: Proceedings of the Sixth ACM Workshop on Privacy in the Electronic Society. ACM Press, New York (2007)","DOI":"10.1145\/1314333.1314337"},{"key":"76_CR12","doi-asserted-by":"crossref","unstructured":"Brickell, E.F., Chaum, D., Damg\u00e5rd, I., van de Graaf, J.: Gradual and verifiable release of a secret. In: Advances in Cryptology\u2014CRYPTO\u201987, Lecture Notes in Computer Science, vol. 293, pp. 156\u2013166. Springer, Heidelberg (1987)","DOI":"10.1007\/3-540-48184-2_11"},{"key":"76_CR13","unstructured":"Camenisch, J., Groth, J.: Group signatures: Better efficiency and new theoretical aspects. In: Blundo, C., Cimato, S. (eds.) Proceedings of Forth International Conference on Security in Communication Networks, SCN 2004, Lecture Notes in Computer Science, vol. 3352, pp. 122\u2013135. Springer, Heidelberg (2005)"},{"key":"76_CR14","doi-asserted-by":"crossref","unstructured":"Camenisch, J., Lysyanskaya, A.: A signature scheme with efficient protocols. In: Proceedings of the Third Conference on Security in Communication Networks, Lecture Notes in Computer Science, vol. 2576, pp. 268\u2013289. Springer, Heidelberg (2002)","DOI":"10.1007\/3-540-36413-7_20"},{"key":"76_CR15","doi-asserted-by":"crossref","unstructured":"Camenisch, J., Lysyanskaya, A.: Signature schemes and anonymous credentials from bilinear maps. In: Advances in Cryptology\u2014CRYPTO\u201904, Lecture Notes in Computer Science, vol. 3152, pp. 56\u201372. Springer, Heidelberg (2004)","DOI":"10.1007\/978-3-540-28628-8_4"},{"key":"76_CR16","doi-asserted-by":"crossref","unstructured":"Camenisch, J., Michels, M.: Separability and efficiency for generic group signature schemes. In: In Advances in Cryptology\u2014CRYPTO\u201999, Lecture Notes in Computer Science, vol. 1666, pp. 413\u2013430. Springer, Heidelberg (1999)","DOI":"10.1007\/3-540-48405-1_27"},{"key":"76_CR17","doi-asserted-by":"crossref","unstructured":"Camenisch, J., Shoup, V.: Practical verifiable encryption and decryption of discrete logarithms. In: Advances in Cryptology\u2014CRYPTO\u201903, Lecture Notes in Computer Science, vol. 2729, pp. 126\u2013144. Springer, Heidelberg (2003)","DOI":"10.1007\/978-3-540-45146-4_8"},{"key":"76_CR18","doi-asserted-by":"crossref","unstructured":"Camenisch, J., Stadler, M.: Efficient group signature schemes for large groups. In: Advances in Cryptology\u2014CRYPTO\u201997, Lecture Notes in Computer Science, vol. 1296, pp. 410\u2013424. Springer, Heidelberg (1997)","DOI":"10.1007\/BFb0052252"},{"issue":"1","key":"76_CR19","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1007\/s001459910006","volume":"13","author":"R. Canetti","year":"2000","unstructured":"Canetti R.: Security and composition of multiparty cryptographic protocols. J. Cryptol. 13(1), 143\u2013202 (2000)","journal-title":"J. Cryptol."},{"key":"76_CR20","doi-asserted-by":"crossref","unstructured":"Chaum, D.: Zero-knowledge undeniable signatures. In: Advances in Cryptology\u2014EUROCRYPT\u201990, Lecture Notes in Computer Science, vol. 473, pp. 458\u2013464. Springer, Heidelberg (1990)","DOI":"10.1007\/3-540-46877-3_41"},{"key":"76_CR21","doi-asserted-by":"crossref","unstructured":"Chaum, D., Evertse, J.H., van de Graaf, J.: An improved protocol for demonstrating possession of discrete logarithms and some generalizations. In: Advances in Cryptology\u2014EUROCRYPT\u201987, Lecture Notes in Computer Science, vol. 304, pp. 127\u2013141. Springer, Heidelberg (1987)","DOI":"10.1007\/3-540-39118-5_13"},{"key":"76_CR22","doi-asserted-by":"crossref","unstructured":"Chaum, D., Pedersen, T.P.: Wallet databases with observers. In: Advances in Cryptology\u2014CRYPTO\u201992, Lecture Notes in Computer Science, vol. 740, pp. 89\u2013105. Springer, Heidelberg (1992)","DOI":"10.1007\/3-540-48071-4_7"},{"key":"76_CR23","doi-asserted-by":"crossref","unstructured":"Chen, L., Morrissey, P., Smart, N.P.: On proofs of security of DAA schemes. In: Proceedings of the Second International Conference on Provable Security\u2014ProvSec 2008, Lecture Notes in Computer Science, vol. 5324, pp. 167\u2013175. Springer, Heidelberg (2008)","DOI":"10.1007\/978-3-540-88733-1_11"},{"key":"76_CR24","doi-asserted-by":"crossref","unstructured":"Chen, L., Morrissey, P., Smart, N.P.: Pairings in trusted computing. In: Proceedings of the Second International Conference on Pairing-Based Cryptography, Lecture Notes in Computer Science, vol. 5209, pp. 1\u201317. Springer, Heidelberg (2008)","DOI":"10.1007\/978-3-540-85538-5_1"},{"key":"76_CR25","doi-asserted-by":"crossref","unstructured":"Damg\u00e5rd, I., Fujisaki, E.: An integer commitment scheme based on groups with hidden order. In: Advances in Cryptology\u2014ASIACRYPT\u201902, Lecture Notes in Computer Science, vol. 2501, pp. 125\u2013142. Springer, Heidelberg (2002)","DOI":"10.1007\/3-540-36178-2_8"},{"key":"76_CR26","doi-asserted-by":"crossref","unstructured":"Fiat, A., Shamir, A.: How to prove yourself: Practical solutions to identification and signature problems. In: Advances in Cryptology\u2014CRYPTO\u201986, Lecture Notes in Computer Science, vol. 263, pp. 186\u2013194. Springer, Heidelberg (1987)","DOI":"10.1007\/3-540-47721-7_12"},{"key":"76_CR27","doi-asserted-by":"crossref","unstructured":"Fujisaki, E., Okamoto, T.: Statistical zero knowledge protocols to prove modular polynomial relations. In: Advances in Cryptology\u2014CRYPTO\u201997, Lecture Notes in Computer Science, vol. 1294, pp. 16\u201330. Springer, Heidelberg (1997)","DOI":"10.1007\/BFb0052225"},{"key":"76_CR28","doi-asserted-by":"crossref","unstructured":"Galbraith, S.D., Harrison, K., Soldera, D.: Implementing the Tate pairing. In: Proceedings of the Fifth International Symposium on Algorithmic Number Theory, Lecture Notes of Computer Science, vol. 2369, pp. 324\u2013337. Springer, Heidelberg (2002)","DOI":"10.1007\/3-540-45455-1_26"},{"key":"76_CR29","doi-asserted-by":"crossref","unstructured":"Ge, H., Tate, S.R.: A direct anonymous attestation scheme for embedded devices. In: Proceedings of Public Key Cryptography\u2014PKC 2007, Lecture Notes in Computer Science, vol. 4450. Springer, Heidelberg (2007)","DOI":"10.1007\/978-3-540-71677-8_2"},{"key":"76_CR30","doi-asserted-by":"crossref","unstructured":"Leung, A., Chen, L., Mitchell, C.J.: On a possible privacy flaw in direct anonymous attestation (DAA). In: Trusted Computing\u2014Challenges and Applications\u2014TRUST 2008, Lecture Notes in Computer Science, vol. 4968, pp. 179\u2013190. Springer, Heidelberg (2008)","DOI":"10.1007\/978-3-540-68979-9_14"},{"key":"76_CR31","doi-asserted-by":"crossref","unstructured":"Leung, A., Mitchell, C.J.: Ninja: Non identity based, privacy preserving authentication for ubiquitous environments. In: Proceedings of Ninth International Conference on Ubiquitous Computing, Lecture Notes in Computer Science, vol. 4717, pp. 73\u201390. Springer, Heidelberg (2007)","DOI":"10.1007\/978-3-540-74853-3_5"},{"key":"76_CR32","unstructured":"Lynn, B.: On the implementation of pairing-based cryptosystems. PhD. thesis, Stanford University, Stanford (2007)"},{"key":"76_CR33","doi-asserted-by":"crossref","unstructured":"Lysyanskaya, A., Rivest, R.L., Sahai, A., Wolf, S.: Pseudonym systems. In: Proceedings of the Sixth Workshop on Selected Areas in Cryptography, Lecture Notes in Computer Science, vol. 1758, pp. 184\u2013199. Springer, Heidelberg (1999)","DOI":"10.1007\/3-540-46513-8_14"},{"key":"76_CR34","doi-asserted-by":"crossref","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)","DOI":"10.1145\/103418.103434"},{"key":"76_CR35","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1049\/PBPC006E_ch6","volume-title":"Trusted Computing, Chap 6","author":"A. Pashalidis","year":"2005","unstructured":"Pashalidis A., Mitchell C.J.: Single sign-on using TCG-conformant platforms. In: Mitchell, C. (eds) Trusted Computing, Chap 6, pp. 175\u2013193. IEE, London (2005)"},{"key":"76_CR36","doi-asserted-by":"crossref","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 (2001)","DOI":"10.1109\/SECPRI.2001.924298"},{"key":"76_CR37","doi-asserted-by":"crossref","unstructured":"Pointcheval, D., Stern, J.: Security proofs for signature schemes. In: Advances in Cryptology\u2014EUROCRYPT\u201996, Lecture Notes in Computer Science, vol. 1070, pp. 387\u2013398. Springer, Heidelberg (1996)","DOI":"10.1007\/3-540-68339-9_33"},{"key":"76_CR38","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 (SEC2007), IFIP International Federation for Information Processing, vol. 232, pp. 443\u2013448. Springer, Boston (2007)","DOI":"10.1007\/978-0-387-72367-9_38"},{"issue":"3","key":"76_CR39","doi-asserted-by":"crossref","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. J. Cryptol. 4(3), 161\u2013174 (1991)","journal-title":"J. Cryptol."},{"key":"76_CR40","doi-asserted-by":"crossref","unstructured":"Smyth, B., Chen, L., Ryan, M.: Direct anonymous attestation (DAA): ensuring privacy with corrupt administrators. In: Stajano, F. (ed.) Proceedings of Fourth European Workshop on Security and Privacy in Ad hoc and Sensor Networks (ESAS 2007), Lecture Notes in Computer Science, vol. 4572, pp. 218\u2013231. Springer, Heidelberg (2007)","DOI":"10.1007\/978-3-540-73275-4_16"},{"key":"76_CR41","unstructured":"Trusted Computing Group: TCG TPM specification 1.2 (2003). Available at http:\/\/www.trustedcomputinggroup.org"},{"key":"76_CR42","unstructured":"Trusted Computing Group website: http:\/\/www.trustedcomputinggroup.org"}],"container-title":["International Journal of Information Security"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10207-009-0076-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10207-009-0076-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10207-009-0076-3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T11:01:24Z","timestamp":1559127684000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10207-009-0076-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,2,10]]},"references-count":42,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2009,10]]}},"alternative-id":["76"],"URL":"https:\/\/doi.org\/10.1007\/s10207-009-0076-3","relation":{},"ISSN":["1615-5262","1615-5270"],"issn-type":[{"value":"1615-5262","type":"print"},{"value":"1615-5270","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009,2,10]]}}}