{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,6]],"date-time":"2026-04-06T10:21:59Z","timestamp":1775470919726,"version":"3.50.1"},"publisher-location":"Cham","reference-count":62,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031400025","type":"print"},{"value":"9783031400032","type":"electronic"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023]]},"DOI":"10.1007\/978-3-031-40003-2_21","type":"book-chapter","created":{"date-parts":[[2023,8,9]],"date-time":"2023-08-09T13:03:04Z","timestamp":1691586184000},"page":"565-600","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Hash-Based Direct Anonymous Attestation"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-2680-4907","authenticated-orcid":false,"given":"Liqun","family":"Chen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8625-0275","authenticated-orcid":false,"given":"Changyu","family":"Dong","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2827-6493","authenticated-orcid":false,"given":"Nada","family":"El Kassem","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1262-2192","authenticated-orcid":false,"given":"Christopher J. P.","family":"Newton","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6963-7582","authenticated-orcid":false,"given":"Yalan","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,8,10]]},"reference":[{"key":"21_CR1","unstructured":"Bansarkhani, R.E., Kaafarani, A.E.: Direct anonymous attestation from lattices. IACR Cryptology ePrint Archive 2017, 1022 (2017)"},{"key":"21_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"266","DOI":"10.1007\/978-3-030-75245-3_11","volume-title":"Public-Key Cryptography \u2013 PKC 2021","author":"C Baum","year":"2021","unstructured":"Baum, C., de Saint Guilhem, C.D., Kales, D., Orsini, E., Scholl, P., Zaverucha, G.: Banquet: short and fast signatures from AES. In: Garay, J.A. (ed.) PKC 2021. LNCS, vol. 12710, pp. 266\u2013297. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-75245-3_11"},{"key":"21_CR3","unstructured":"Bernstein, D.J., H\u00fclsing, A., K\u00f6lbl, S., Niederhagen, R., Rijneveld, J., Schwabe, P.: The SPHINCS$${}^{+}$$ signature framework. In: ACM CCS, pp. 2129\u20132146 (2019)"},{"key":"21_CR4","doi-asserted-by":"crossref","unstructured":"Bhadauria, R., Fang, Z., Hazay, C., Venkitasubramaniam, M., Xie, T., Zhang, Y.: Ligero++: a new optimized sublinear IOP. In: ACM CCS, pp. 2025\u20132038 (2020)","DOI":"10.1145\/3372297.3417893"},{"key":"21_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1007\/978-3-030-12612-4_13","volume-title":"Topics in Cryptology \u2013 CT-RSA 2019","author":"D Boneh","year":"2019","unstructured":"Boneh, D., Eskandarian, S., Fisch, B.: Post-quantum EPID signatures from symmetric primitives. In: Matsui, M. (ed.) CT-RSA 2019. LNCS, vol. 11405, pp. 251\u2013271. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-12612-4_13"},{"key":"21_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"499","DOI":"10.1007\/978-3-642-13013-7_29","volume-title":"Public Key Cryptography \u2013 PKC 2010","author":"X Boyen","year":"2010","unstructured":"Boyen, X.: Lattice mixing and vanishing trapdoors: a framework for fully secure short signatures and more. In: Nguyen, P.Q., Pointcheval, D. (eds.) PKC 2010. LNCS, vol. 6056, pp. 499\u2013517. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-13013-7_29"},{"key":"21_CR7","doi-asserted-by":"crossref","unstructured":"Brickell, E.F., Camenisch, J., Chen, L.: Direct anonymous attestation. In: ACM CCS, pp. 132\u2013145 (2004)","DOI":"10.1145\/1030083.1030103"},{"key":"21_CR8","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. 4968, pp. 166\u2013178. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-68979-9_13"},{"key":"21_CR9","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. Secur. 8, 315\u2013300 (2009)","journal-title":"Int. J. Inf. Secur."},{"key":"21_CR10","first-page":"181","volume":"6101","author":"E Brickell","year":"2010","unstructured":"Brickell, E., Li, J.: A pairing-based DAA scheme further reducing TPM resources. Trust 6101, 181\u2013195 (2010)","journal-title":"Trust"},{"issue":"3","key":"21_CR11","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1109\/TDSC.2011.63","volume":"9","author":"E Brickell","year":"2012","unstructured":"Brickell, E., Li, J.: Enhanced privacy ID: a direct anonymous attestation scheme with enhanced revocation capabilities. IEEE Trans. Dependable Secur. Comput. 9(3), 345\u2013360 (2012)","journal-title":"IEEE Trans. Dependable Secur. Comput."},{"key":"21_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"194","DOI":"10.1007\/978-3-030-29959-0_10","volume-title":"Computer Security \u2013 ESORICS 2019","author":"M Buser","year":"2019","unstructured":"Buser, M., Liu, J.K., Steinfeld, R., Sakzad, A., Sun, S.-F.: DGM: a dynamic and revocable group Merkle signature. In: Sako, K., Schneider, S., Ryan, P.Y.A. (eds.) ESORICS 2019. LNCS, vol. 11735, pp. 194\u2013214. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-29959-0_10"},{"key":"21_CR13","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: IEEE S&P, pp. 901\u2013920 (2017)","DOI":"10.1109\/SP.2017.22"},{"key":"21_CR14","unstructured":"Camenisch, J., Drijvers, M., Edgington, A., Lehmann, T.A., Urian, R.: FIDO ECDAA algorithm (2018). http:\/\/fidoalliance.org\/specs\/fido-v2.0-id-20180227\/fido-ecdaa-algorithm-v2.0-id-20180227.html"},{"key":"21_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-319-45572-3_1","volume-title":"Trust and Trustworthy Computing","author":"J Camenisch","year":"2016","unstructured":"Camenisch, J., Drijvers, M., Lehmann, A.: Anonymous attestation using the strong Diffie Hellman assumption revisited. In: Franz, M., Papadimitratos, P. (eds.) Trust 2016. LNCS, vol. 9824, pp. 1\u201320. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-45572-3_1"},{"key":"21_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"234","DOI":"10.1007\/978-3-662-49387-8_10","volume-title":"Public-Key Cryptography \u2013 PKC 2016","author":"J Camenisch","year":"2016","unstructured":"Camenisch, J., Drijvers, M., Lehmann, A.: Universally composable direct anonymous attestation. In: Cheng, C.-M., Chung, K.-M., Persiano, G., Yang, B.-Y. (eds.) PKC 2016. LNCS, vol. 9615, pp. 234\u2013264. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-49387-8_10"},{"key":"21_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"427","DOI":"10.1007\/978-3-319-63697-9_15","volume-title":"Advances in Cryptology \u2013 CRYPTO 2017","author":"J Camenisch","year":"2017","unstructured":"Camenisch, J., Drijvers, M., Lehmann, A.: Anonymous attestation with subverted TPMs. In: Katz, J., Shacham, H. (eds.) CRYPTO 2017. LNCS, vol. 10403, pp. 427\u2013461. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-63697-9_15"},{"key":"21_CR18","unstructured":"Casey, M., Chen, L., Giannetsos, T., Newton, C., Sasse, R., Whitefield, J.: Direct anonymous attestation in the wild. Presentation at Real World Crypto (2019). https:\/\/rwc.iacr.org\/2019\/slides\/DAA.pdf"},{"key":"21_CR19","unstructured":"Chase, M., et al.: The Picnic signature scheme design document (2020). https:\/\/microsoft.github.io\/Picnic\/"},{"key":"21_CR20","doi-asserted-by":"crossref","unstructured":"Chase, M., et al.: Post-quantum zero-knowledge and signatures from symmetric-key primitives. In: ACM CCS, pp. 1825\u20131842 (2017)","DOI":"10.1145\/3133956.3133997"},{"key":"21_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1007\/3-540-46416-6_22","volume-title":"Advances in Cryptology \u2014 EUROCRYPT \u201991","author":"D Chaum","year":"1991","unstructured":"Chaum, D., van Heyst, E.: Group signatures. In: Davies, D.W. (ed.) EUROCRYPT 1991. LNCS, vol. 547, pp. 257\u2013265. Springer, Heidelberg (1991). https:\/\/doi.org\/10.1007\/3-540-46416-6_22"},{"key":"21_CR22","first-page":"1","volume":"2021","author":"L Chen","year":"2021","unstructured":"Chen, L., Tu, T., Yu, K., Zhao, M., Wang, Y.: V-LDAA: a new lattice-based direct anonymous attestation scheme for VANETs system. Secur. Commun. Netw. 2021, 1\u201313 (2021)","journal-title":"Secur. Commun. Netw."},{"key":"21_CR23","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. 6151, pp. 350\u2013365. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-16342-5_26"},{"key":"21_CR24","doi-asserted-by":"crossref","unstructured":"Chen, L., El Kassem, N., Lehmann, A., Lyubashevsky, V.: A framework for efficient lattice-based DAA. In: Proceedings of the 1st ACM Workshop on Cyber-Security Arms Race, pp. 23\u201334 (2019)","DOI":"10.1145\/3338511.3357349"},{"key":"21_CR25","doi-asserted-by":"crossref","unstructured":"Chen, L., El Kassem, N., Newton, C.J.: How to bind a TPM\u2019s attestation keys with its endorsement key. Comput. J. bxad037 (2023)","DOI":"10.1093\/comjnl\/bxad037"},{"key":"21_CR26","doi-asserted-by":"crossref","unstructured":"Chen, L., Li, J.: Flexible and scalable digital signatures in TPM 2.0. In: ACM CCS, pp. 37\u201348 (2013)","DOI":"10.1145\/2508859.2516729"},{"key":"21_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. 5324, pp. 156\u2013175. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-88733-1_11"},{"key":"21_CR28","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. 6035, pp. 223\u2013237. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-12510-2_16"},{"key":"21_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"228","DOI":"10.1007\/978-3-319-22846-4_14","volume-title":"Trust and Trustworthy Computing","author":"L Chen","year":"2015","unstructured":"Chen, L., Urian, R.: DAA-A: direct anonymous attestation with attributes. In: Conti, M., Schunter, M., Askoxylakis, I. (eds.) Trust 2015. LNCS, vol. 9229, pp. 228\u2013245. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-22846-4_14"},{"key":"21_CR30","unstructured":"Dai, Y., Zhang, F., Zhao, C.A.: Fast hashing to $$G_2$$ in direct anonymous attestation. Cryptology ePrint Archive (2022\/996)"},{"key":"21_CR31","doi-asserted-by":"crossref","unstructured":"Dobraunig, C., Kales, D., Rechberger, C., Schofnegger, M., Zaverucha, G.: Shorter signatures based on tailor-made minimalist symmetric-key crypto. In: ACM CCS, pp. 843\u2013857 (2022)","DOI":"10.1145\/3548606.3559353"},{"key":"21_CR32","doi-asserted-by":"crossref","unstructured":"Ducas, L., et al.: Crystals-Dilithium: a lattice-based digital signature scheme. IACR Trans. Cryptographic Hardw. Embed. Syst. 238\u2013268 (2018)","DOI":"10.46586\/tches.v2018.i1.238-268"},{"key":"21_CR33","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"441","DOI":"10.1007\/978-3-319-79063-3_21","volume-title":"Post-Quantum Cryptography","author":"R El Bansarkhani","year":"2018","unstructured":"El Bansarkhani, R., Misoczki, R.: G-Merkle: a hash-based group signature scheme from standard assumptions. In: Lange, T., Steinwandt, R. (eds.) PQCrypto 2018. LNCS, vol. 10786, pp. 441\u2013463. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-79063-3_21"},{"key":"21_CR34","unstructured":"El Kassem, N.: Lattice-based direct anonymous attestation. Ph.D. thesis, University of Surrey (2020)"},{"key":"21_CR35","doi-asserted-by":"publisher","first-page":"425","DOI":"10.1016\/j.future.2019.04.036","volume":"99","author":"N El Kassem","year":"2019","unstructured":"El Kassem, N., et al.: More efficient, provably-secure direct anonymous attestation from lattices. Futur. Gener. Comput. Syst. 99, 425\u2013458 (2019)","journal-title":"Futur. Gener. Comput. Syst."},{"key":"21_CR36","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1007\/978-3-540-71677-8_13","volume-title":"Public Key Cryptography \u2013 PKC 2007","author":"E Fujisaki","year":"2007","unstructured":"Fujisaki, E., Suzuki, K.: Traceable ring signature. In: Okamoto, T., Wang, X. (eds.) PKC 2007. LNCS, vol. 4450, pp. 181\u2013200. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-71677-8_13"},{"key":"21_CR37","unstructured":"Giacomelli, I., Madsen, J., Orlandi, C.: ZKBoo: faster zero-knowledge for Boolean circuits. In: USENIX Security, pp. 1069\u20131083 (2016)"},{"key":"21_CR38","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. LNCS, vol. 7045, pp. 577\u2013587. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-25106-1_11"},{"key":"21_CR39","doi-asserted-by":"crossref","unstructured":"Hicks, C., Garcia, F.D.: A vehicular DAA scheme for unlinkable ECDSA pseudonyms in V2X. In: EuroS&P, pp. 460\u2013473 (2020)","DOI":"10.1109\/EuroSP48549.2020.00036"},{"key":"21_CR40","doi-asserted-by":"crossref","unstructured":"Ishai, Y., Kushilevitz, E., Ostrovsky, R., Sahai, A.: Zero-knowledge from secure multiparty computation. In: STOC, pp. 21\u201330 (2007)","DOI":"10.1145\/1250790.1250794"},{"key":"21_CR41","unstructured":"ISO\/IEC 10118-2:2010: Information technology - Security techniques - Hash-functions - Part 2: Hash-functions using an $$n$$-bit block cipher. Standard, International Organization for Standardization (2010)"},{"key":"21_CR42","unstructured":"ISO\/IEC 20008-2: 2013: Information technology - Security techniques - Anonymous digital signatures - Part 2: Mechanisms using a group public key. Standard, International Organization for Standardization (2013)"},{"key":"21_CR43","unstructured":"Kales, D., Zaverucha, G.: Efficient lifting for shorter zero-knowledge proofs and post-quantum signatures. Cryptology ePrint Archive (2022\/588)"},{"key":"21_CR44","unstructured":"Kassem, N.E., et al.: Lattice-based direct anonymous attestation (LDAA). Cryptology ePrint Archive (2018\/401)"},{"key":"21_CR45","doi-asserted-by":"crossref","unstructured":"Katz, J., Kolesnikov, V., Wang, X.: Improved non-interactive zero knowledge with applications to post-quantum signatures. In: ACM CCS, pp. 525\u2013537 (2018)","DOI":"10.1145\/3243734.3243805"},{"key":"21_CR46","doi-asserted-by":"crossref","unstructured":"Kim, S., et al.: AIM: symmetric primitive for shorter signatures with stronger security. Cryptology ePrint Archive (2022\/1387)","DOI":"10.1145\/3576915.3616579"},{"key":"21_CR47","unstructured":"Lamport, L.: Constructing digital signatures from a one-way function. Technical report: SRI International Computer Science Laboratory (1979)"},{"key":"21_CR48","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"218","DOI":"10.1007\/0-387-34805-0_21","volume-title":"Advances in Cryptology \u2014 CRYPTO\u2019 89 Proceedings","author":"RC Merkle","year":"1990","unstructured":"Merkle, R.C.: A certified digital signature. In: Brassard, G. (ed.) CRYPTO 1989. LNCS, vol. 435, pp. 218\u2013238. Springer, New York (1990). https:\/\/doi.org\/10.1007\/0-387-34805-0_21"},{"key":"21_CR49","unstructured":"NIST: NIST announces first four quantum resistant cryptographic algorithms (2022). https:\/\/www.nist.gov\/news-events\/news\/2022\/07\/nist-announces-first-four-quantum-resistant-cryptographic-algorithms"},{"key":"21_CR50","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"669","DOI":"10.1007\/978-3-030-38471-5_27","volume-title":"Selected Areas in Cryptography \u2013 SAC 2019","author":"CD de Saint Guilhem","year":"2020","unstructured":"de Saint Guilhem, C.D., De Meyer, L., Orsini, E., Smart, N.P.: BBQ: using AES in picnic signatures. In: Paterson, K.G., Stebila, D. (eds.) SAC 2019. LNCS, vol. 11959, pp. 669\u2013692. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-38471-5_27"},{"key":"21_CR51","unstructured":"de Saint Guilhem, C.D., Orsini, E., Tanguy, T.: Limbo: efficient zero-knowledge MPCitH-based arguments. In: ACM CCS, pp. 3022\u20133036 (2021)"},{"issue":"5","key":"21_CR52","doi-asserted-by":"publisher","first-page":"1061","DOI":"10.1007\/s10623-021-00857-9","volume":"89","author":"M Shafieinejad","year":"2021","unstructured":"Shafieinejad, M., Esfahani, N.N.: A scalable post-quantum hash-based group signature. Des. Codes Crypt. 89(5), 1061\u20131090 (2021). https:\/\/doi.org\/10.1007\/s10623-021-00857-9","journal-title":"Des. Codes Crypt."},{"key":"21_CR53","unstructured":"TCG: TPM 1.2 Main Specification. Rev 116, Trusted Computing Group (2011). https:\/\/trustedcomputinggroup.org\/resource\/tpm-main-specification\/"},{"key":"21_CR54","unstructured":"TCG: Trusted Platform Module 2.0 Library Specification. Rev 01.59, Trusted Computing Group (2019). https:\/\/trustedcomputinggroup.org\/resource\/tpm-library-specification\/"},{"key":"21_CR55","doi-asserted-by":"crossref","unstructured":"Wang, H.Z., Huang, L.S.: An improved trusted cloud computing platform model based on DAA and privacy CA scheme. In: 2010 International Conference on Computer Application and System Modeling (ICCASM 2010), pp. 13\u201333 (2010)","DOI":"10.1109\/ICCASM.2010.5622643"},{"key":"21_CR56","doi-asserted-by":"crossref","unstructured":"Wesemeyer, S., Newton, C.J., Treharne, H., Chen, L., Sasse, R., Whitefield, J.: Formal analysis and implementation of a TPM 2.0-based direct anonymous attestation scheme. In: AsiaCCS, pp. 784\u2013798 (2020)","DOI":"10.1145\/3320269.3372197"},{"key":"21_CR57","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: IEEE Vehicular Networking Conference (VNC), pp. 123\u2013130 (2017)","DOI":"10.1109\/VNC.2017.8275615"},{"key":"21_CR58","doi-asserted-by":"crossref","unstructured":"Whitefield, J., Chen, L., Sasse, R., Schneider, S., Treharne, H., Wesemeyer, S.: A symbolic analysis of ECC-based direct anonymous attestation. In: EuroS &P, pp. 127\u2013141 (2019)","DOI":"10.1109\/EuroSP.2019.00019"},{"key":"21_CR59","doi-asserted-by":"publisher","first-page":"2260","DOI":"10.1109\/TIFS.2021.3051801","volume":"16","author":"K Yang","year":"2021","unstructured":"Yang, K., Chen, L., Zhang, Z., Newton, C.J.P., Yang, B., Xi, L.: Direct anonymous attestation with optimal TPM signing efficiency. IEEE Trans. Inf. Forensics Secur. 16, 2260\u20132275 (2021). https:\/\/doi.org\/10.1109\/TIFS.2021.3051801","journal-title":"IEEE Trans. Inf. Forensics Secur."},{"key":"21_CR60","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"136","DOI":"10.1007\/978-3-030-92548-2_8","volume-title":"Cryptology and Network Security","author":"M Yehia","year":"2021","unstructured":"Yehia, M., AlTawy, R., Gulliver, T.A.: $${GM}^{MT}$$: a\u00a0revocable group Merkle multi-tree signature scheme. In: Conti, M., Stevens, M., Krenn, S. (eds.) CANS 2021. LNCS, vol. 13099, pp. 136\u2013157. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-92548-2_8"},{"key":"21_CR61","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1007\/978-3-030-88323-2_4","volume-title":"Information Security and Cryptology","author":"M Yehia","year":"2021","unstructured":"Yehia, M., AlTawy, R., Gulliver, T.A.: Security analysis of DGM and GM group signature schemes instantiated with XMSS-T. In: Yu, Yu., Yung, M. (eds.) Inscrypt 2021. LNCS, vol. 13007, pp. 61\u201381. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-88323-2_4"},{"key":"21_CR62","unstructured":"Zaverucha, G.: The Picnic signature algorithm specification. Supporting Documentation (2020). https:\/\/github.com\/Microsoft\/Picnic"}],"container-title":["Lecture Notes in Computer Science","Post-Quantum Cryptography"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-40003-2_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,25]],"date-time":"2024-10-25T22:49:38Z","timestamp":1729896578000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-40003-2_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031400025","9783031400032"],"references-count":62,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-40003-2_21","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"10 August 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"PQCrypto","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Post-Quantum Cryptography","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"College Park, MD","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16 August 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18 August 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"pqcrypto2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/pqcrypto2023.umiacs.io\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"easychair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"51","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"25","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"49% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3.16","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3.30","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}