{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T02:56:31Z","timestamp":1725764191000},"publisher-location":"Berlin, Heidelberg","reference-count":31,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642539589"},{"type":"electronic","value":"9783642539596"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-53959-6_20","type":"book-chapter","created":{"date-parts":[[2013,12,12]],"date-time":"2013-12-12T15:41:11Z","timestamp":1386862871000},"page":"218-235","source":"Crossref","is-referenced-by-count":0,"title":["A Novel Direct Anonymous Attestation Scheme Using Secure Two-Party Computation"],"prefix":"10.1007","author":[{"given":"Xiaohan","family":"Yue","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fucai","family":"Zhou","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"20_CR1","unstructured":"TCG. TPM Main Part 1, Design Principles Specification 1.2 (2003), https:\/\/www.trustedcomputinggroup.org\/"},{"key":"20_CR2","unstructured":"TCG. Trusted Platform Module specification (TPM), version 1.2 (2003)"},{"key":"20_CR3","unstructured":"TCG. Trusted Platform Module specification (TPM), version 1.1 (2001)"},{"key":"20_CR4","doi-asserted-by":"crossref","first-page":"132","DOI":"10.1145\/1030083.1030103","volume-title":"Proceedings of the 11th ACM Conference on Computer and Communications Security (CCS 2004)","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 (CCS 2004), pp. 132\u2013145. ACM Press, New York (2004)"},{"key":"20_CR5","unstructured":"TCG. TCG MPWG Mobile Trusted Module specification, version 1.0, Revision 1 (2007)"},{"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":"publisher","first-page":"1202","DOI":"10.1016\/j.adhoc.2011.01.008","volume":"9","author":"A. Durahim","year":"2011","unstructured":"Durahim, A., Savas, E.: A2-MAKE: An efficient anonymous and accountable mutual authentication and key agreement protocol for WMNs. Ad Hoc Networks\u00a09, 1202\u20131220 (2011)","journal-title":"Ad Hoc Networks"},{"key":"20_CR8","doi-asserted-by":"publisher","first-page":"600","DOI":"10.1145\/1653662.1653734","volume-title":"Proceedings of the 16th ACM Conference on Computer and Communications Security (CCS 2009)","author":"P. Bichsel","year":"2009","unstructured":"Bichsel, P., Camenisch, J., Gro\u00df, T., Shoup, V.: Anonymous credentials on a standard Java Card. In: Proceedings of the 16th ACM Conference on Computer and Communications Security (CCS 2009), pp. 600\u2013610. ACM Press, New York (2009)"},{"issue":"8","key":"20_CR9","doi-asserted-by":"publisher","first-page":"705","DOI":"10.1016\/j.cose.2011.08.005","volume":"30","author":"G. Bella","year":"2011","unstructured":"Bella, G., Giustolisi, R., Riccobene, S.: Enforcing privacy in e-commerce by balancing anonymity and trust. Computers & Security\u00a030(8), 705\u2013718 (2011)","journal-title":"Computers & Security"},{"key":"20_CR10","first-page":"307","volume-title":"Proceedings of the 6th USENIX Symposium on Networked Systems Design and Implementation","author":"R. Gummadi","year":"2009","unstructured":"Gummadi, R., Balakrishnan, H., Maniatis, P., Ratnasamy, S.: Not-a-Bot (NAB): Improving Service Availability in the Face of Botnet Attacks. In: Proceedings of the 6th USENIX Symposium on Networked Systems Design and Implementation, pp. 307\u2013320. USENIX Association, Berkeley (2009)"},{"key":"20_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1007\/978-3-642-29420-4_16","volume-title":"Formal Aspects of Security and Trust","author":"B. Smyth","year":"2012","unstructured":"Smyth, B., Ryan, M., Chen, L.: Formal analysis of anonymity in ECC-based Direct Anonymous Attestation schemes. In: Barthe, G., Datta, A., Etalle, S. (eds.) FAST 2011. LNCS, vol.\u00a07140, pp. 245\u2013262. Springer, Heidelberg (2012)"},{"key":"20_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"577","DOI":"10.1007\/978-3-642-25106-1_11","volume-title":"On the Move to Meaningful Internet Systems: OTM 2011","author":"U. Greveler","year":"2011","unstructured":"Greveler, U., Justus, B., Loehr, D.: Direct Anonymous Attestation: Enhancing Cloud Service User Privacy. In: Meersman, R., et al. (eds.) OTM 2011, Part II. LNCS, vol.\u00a07045, pp. 577\u2013587. Springer, Heidelberg (2011)"},{"key":"20_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1007\/978-3-642-24712-5_4","volume-title":"Communications and Multimedia Security","author":"K. Dietrich","year":"2011","unstructured":"Dietrich, K., Winter, J., Luzhnica, G., Podesser, S.: Implementation Aspects of Anonymous Credential Systems for Mobile Trusted Platforms. In: De Decker, B., Lapon, J., Naessens, V., Uhl, A. (eds.) CMS 2011. LNCS, vol.\u00a07025, pp. 45\u201358. Springer, Heidelberg (2011)"},{"key":"20_CR14","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_CR15","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_CR16","unstructured":"Chen, L., Morrissey, P., Smart, N.: DAA: Fixing the pairing based protocols. Cryptology ePrint Archive. Report 2009\/198 (2009), http:\/\/eprint.iacr.org\/2009\/198"},{"key":"20_CR17","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_CR18","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)"},{"issue":"8","key":"20_CR19","doi-asserted-by":"publisher","first-page":"2070","DOI":"10.3724\/SP.J.1001.2010.03579","volume":"21","author":"X. Chen","year":"2010","unstructured":"Chen, X., Feng, D.: Direct Anonymous Attestation Based on Bilinear maps. Chinese Journal of Software, China\u00a021(8), 2070\u20132078 (2010)","journal-title":"Chinese Journal of Software, China"},{"key":"20_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1007\/978-3-642-13869-0_12","volume-title":"Trust and Trustworthy Computing","author":"E. Brickell","year":"2010","unstructured":"Brickell, E., Li, J.: A pairing-based DAA scheme furhter reducing TPM resources. In: Acquisti, A., Smith, S.W., Sadeghi, A.-R. (eds.) TRUST 2010. LNCS, vol.\u00a06101, pp. 181\u2013195. Springer, Heidelberg (2010)"},{"key":"20_CR21","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)"},{"key":"20_CR22","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_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1007\/3-540-48910-X_16","volume-title":"Advances in Cryptology - EUROCRYPT \u201999","author":"P. Paillier","year":"1999","unstructured":"Paillier, P.: Public-key cryptosystems based on composite residuosity classes. In: Stern, J. (ed.) EUROCRYPT 1999. LNCS, vol.\u00a01592, pp. 223\u2013238. Springer, Heidelberg (1999)"},{"key":"20_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"126","DOI":"10.1007\/978-3-540-45146-4_8","volume-title":"Advances in Cryptology - CRYPTO 2003","author":"J. Camenisch","year":"2003","unstructured":"Camenisch, J., Shoup, V.: Practical Verifiable Encryption and Decryption of Discrete Logarithms. In: Boneh, D. (ed.) CRYPTO 2003. LNCS, vol.\u00a02729, pp. 126\u2013144. Springer, Heidelberg (2003)"},{"key":"20_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","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)"},{"issue":"16","key":"20_CR26","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.: Pairings for cryptographers. Discrete Applied Mathematics\u00a0156(16), 3113\u20133121 (2008)","journal-title":"Discrete Applied Mathematics"},{"key":"20_CR27","unstructured":"Chase, M.: Efficient Non-Interactive Zero-Knowledge Proofs for Privacy Applications. PhD Thesis, Brown University, pp. 57-67 (2008)"},{"key":"20_CR28","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)"},{"issue":"3","key":"20_CR29","doi-asserted-by":"publisher","first-page":"361","DOI":"10.1007\/s001450010003","volume":"13","author":"D. Pointcheval","year":"2000","unstructured":"Pointcheval, D., Stern, J.: Security arguments for digital signatures and blind signatures. Journal of Cryptology\u00a013(3), 361\u2013396 (2000)","journal-title":"Journal of Cryptology"},{"key":"20_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1007\/11693383_22","volume-title":"Selected Areas in Cryptography","author":"P.S.L.M. Barreto","year":"2006","unstructured":"Barreto, P.S.L.M., Naehrig, M.: Pairing- friendly elliptic curves of prime order. In: Preneel, B., Tavares, S. (eds.) SAC 2005. LNCS, vol.\u00a03897, pp. 319\u2013331. Springer, Heidelberg (2006)"},{"key":"20_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"304","DOI":"10.1007\/978-3-642-32298-3_20","volume-title":"Trusted Systems","author":"E. Brickell","year":"2012","unstructured":"Brickell, E., Chen, L., Li, J.: A (Corrected) DAA Scheme Using Batch Proof and Verification. In: Chen, L., Yung, M., Zhu, L. (eds.) INTRUST 2011. LNCS, vol.\u00a07222, pp. 304\u2013337. Springer, Heidelberg (2012)"}],"container-title":["Communications in Computer and Information Science","Frontiers in Internet Technologies"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-53959-6_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,3,19]],"date-time":"2022-03-19T16:08:02Z","timestamp":1647706082000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-53959-6_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642539589","9783642539596"],"references-count":31,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-53959-6_20","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"type":"print","value":"1865-0929"},{"type":"electronic","value":"1865-0937"}],"subject":[],"published":{"date-parts":[[2013]]}}}