{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T16:54:33Z","timestamp":1725900873984},"publisher-location":"Berlin, Heidelberg","reference-count":47,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642322976"},{"type":"electronic","value":"9783642322983"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-32298-3_20","type":"book-chapter","created":{"date-parts":[[2012,7,11]],"date-time":"2012-07-11T05:11:11Z","timestamp":1341983471000},"page":"304-337","source":"Crossref","is-referenced-by-count":7,"title":["A (Corrected) DAA Scheme Using Batch Proof and Verification"],"prefix":"10.1007","author":[{"given":"Ernie","family":"Brickell","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Liqun","family":"Chen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jiangtao","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"20_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":"20_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"418","DOI":"10.1007\/3-540-46035-7_28","volume-title":"Advances in Cryptology - EUROCRYPT 2002","author":"M. Abdalla","year":"2002","unstructured":"Abdalla, M., An, J.H., Bellare, M., Namprempre, C.: From Identification to Signatures via the Fiat-Shamir Transform: Minimizing Assumptions for Security and Forward-Security. In: Knudsen, L.R. (ed.) EUROCRYPT 2002. LNCS, vol.\u00a02332, pp. 418\u2013433. Springer, Heidelberg (2002)"},{"key":"20_CR3","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":"20_CR4","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 (ed.) Chapter 10 of Trusted Computing, pp. 271\u2013298. IEEE, London (2005)"},{"key":"20_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"236","DOI":"10.1007\/BFb0054130","volume-title":"Advances in Cryptology - EUROCRYPT \u201998","author":"M. Bellare","year":"1998","unstructured":"Bellare, M., Garay, J.A., Rabin, T.: Fast Batch Verification for Modular Exponentiation and Digital Signatures. In: Nyberg, K. (ed.) EUROCRYPT 1998. LNCS, vol.\u00a01403, pp. 236\u2013250. Springer, Heidelberg (1998)"},{"key":"20_CR6","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":"20_CR7","doi-asserted-by":"crossref","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 (1993)","DOI":"10.1145\/168588.168596"},{"key":"20_CR8","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":"20_CR9","unstructured":"Bernhard, D., Fuchsbauer, G., Ghadafi, E., Smart, N.P., Warinschi, B.: Anonymous attestation with user-controlled linkability (manuscript)"},{"key":"20_CR10","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.: Short Signatures Without Random Oracles. In: Cachin, C., Camenisch, J.L. (eds.) EUROCRYPT 2004. LNCS, vol.\u00a03027, pp. 56\u201373. Springer, Heidelberg (2004)"},{"key":"20_CR11","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":"20_CR12","doi-asserted-by":"crossref","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 (2004)","DOI":"10.1145\/1030083.1030103"},{"key":"20_CR13","doi-asserted-by":"publisher","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 (ed.) Chapter 5 of Trusted Computing, pp. 143\u2013174. IEEE, London (2005)"},{"key":"20_CR14","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":"20_CR15","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":"20_CR16","doi-asserted-by":"crossref","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 (2007)","DOI":"10.1145\/1314333.1314337"},{"key":"20_CR17","unstructured":"Brickell, E., Li, J.: Enhanced privacy ID from bilinear pairing. Cryptology ePrint Archive. Report 2009\/095 (2009), \n                    \n                      http:\/\/eprint.iacr.org\/2009\/095"},{"key":"20_CR18","unstructured":"Brickell, E., Li, J.: A pairing-based DAA scheme furhter reducing TPM resources. In: This proceedings"},{"key":"20_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","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":"20_CR20","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":"#cr-split#-20_CR21.1","unstructured":"Canard, S., Traore, J.: List signature schemes and application to electronic voting. Presented in International Workshop on Coding and Cryptography (2003)"},{"key":"#cr-split#-20_CR21.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 154(2), 189-201 (2006)","DOI":"10.1016\/j.dam.2005.08.003"},{"key":"20_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"350","DOI":"10.1007\/978-3-642-16342-5_26","volume-title":"Information Security and Cryptology","author":"L. Chen","year":"2010","unstructured":"Chen, L.: A DAA Scheme Requiring Less TPM Resources. In: Bao, F., Yung, M., Lin, D., Jing, J. (eds.) Inscrypt 2009. LNCS, vol.\u00a06151, pp. 350\u2013365. Springer, Heidelberg (2010); the full paper is in Cryptology ePrint Archive. Report 2010\/008, \n                    \n                      http:\/\/eprint.iacr.org\/2010\/008"},{"key":"20_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"166","DOI":"10.1007\/978-3-642-13869-0_11","volume-title":"Trust and Trustworthy Computing","author":"L. Chen","year":"2010","unstructured":"Chen, L.: A DAA Scheme Using Batch Proof and Verification. In: Acquisti, A., Smith, S.W., Sadeghi, A.-R. (eds.) TRUST 2010. LNCS, vol.\u00a06101, pp. 166\u2013180. Springer, Heidelberg (2010)"},{"key":"20_CR24","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":"20_CR25","unstructured":"Chen, L., Li, J.: A note on the Chen-Morrissey-Smart DAA scheme (preprint)"},{"key":"20_CR26","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":"20_CR27","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 for DAA Schemes. In: Baek, J., Bao, F., Chen, K., Lai, X. (eds.) ProvSec 2008. LNCS, vol.\u00a05324, pp. 156\u2013175. Springer, Heidelberg (2008)"},{"key":"20_CR28","unstructured":"Chen, L., Morrissey, P., Smart, N.P.: DAA: Fixing the pairing based protocols. Cryptology ePrint Archive. Report 2009\/198 (2009), \n                    \n                      http:\/\/eprint.iacr.org\/2009\/198"},{"issue":"12","key":"20_CR29","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":"20_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1007\/978-3-642-12510-2_16","volume-title":"Smart Card Research and Advanced Application","author":"L. Chen","year":"2010","unstructured":"Chen, L., Page, D., Smart, N.P.: On the Design and Implementation of an Efficient DAA Scheme. In: Gollmann, D., Lanet, J.-L., Iguchi-Cartigny, J. (eds.) CARDIS 2010. LNCS, vol.\u00a06035, pp. 223\u2013237. Springer, Heidelberg (2010)"},{"key":"20_CR31","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":"20_CR32","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":"20_CR33","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":"20_CR34","unstructured":"Granger, R., Smart, N.P.: On computing products of pairings. Cryptology ePrint Archive. Report 2006\/172 (2006), \n                    \n                      http:\/\/eprint.iacr.org\/2006\/172"},{"key":"20_CR35","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1007\/3-540-45439-X_6","volume-title":"Information Security","author":"F. Hoshino","year":"2001","unstructured":"Hoshino, F., Abe, M., Kobayashi, T.: Lenient\/Strict Batch Verification in Several Groups. In: Davida, G.I., Frankel, Y. (eds.) ISC 2001. LNCS, vol.\u00a02200, pp. 81\u201394. Springer, Heidelberg (2001)"},{"key":"20_CR36","unstructured":"ISO\/IEC 11889:2009 Information technology \u2013 Security techniques \u2013 Trusted Platform Module"},{"key":"20_CR37","unstructured":"ISO\/IEC 14888-3 Information technology \u2013 Security techniques \u2013 Digital signatures with appendix \u2013 Part 3: Discrete logarithm based mechanisms"},{"key":"20_CR38","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":"20_CR39","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":"20_CR40","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 (Extended Abstract). In: Heys, H.M., Adams, C.M. (eds.) SAC 1999. LNCS, vol.\u00a01758, pp. 184\u2013199. Springer, Heidelberg (2000)"},{"key":"20_CR41","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1049\/PBPC006E_ch6","volume-title":"Chapter 6 of Trusted Computing","author":"A. Pashalidis","year":"2005","unstructured":"Pashalidis, A., Mitchell, C.J.: Single sign-on using TCG-conformant platforms. In: Mitchell (ed.) Chapter 6 of Trusted Computing, pp. 175\u2013193. IEEE, London (2005)"},{"issue":"2","key":"20_CR42","doi-asserted-by":"crossref","first-page":"6","DOI":"10.1145\/1237500.1237502","volume":"10","author":"K. Peng","year":"2007","unstructured":"Peng, K., Boyd, C., Dawson, E.: Batch zero-knowledge proof and verification and its applications. ACM Trans. Inf. Syst. Secur.\u00a010(2), article 6 (2007)","journal-title":"ACM Trans. Inf. Syst. Secur."},{"key":"20_CR43","series-title":"IFIP","first-page":"443","volume-title":"SEC 2007","author":"C. Rudolph","year":"2007","unstructured":"Rudolph, C.: Covert Identity Information in Direct Anonymous Attestation (DAA). In: Venter, H., Eloff, M., Labuschagne, L., Eloff, J., von Solms, R. (eds.) SEC 2007. IFIP, vol.\u00a0232, pp. 443\u2013448. Springer, Boston (2007)"},{"key":"20_CR44","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":"20_CR45","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., Ryan, M., Chen, L.: 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":"20_CR46","unstructured":"Trusted Computing Group. TCG TPM specification 1.2. (2003), \n                    \n                      http:\/\/www.trustedcomputinggroup.org"}],"container-title":["Lecture Notes in Computer Science","Trusted Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-32298-3_20.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,4]],"date-time":"2021-05-04T12:00:19Z","timestamp":1620129619000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-32298-3_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642322976","9783642322983"],"references-count":47,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-32298-3_20","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}