{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,7]],"date-time":"2026-05-07T04:22:35Z","timestamp":1778127755414,"version":"3.51.4"},"publisher-location":"Cham","reference-count":49,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031627422","type":"print"},{"value":"9783031627439","type":"electronic"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"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":[[2024]]},"DOI":"10.1007\/978-3-031-62743-9_2","type":"book-chapter","created":{"date-parts":[[2024,6,10]],"date-time":"2024-06-10T23:02:58Z","timestamp":1718060578000},"page":"37-71","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["A New Hash-Based Enhanced Privacy ID Signature Scheme"],"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":[[2024,6,11]]},"reference":[{"key":"2_CR1","doi-asserted-by":"publisher","first-page":"581","DOI":"10.1007\/978-3-031-38554-4_19","volume-title":"CRYPTO","author":"C Baum","year":"2023","unstructured":"Baum, C., et al.: Publicly verifiable zero-knowledge and post-quantum signatures from VOLE-in-the-Head. In: Handschuh, H., Lysyanskaya, A. (eds.) CRYPTO. LNCS, vol. 14085, pp. 581\u2013615. Springer, Heidelberg (2023). https:\/\/doi.org\/10.1007\/978-3-031-38554-4_19"},{"key":"2_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":"2_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1007\/978-3-030-17653-2_4","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2019","author":"E Ben-Sasson","year":"2019","unstructured":"Ben-Sasson, E., Chiesa, A., Riabzev, M., Spooner, N., Virza, M., Ward, N.P.: Aurora: transparent succinct arguments for R1CS. In: Ishai, Y., Rijmen, V. (eds.) EUROCRYPT 2019. LNCS, vol. 11476, pp. 103\u2013128. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-17653-2_4"},{"key":"2_CR4","doi-asserted-by":"crossref","unstructured":"Bernstein, D.J., H\u00fclsing, A., K\u00f6lbl, S., Niederhagen, R., Rijneveld, J., Schwabe, P.: The SPHINCS$${}^{\\text{+}}$$ signature framework. In: ACM CCS, pp. 2129\u20132146 (2019)","DOI":"10.1145\/3319535.3363229"},{"key":"2_CR5","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":"2_CR6","doi-asserted-by":"publisher","first-page":"13791","DOI":"10.1007\/s11042-023-15737-8","volume":"85","author":"C Biswas","year":"2023","unstructured":"Biswas, C., Dutta, R., Sarkar, S.: An efficient post-quantum secure dynamic EPID signature scheme using lattices. Multimedia Tools Appl. 85, 13791\u201313820 (2023)","journal-title":"Multimedia Tools Appl."},{"key":"2_CR7","doi-asserted-by":"crossref","unstructured":"Blanchet, B., et\u00a0al.: Modeling and verifying security protocols with the applied Pi calculus and ProVerif. Found. Trends\u00ae Priv. Secur. 1(1-2), 1\u2013135 (2016)","DOI":"10.1561\/3300000004"},{"key":"2_CR8","doi-asserted-by":"crossref","unstructured":"Boneh, D., Eskandarian, S., Fisch, B.: Post-quantum EPID signatures from symmetric primitives. In: CT-RSA, pp. 251\u2013271 (2019)","DOI":"10.1007\/978-3-030-12612-4_13"},{"key":"2_CR9","doi-asserted-by":"crossref","unstructured":"Boneh, D., Shacham, H.: Group signatures with verifier-local revocation. In: ACM CCS, pp. 168\u2013177 (2004)","DOI":"10.1145\/1030083.1030106"},{"key":"2_CR10","doi-asserted-by":"crossref","unstructured":"Bootle, J., Lyubashevsky, V., Nguyen, N.K., Sorniotti, A.: A framework for practical anonymous credentials from lattices. Cryptology ePrint Archive, Paper 2023\/560 (2023). https:\/\/eprint.iacr.org\/2023\/560","DOI":"10.1007\/978-3-031-38545-2_13"},{"key":"2_CR11","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":"2_CR12","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 2007 ACM Workshop on Privacy in Electronic Society, pp. 21\u201330 (2007)","DOI":"10.1145\/1314333.1314337"},{"key":"2_CR13","unstructured":"Brickell, E., Li, J.: Enhanced Privacy ID from bilinear pairing. Cryptology ePrint Archive, Paper 2009\/095 (2009). https:\/\/eprint.iacr.org\/2009\/095"},{"issue":"1","key":"2_CR14","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. 2 1(1), 3\u201333 (2011)","journal-title":"Int. J. Inf. Priv. Secur. Integr. 2"},{"issue":"3","key":"2_CR15","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. Depend. Secur. Comput. 9(3), 345\u2013360 (2012)","journal-title":"IEEE Trans. Depend. Secur. Comput."},{"key":"2_CR16","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 Symposium on Security and Privacy, pp. 901\u2013920. IEEE (2017)","DOI":"10.1109\/SP.2017.22"},{"key":"2_CR17","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":"2_CR18","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":"2_CR19","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":"2_CR20","doi-asserted-by":"crossref","unstructured":"Chen, L., Xu, Z., Tu, T., Wang, Z.: Lattice-based privacy enhanced identity protocol for SDO services. In: International Conference on Signal and Image Processing (ICSIP), pp. 609\u2013613 (2023)","DOI":"10.1109\/ICSIP57908.2023.10270826"},{"key":"2_CR21","doi-asserted-by":"publisher","first-page":"565","DOI":"10.1007\/978-3-031-40003-2_21","volume-title":"PQCrypto","author":"L Chen","year":"2023","unstructured":"Chen, L., Dong, C., El Kassem, N., Newton, C.J., Wang, Y.: Hash-based direct anonymous attestation. In: Johansson, T., Smith-Tone, D. (eds.) PQCrypto. LNCS, vol. 14154, pp. 565\u2013600. Springer, Heidelberg (2023). https:\/\/doi.org\/10.1007\/978-3-031-40003-2_21"},{"key":"2_CR22","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3613960","volume":"27","author":"L Chen","year":"2023","unstructured":"Chen, L., Dong, C., Newton, C.J., Wang, Y.: Sphinx-in-the-head: group signatures from symmetric primitives. ACM Trans. Priv. Secur. 27, 1\u201335 (2023)","journal-title":"ACM Trans. Priv. Secur."},{"key":"2_CR23","doi-asserted-by":"crossref","unstructured":"Chen, L., El\u00a0Kassem, N., Lehmann, A., Lyubashevsky, V.: A framework for efficient lattice-based DAA. In: Proceedings of the 1st ACM Workshop on Workshop on Cyber-Security Arms Race, pp. 23\u201334 (2019)","DOI":"10.1145\/3338511.3357349"},{"key":"2_CR24","unstructured":"Chen, M.S., et al: Preon: zk-SNARK based signature scheme. NIST PQ Signatures submissions (2023). https:\/\/csrc.nist.gov\/csrc\/media\/Projects\/pqc-dig-sig\/documents\/round-1\/spec-files\/Preon-spec-web.pdf"},{"key":"2_CR25","doi-asserted-by":"crossref","unstructured":"Dall, F., et al.: Cachequote: efficiently recovering long-term secrets of SGX EPID via cache attacks. ICAR Trans. Cryptogr. Hardw. Embed. Syst. 171\u2013191 (2018)","DOI":"10.46586\/tches.v2018.i2.171-191"},{"key":"2_CR26","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":"2_CR27","unstructured":"El\u00a0Kassem, N.: Lattice-based direct anonymous attestation. Ph.D. thesis, University of Surrey (2020)"},{"key":"2_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1007\/978-3-030-41702-4_2","volume-title":"Information Security Theory and Practice","author":"N EL Kassem","year":"2020","unstructured":"EL Kassem, N., Fiolhais, L., Martins, P., Chen, L., Sousa, L.: A lattice-based enhanced privacy ID. In: Laurent, M., Giannetsos, T. (eds.) WISTP 2019. LNCS, vol. 12024, pp. 15\u201331. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-41702-4_2"},{"key":"2_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"562","DOI":"10.1007\/978-3-030-95312-6_23","volume-title":"Topics in Cryptology \u2013 CT-RSA 2022","author":"A Faonio","year":"2022","unstructured":"Faonio, A., Fiore, D., Nizzardo, L., Soriente, C.: Subversion-resilient enhanced privacy ID. In: Galbraith, S.D. (ed.) CT-RSA 2022. LNCS, vol. 13161, pp. 562\u2013588. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-030-95312-6_23"},{"key":"2_CR30","unstructured":"Free Software Foundation, Inc.: GCC, the GNU Compiler Collection (2022). https:\/\/ggcc.gnu.org"},{"key":"2_CR31","doi-asserted-by":"crossref","unstructured":"Fu, S., Gang, G.: Polaris: transparent succinct zero-knowledge arguments for R1CS with efficient verifier. In: Proceedings on Privacy Enhancing Technologies, pp. 544\u2013564 (2022)","DOI":"10.2478\/popets-2022-0027"},{"key":"2_CR32","unstructured":"Giacomelli, I., Madsen, J., Orlandi, C.: Zkboo: faster zero-knowledge for boolean circuits. In: USENIX Security, pp. 1069\u20131083 (2016)"},{"key":"2_CR33","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":"2_CR34","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, Geneva, CH (2010). https:\/\/www.iso.org\/standard\/44737.html"},{"key":"2_CR35","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, Geneva, CH (2013). https:\/\/www.iso.org\/standard\/56916.html"},{"key":"2_CR36","unstructured":"Kales, D., Zaverucha, G.: Efficient lifting for shorter zero-knowledge proofs and post-quantum signatures. Cryptology ePrint Archive, Paper 2022\/588 (2022). https:\/\/eprint.iacr.org\/2022\/588"},{"key":"2_CR37","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":"2_CR38","doi-asserted-by":"crossref","unstructured":"Kim, S., et\u00a0al.: AIM: symmetric primitive for shorter signatures with stronger security. In: ACM CCS, pp. 401\u2013415 (2023)","DOI":"10.1145\/3576915.3616579"},{"key":"2_CR39","unstructured":"Lamport, L.: Constructing digital signatures from a one-way function. SRI International Computer Science Laboratory, Technical Report (1979)"},{"key":"2_CR40","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1007\/978-3-031-15979-4_3","volume-title":"CRYPTO","author":"V Lyubashevsky","year":"2022","unstructured":"Lyubashevsky, V., Nguyen, N.K., Plan\u00e7on, M.: Lattice-based zero-knowledge proofs and applications: shorter, simpler, and more general. In: Dodis, Y., Shrimpton, T. (eds.) CRYPTO. LNCS, vol. 13508, pp. 71\u2013101. Springer, Heidelberg (2022). https:\/\/doi.org\/10.1007\/978-3-031-15979-4_3"},{"key":"2_CR41","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":"2_CR42","unstructured":"NIST: Post-quantum cryptography standardization (2017\u20132022). https:\/\/csrc.nist.gov\/projects\/post-quantum-cryptography\/post-quantum-cryptography-standardization"},{"key":"2_CR43","unstructured":"NIST: Nist announces first four quantum-resistant cryptographic algorithms (2022). https:\/\/nist.gov\/news-events\/news\/2022\/07\/nist-announces-first-four-quantum-resistant-cryptographic-algorithms"},{"key":"2_CR44","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":"2_CR45","doi-asserted-by":"crossref","unstructured":"de\u00a0Saint\u00a0Guilhem, C.D., Orsini, E., Tanguy, T.: Limbo: efficient zero-knowledge MPCitH-based arguments. In: ACM CCS, pp. 3022\u20133036 (2021)","DOI":"10.1145\/3460120.3484595"},{"key":"2_CR46","doi-asserted-by":"crossref","unstructured":"Sardar, M.U., Fetzer, C., et\u00a0al.: Towards formalization of enhanced privacy ID (EPID)-based remote attestation in Intel SGX. In: Euromicro Conference on Digital System Design (DSD), pp. 604\u2013607 (2020)","DOI":"10.1109\/DSD51259.2020.00099"},{"key":"2_CR47","unstructured":"TCG: TPM 2.0 library specification. https:\/\/trustedcomputinggroup.org\/resource\/tpm-library-specification\/"},{"key":"2_CR48","unstructured":"Zaverucha, R., Kales, G.: Reference implementation of the Picnic post-quantum signature scheme (2020). https:\/\/github.com\/Microsoft\/Picnic"},{"key":"2_CR49","unstructured":"Zaverucha, G.: The Picnic signature algorithm specification (2020). Supporting Documentation in 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-62743-9_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,11,21]],"date-time":"2024-11-21T14:53:49Z","timestamp":1732200829000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-62743-9_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031627422","9783031627439"],"references-count":49,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-62743-9_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"11 June 2024","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":"Oxford","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"United Kingdom","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12 June 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 June 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"pqcrypto2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.maths.ox.ac.uk\/events\/conferences\/pqcrypto-2024","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}