{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T11:29:07Z","timestamp":1740137347877,"version":"3.37.3"},"reference-count":44,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2020,7,2]],"date-time":"2020-07-02T00:00:00Z","timestamp":1593648000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,7,2]],"date-time":"2020-07-02T00:00:00Z","timestamp":1593648000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100010418","name":"Institute for Information and Communications Technology Promotion","doi-asserted-by":"crossref","award":["2016-6-00599"],"award-info":[{"award-number":["2016-6-00599"]}],"id":[{"id":"10.13039\/501100010418","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Int. J. Inf. Secur."],"published-print":{"date-parts":[[2021,8]]},"DOI":"10.1007\/s10207-020-00507-6","type":"journal-article","created":{"date-parts":[[2020,7,2]],"date-time":"2020-07-02T06:49:30Z","timestamp":1593672570000},"page":"475-492","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Improving the security of direct anonymous attestation under host corruptions"],"prefix":"10.1007","volume":"20","author":[{"given":"Hyoseung","family":"Kim","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kwangsu","family":"Lee","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2742-6119","authenticated-orcid":false,"given":"Jong Hwan","family":"Park","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dong Hoon","family":"Lee","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,7,2]]},"reference":[{"key":"507_CR1","unstructured":"Ballard, L., Green, M., de\u00a0Medeiros, B., Monrose, F.: Correlation-resistant storage. Technical report, TR-SP-BGMM-050507, Johns Hopkins University Department of Computer Science (2005)"},{"key":"507_CR2","doi-asserted-by":"crossref","unstructured":"Baric, N., Pfitzmann, B.: Collision-free accumulators and fail-stop signature schemes without trees. In: Advances in Cryptology\u2014EUROCRYPT \u201997. Lecture Notes in Computer Science, vol.\u00a01233, pp. 480\u2013494. Springer (1997)","DOI":"10.1007\/3-540-69053-0_33"},{"key":"507_CR3","doi-asserted-by":"crossref","unstructured":"Barreto, P.S.L.M., Naehrig, M.: Pairing-friendly elliptic curves of prime order. In: Selected Areas in Cryptography\u2014SAC \u201905. Lecture Notes in Computer Science, vol.\u00a03897, pp. 319\u2013331. Springer (2005)","DOI":"10.1007\/11693383_22"},{"key":"507_CR4","doi-asserted-by":"crossref","unstructured":"Bellare, M., Rogaway, P.: Random oracles are practical: A paradigm for designing efficient protocols. In: Computer and Communications Security\u2014CCS \u201993. pp. 62\u201373. ACM (1993)","DOI":"10.1145\/168588.168596"},{"key":"507_CR5","doi-asserted-by":"crossref","unstructured":"Bernhard, D., Fischlin, M., Warinschi, B.: Adaptive proofs of knowledge in the random oracle model. Public-Key Cryptography\u2014PKC \u201915. Lecture Notes in Computer Science, vol.\u00a09020, pp. 625\u2013649. Springer (2015)","DOI":"10.1007\/978-3-662-46447-2_28"},{"issue":"3","key":"507_CR6","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1007\/s10207-013-0191-z","volume":"12","author":"D Bernhard","year":"2013","unstructured":"Bernhard, D., Fuchsbauer, G., Ghadafi, E., Smart, N.P., Warinschi, B.: Anonymous attestation with user-controlled linkability. Int. J. Inf. Sec. 12(3), 219\u2013249 (2013)","journal-title":"Int. J. Inf. Sec."},{"key":"507_CR7","doi-asserted-by":"crossref","unstructured":"Bichsel, P., Camenisch, J., Neven, G., Smart, N.P., Warinschi, B.: Get shorty via group signatures without encryption. In: Security and Cryptography for Networks- SCN \u201910. Lecture Notes in Computer Science, vol.\u00a06280, pp. 381\u2013398. Springer (2010)","DOI":"10.1007\/978-3-642-15317-4_24"},{"key":"507_CR8","doi-asserted-by":"crossref","unstructured":"Boneh, D., Boyen, X.: Short signatures without random oracles. In: Advances in Cryptology\u2014EUROCRYPT \u201904. Lecture Notes in Computer Science, vol.\u00a03027, pp. 56\u201373. Springer (2004)","DOI":"10.1007\/978-3-540-24676-3_4"},{"key":"507_CR9","doi-asserted-by":"crossref","unstructured":"Boneh, D., Boyen, X., Shacham, H.: Short group signatures. In: Advances in Cryptology\u2014CRYPTO \u201904. Lecture Notes in Computer Science, vol.\u00a03152, pp. 41\u201355. Springer (2004)","DOI":"10.1007\/978-3-540-28628-8_3"},{"key":"507_CR10","doi-asserted-by":"crossref","unstructured":"Brickell, E.F., Camenisch, J., Chen, L.: Direct anonymous attestation. In: Computer and Communications Security\u2014CCS \u201904. pp. 132\u2013145. ACM (2004)","DOI":"10.1145\/1030083.1030103"},{"key":"507_CR11","doi-asserted-by":"crossref","unstructured":"Brickell, E., Chen, L., Li, J.: A new direct anonymous attestation scheme from bilinear maps. In: Trusted Computing: Challenges and Applications\u2014TRUST \u201908. Lecture Notes in Computer Science, vol.\u00a04968, pp. 166\u2013178. Springer (2008)","DOI":"10.1007\/978-3-540-68979-9_13"},{"issue":"5","key":"507_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 of direct anonymous attestation and a concrete scheme from pairings. Int. J. Inf. Sec. 8(5), 315\u2013330 (2009)","journal-title":"Int. J. Inf. Sec."},{"key":"507_CR13","doi-asserted-by":"crossref","unstructured":"Brickell, E., Chen, L., Li, J.: A (corrected) DAA scheme using batch proof and verification. In: Trusted Systems\u2014INTRUST \u201911. Lecture Notes in Computer Science, vol.\u00a07222, pp. 304\u2013337. Springer (2011)","DOI":"10.1007\/978-3-642-32298-3_20"},{"key":"507_CR14","doi-asserted-by":"crossref","unstructured":"Brickell, E., Li, J.: Enhanced privacy id: a direct anonymous attestation scheme with enhanced revocation capabilities. In: Workshop on Privacy in the Electronic Society\u2014WPES \u201907. pp. 21\u201330. ACM (2007)","DOI":"10.1145\/1314333.1314337"},{"key":"507_CR15","doi-asserted-by":"crossref","unstructured":"Brickell, E., Li, J.: A pairing-based DAA scheme further reducing TPM resources. In: Trust and Trustworthy Computing\u2014TRUST \u201910. Lecture Notes in Computer Science, vol.\u00a06101, pp. 181\u2013195. Springer (2010)","DOI":"10.1007\/978-3-642-13869-0_12"},{"issue":"1","key":"507_CR16","first-page":"3","volume":"1","author":"E Brickell","year":"2011","unstructured":"Brickell, E., Li, J.: Enhanced privacy ID from bilinear pairing for hardware authentication and attestation. Int. J. Inf. Priv. Secur. Integr. 1(1), 3\u201333 (2011)","journal-title":"Int. J. Inf. Priv. Secur. Integr."},{"key":"507_CR17","doi-asserted-by":"crossref","unstructured":"Beimel, A., Malkin, T., Micali, S.: The All-or-nothing nature of two-party secure computation. In: Advances in Cryptology\u2014CRYPTO \u201999. Lecture Notes in Computer Science, vol.\u00a01666, pp. 80\u201397. Springer (1999)","DOI":"10.1007\/3-540-48405-1_6"},{"key":"507_CR18","doi-asserted-by":"crossref","unstructured":"Camenisch, J., Chen, L., Drijvers, M., Lehmann, A., Novick, D., Urian, R.: One TPM to bind them all: Fixing TPM 2.0 for provably secure anonymous attestation. In: Security and Privacy\u2014SP \u201917. pp. 901\u2013920. IEEE Computer Society (2017)","DOI":"10.1109\/SP.2017.22"},{"key":"507_CR19","unstructured":"Camenisch, J., Drijvers, M., Edgington, A., Lehmann, A., Lindemann, R., Urian, R.: FIDO ECDAA algorithm (2017), https:\/\/fidoalliance.org\/specs\/fido-uaf-v1.1-id-20170202\/fido-ecdaa-algorithm-v1.1-id-20170202.html"},{"key":"507_CR20","doi-asserted-by":"crossref","unstructured":"Camenisch, J., Drijvers, M., Lehmann, A.: Anonymous attestation using the strong diffie hellman assumption revisited. In: Trust and Trustworthy Computing\u2014TRUST \u201916. Lecture Notes in Computer Science, vol.\u00a09824, pp. 1\u201320. Springer (2016)","DOI":"10.1007\/978-3-319-45572-3_1"},{"key":"507_CR21","doi-asserted-by":"crossref","unstructured":"Camenisch, J., Drijvers, M., Lehmann, A.: Universally composable direct anonymous attestation. In: Public-Key Cryptography\u2014PKC \u201916 Part II. Lecture Notes in Computer Science, vol.\u00a09615, pp. 234\u2013264. Springer (2016)","DOI":"10.1007\/978-3-662-49387-8_10"},{"key":"507_CR22","doi-asserted-by":"crossref","unstructured":"Camenisch, J., Drijvers, M., Lehmann, A.: Anonymous attestation with subverted tpms. In: Advances in Cryptology\u2014CRYPTO \u201917 Part III. Lecture Notes in Computer Science, vol. 10403, pp. 427\u2013461. Springer (2017)","DOI":"10.1007\/978-3-319-63697-9_15"},{"key":"507_CR23","doi-asserted-by":"crossref","unstructured":"Camenisch, J., Stadler, M.: Efficient group signature schemes for large groups (extended abstract). In: Advances in Cryptology\u2014CRYPTO \u201997. Lecture Notes in Computer Science, vol.\u00a01294, pp. 410\u2013424. Springer (1997)","DOI":"10.1007\/BFb0052252"},{"key":"507_CR24","doi-asserted-by":"crossref","unstructured":"Chen, L.: A DAA scheme requiring less TPM resources. In: Information Security and Cryptology\u2014Inscrypt \u201909. Lecture Notes in Computer Science, vol.\u00a06151, pp. 350\u2013365. Springer (2009)","DOI":"10.1007\/978-3-642-16342-5_26"},{"key":"507_CR25","doi-asserted-by":"crossref","unstructured":"Chen, L., Li, J.: Flexible and scalable digital signatures in TPM 2.0. In: Computer and Communications Security\u2014CCS \u201913. pp. 37\u201348. ACM (2013)","DOI":"10.1145\/2508859.2516729"},{"key":"507_CR26","doi-asserted-by":"crossref","unstructured":"Chen, L., Morrissey, P., Smart, N.P.: On proofs of security for DAA schemes. In: Provable Security, Second International Conference\u2014ProvSec \u201908. Lecture Notes in Computer Science, vol.\u00a05324, pp. 156\u2013175. Springer (2008)","DOI":"10.1007\/978-3-540-88733-1_11"},{"key":"507_CR27","doi-asserted-by":"crossref","unstructured":"Chen, L., Morrissey, P., Smart, N.P.: Pairings in trusted computing. In: Pairing-Based Cryptography\u2014Pairing \u201908. Lecture Notes in Computer Science, vol.\u00a05209, pp. 1\u201317. Springer (2008)","DOI":"10.1007\/978-3-540-85538-5_1"},{"key":"507_CR28","doi-asserted-by":"crossref","unstructured":"Chen, L., Page, D., Smart, N.P.: On the design and implementation of an efficient DAA scheme. In: Smart Card Research and Advanced Application\u2014CARDIS \u201910. Lecture Notes in Computer Science, vol.\u00a06035, pp. 223\u2013237. Springer (2010)","DOI":"10.1007\/978-3-642-12510-2_16"},{"key":"507_CR29","doi-asserted-by":"crossref","unstructured":"Chen, L., Urian, R.: DAA-A: direct anonymous attestation with attributes. In: Trust and Trustworthy Computing\u2014TRUST \u201915. Lecture Notes in Computer Science, vol.\u00a09229, pp. 228\u2013245. Springer (2015)","DOI":"10.1007\/978-3-319-22846-4_14"},{"issue":"12","key":"507_CR30","first-page":"43","volume":"3","author":"X Chen","year":"2008","unstructured":"Chen, X., Feng, D.: Direct anonymous attestation for next generation TPM. J. Compt. 3(12), 43\u201350 (2008)","journal-title":"J. Compt."},{"key":"507_CR31","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.\u00a0263, pp. 186\u2013194. Springer (1986)","DOI":"10.1007\/3-540-47721-7_12"},{"key":"507_CR32","doi-asserted-by":"crossref","unstructured":"Fischlin, M.: Communication-efficient non-interactive proofs of knowledge with online extractors. In: Advances in Cryptology\u2014CRYPTO \u201905. Lecture Notes in Computer Science, vol.\u00a03621, pp. 152\u2013168. Springer (2005)","DOI":"10.1007\/11535218_10"},{"issue":"16","key":"507_CR33","doi-asserted-by":"publisher","first-page":"3113","DOI":"10.1016\/j.dam.2007.12.010","volume":"156","author":"SD Galbraith","year":"2008","unstructured":"Galbraith, S.D., Paterson, K.G., Smart, N.P.: Pairings for cryptographers. Discret. Appl. Math. 156(16), 3113\u20133121 (2008)","journal-title":"Discret. Appl. Math."},{"key":"507_CR34","doi-asserted-by":"crossref","unstructured":"Garman, C., Green, M., Miers, I.: Decentralized anonymous credentials. In: Network and Distributed System Security Symposium\u2014NDSS \u201914. The Internet Society (2014)","DOI":"10.14722\/ndss.2014.23253"},{"key":"507_CR35","doi-asserted-by":"crossref","unstructured":"Groth, J.: Simulation-sound NIZK proofs for a practical language and constant size group signatures. In: Advances in Cryptology\u2014ASIACRYPT \u201906. Lecture Notes in Computer Science, vol.\u00a04284, pp. 444\u2013459. Springer (2006)","DOI":"10.1007\/11935230_29"},{"key":"507_CR36","unstructured":"ISO: ISO\/IEC 20008-2. Information technology: Security techniques\u2014Anonymous digital signatures\u2014Part 2: Mechanisms using a group public key approach. Standard, International Organization for Standardization (2013)"},{"key":"507_CR37","doi-asserted-by":"crossref","unstructured":"Lysyanskaya, A., Rivest, R.L., Sahai, A., Wolf, S.: Pseudonym systems. In: Selected Areas in Cryptography\u2014SAC \u201999. Lecture Notes in Computer Science, vol.\u00a01758, pp. 184\u2013199. Springer (1999)","DOI":"10.1007\/3-540-46513-8_14"},{"key":"507_CR38","doi-asserted-by":"crossref","unstructured":"Proudler, G., Chen, L., Dalton, C.: Trusted Computing Platforms\u2014TPM2.0 in Context. Springer (2014)","DOI":"10.1007\/978-3-319-08744-3"},{"key":"507_CR39","unstructured":"Raj, H., Saroiu, S., Wolman, A., Aigner, R., Cox, J., England, P., Fenner, C., Kinshumann, K., L\u00f6ser, J., Mattoon, D., Nystr\u00f6m, M., Robinson, D., Spiger, R., Thom, S., Wooten, D.: fTPM: A software-only implementation of a TPM chip. In: USENIX Security Symposium \u201916. pp. 841\u2013856. USENIX Association (2016)"},{"key":"507_CR40","unstructured":"Trusted Computing Group (TCG): TPM main specification version 1.2 (2004), https:\/\/trustedcomputinggroup.org"},{"key":"507_CR41","unstructured":"Trusted Computing Group (TCG): 2.0 Automotive Thin Profile (2014),https:\/\/trustedcomputinggroup.org"},{"key":"507_CR42","unstructured":"Trusted Computing Group (TCG): Trusted platform module library specification, family \u201c2.0\u201d (2014), https:\/\/trustedcomputinggroup.org"},{"key":"507_CR43","doi-asserted-by":"crossref","unstructured":"Whitefield, J., Chen, L., Giannetsos, T., Schneider, S., Treharne, H.: Privacy-enhanced capabilities for vanets using direct anonymous attestation. In: Vehicular Networking Conference\u2014VNC \u201917. pp. 123\u2013130. IEEE (2017)","DOI":"10.1109\/VNC.2017.8275615"},{"key":"507_CR44","doi-asserted-by":"crossref","unstructured":"Xi, L., Yang, K., Zhang, Z., Feng, D.: DAA-related apis in TPM 2.0 revisited. In: Trust and Trustworthy Computing\u2014TRUST \u201914. Lecture Notes in Computer Science, vol.\u00a08564, pp. 1\u201318. Springer (2014)","DOI":"10.1007\/978-3-319-08593-7_1"}],"container-title":["International Journal of Information Security"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10207-020-00507-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10207-020-00507-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10207-020-00507-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,7,27]],"date-time":"2021-07-27T09:09:43Z","timestamp":1627376983000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10207-020-00507-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,7,2]]},"references-count":44,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2021,8]]}},"alternative-id":["507"],"URL":"https:\/\/doi.org\/10.1007\/s10207-020-00507-6","relation":{},"ISSN":["1615-5262","1615-5270"],"issn-type":[{"type":"print","value":"1615-5262"},{"type":"electronic","value":"1615-5270"}],"subject":[],"published":{"date-parts":[[2020,7,2]]},"assertion":[{"value":"2 July 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Compliance with ethical standards"}},{"value":"The authors declare that they have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}},{"value":"This article does not contain any studies with human participants or animals performed by any of the authors.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethical approval"}}]}}