{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,23]],"date-time":"2025-09-23T14:23:37Z","timestamp":1758637417994,"version":"3.44.0"},"reference-count":44,"publisher":"Springer Science and Business Media LLC","issue":"15","license":[{"start":{"date-parts":[[2025,9,23]],"date-time":"2025-09-23T00:00:00Z","timestamp":1758585600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,9,23]],"date-time":"2025-09-23T00:00:00Z","timestamp":1758585600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100001809","name":"the National Natural Science Foundation of China","doi-asserted-by":"crossref","award":["U23B2002","U23B2002"],"award-info":[{"award-number":["U23B2002","U23B2002"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Supercomput"],"DOI":"10.1007\/s11227-025-07872-w","type":"journal-article","created":{"date-parts":[[2025,9,23]],"date-time":"2025-09-23T13:00:14Z","timestamp":1758632414000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Post-quantum anonymous authentication for Web3: a lattice-based decentralized linkable anonymous credential scheme"],"prefix":"10.1007","volume":"81","author":[{"given":"Tianyu","family":"Zhaolu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Huaqun","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,9,23]]},"reference":[{"issue":"10","key":"7872_CR1","doi-asserted-by":"publisher","first-page":"1030","DOI":"10.1145\/4372.4373","volume":"28","author":"D Chaum","year":"1985","unstructured":"Chaum D (1985) Security without identification: transaction systems to make big brother obsolete. Commun ACM 28(10):1030\u20131044. https:\/\/doi.org\/10.1145\/4372.4373","journal-title":"Commun ACM"},{"key":"7872_CR2","doi-asserted-by":"publisher","unstructured":"Mir O, Bauer B, Griffy S, Lysyanskaya A, Slamanig D (2023) Aggregate signatures with versatile randomization and issuer-hiding multi-authority anonymous credentials. In: Proceedings of the 2023 ACM SIGSAC Conference on Computer and Communications Security, pp. 30\u201344. Association for Computing Machinery, New York, NY, USA. https:\/\/doi.org\/10.1145\/3576915.3623203","DOI":"10.1145\/3576915.3623203"},{"key":"7872_CR3","doi-asserted-by":"crossref","unstructured":"Sonnino A, Al-Bassam M, Bano S, Meiklejohn S, Danezis G (2019) Coconut: Threshold issuance selective disclosure credentials with applications to distributed ledgers. In: 26th Annual Network and Distributed System Security Symposium, NDSS 2019, San Diego, California, USA. https:\/\/www.ndss-symposium.org\/ndss-paper\/coconut-threshold-issuance-selective-disclosure-credentials-with-applications-to-distributed-ledgers\/","DOI":"10.14722\/ndss.2019.23272"},{"key":"7872_CR4","unstructured":"Jeudy C, Roux-Langlois A, Sanders O (2022) Lattice signature with efficient protocols, application to anonymous credentials. Cryptology ePrint Archive, Paper 2022\/509. https:\/\/eprint.iacr.org\/2022\/509"},{"key":"7872_CR5","doi-asserted-by":"publisher","unstructured":"Bootle J, Lyubashevsky V, Nguyen NK, Sorniotti A (2023) A framework for practical anonymous credentials from lattices. In: Advances in Cryptology \u2013 CRYPTO 2023, pp. 384\u2013417. Springer, Cham. https:\/\/doi.org\/10.1007\/978-3-031-38545-2_13","DOI":"10.1007\/978-3-031-38545-2_13"},{"key":"7872_CR6","unstructured":"Lai Q, Chen C, Liu F-H, Lysyanskaya A, Wang Z (2023) Lattice-based Commit-Transferrable Signatures and Applications to Anonymous Credentials. Cryptology ePrint Archive, Paper 2023\/766. https:\/\/eprint.iacr.org\/2023\/766"},{"key":"7872_CR7","doi-asserted-by":"crossref","unstructured":"Garman C, Green M, Miers I (2014) Decentralized anonymous credentials. In: 21st Annual Network and Distributed System Security Symposium, NDSS 2014, San Diego, California, USA. https:\/\/www.ndss-symposium.org\/ndss2014\/decentralized-anonymous-credentials","DOI":"10.14722\/ndss.2014.23253"},{"key":"7872_CR8","doi-asserted-by":"publisher","first-page":"353","DOI":"10.1016\/J.COSE.2019.05.009","volume":"85","author":"R Yang","year":"2019","unstructured":"Yang R, Au MH, Xu Q, Yu Z (2019) Decentralized blacklistable anonymous credentials with reputation. Comput Secur 85:353\u2013371. https:\/\/doi.org\/10.1016\/J.COSE.2019.05.009","journal-title":"Comput Secur"},{"key":"7872_CR9","doi-asserted-by":"publisher","unstructured":"Doerner J, Kondi Y, Lee E, Shelat A, Tyner L (2023) Threshold BBS+ signatures for distributed anonymous credential issuance. In: 44th IEEE Symposium on Security and Privacy, SP 2023, San Francisco, CA, USA, pp. 773\u2013789. IEEE, Piscataway, NJ. https:\/\/doi.org\/10.1109\/SP46215.2023.10179470","DOI":"10.1109\/SP46215.2023.10179470"},{"key":"7872_CR10","doi-asserted-by":"publisher","unstructured":"Tessaro S, Zhu C (2023) Revisiting BBS signatures. In: EUROCRYPT 2023, Lyon, France, pp. 691\u2013721. Springer, Cham. https:\/\/doi.org\/10.1007\/978-3-031-30589-4_24","DOI":"10.1007\/978-3-031-30589-4_24"},{"issue":"5","key":"7872_CR11","doi-asserted-by":"publisher","first-page":"3751","DOI":"10.1109\/TSC.2023.3280914","volume":"16","author":"R Shi","year":"2023","unstructured":"Shi R, Feng H, Yang Y, Yuan F, Li Y, Pang H, Deng RH (2023) Threshold attribute-based credentials with redactable signature. IEEE Trans Serv Comput 16(5):3751\u20133765. https:\/\/doi.org\/10.1109\/TSC.2023.3280914","journal-title":"IEEE Trans Serv Comput"},{"key":"7872_CR12","doi-asserted-by":"publisher","unstructured":"Bisht K, Kansagra NY, Ali R, Shaik MS, Francis M, Kataoka K (2024) Revocable taco: Revocable threshold based anonymous credentials over blockchains. In: Proceedings of the 19th ACM Asia Conference on Computer and Communications Security, pp. 1378\u20131393. Association for Computing Machinery, New York, NY, USA. https:\/\/doi.org\/10.1145\/3634737.3637656","DOI":"10.1145\/3634737.3637656"},{"key":"7872_CR13","doi-asserted-by":"publisher","first-page":"7744","DOI":"10.1109\/TIFS.2024.3443622","volume":"19","author":"C Li","year":"2024","unstructured":"Li C, Ning J, Xu S, Lin C, Li J, Shen J (2024) Dtacb: dynamic threshold anonymous credentials with batch-showing. IEEE Trans Inf Forensics Secur 19:7744\u20137758. https:\/\/doi.org\/10.1109\/TIFS.2024.3443622","journal-title":"IEEE Trans Inf Forensics Secur"},{"key":"7872_CR14","doi-asserted-by":"publisher","unstructured":"Pointcheval D, Sanders O (2016) Short randomizable signatures. In: CT-RSA 2016, San Francisco, CA, pp. 111\u2013126. Springer, Cham. https:\/\/doi.org\/10.1007\/978-3-319-29485-8_7","DOI":"10.1007\/978-3-319-29485-8_7"},{"key":"7872_CR15","doi-asserted-by":"publisher","unstructured":"Maji HK, Prabhakaran M, Rosulek M (2011) Attribute-based signatures. In: CT-RSA 2011, San Francisco, CA, pp. 376\u2013392. Springer, Cham. https:\/\/doi.org\/10.1007\/978-3-642-19074-2_24","DOI":"10.1007\/978-3-642-19074-2_24"},{"key":"7872_CR16","doi-asserted-by":"publisher","unstructured":"Okamoto T, Takashima K (2011) Efficient attribute-based signatures for non-monotone predicates in the standard model. In: PKC 2011, Taormina, Italy, pp. 35\u201352. Springer, Berlin, Heidelberg. https:\/\/doi.org\/10.1007\/978-3-642-19379-8_3","DOI":"10.1007\/978-3-642-19379-8_3"},{"key":"7872_CR17","doi-asserted-by":"publisher","unstructured":"Okamoto T, Takashima K (2013) Decentralized attribute-based signatures. In: PKC 2013, Nara, Japan, pp. 125\u2013142. Springer, Berlin, Heidelberg. https:\/\/doi.org\/10.1007\/978-3-642-36362-7_9","DOI":"10.1007\/978-3-642-36362-7_9"},{"key":"7872_CR18","doi-asserted-by":"publisher","unstructured":"El Kaafarani A, Ghadafi E, Khader D (2014) Decentralized traceable attribute-based signatures. In: CT-RSA 2014, San Francisco, CA, pp. 327\u2013348. Springer, Cham. https:\/\/doi.org\/10.1007\/978-3-319-04852-9_17","DOI":"10.1007\/978-3-319-04852-9_17"},{"key":"7872_CR19","doi-asserted-by":"publisher","unstructured":"Ghadafi E (2015) Stronger security notions for decentralized traceable attribute-based signatures and more efficient constructions. In: CT-RSA 2015, San Francisco, CA, pp. 391\u2013409. Springer, Cham. https:\/\/doi.org\/10.1007\/978-3-319-16715-2_21","DOI":"10.1007\/978-3-319-16715-2_21"},{"issue":"3","key":"7872_CR20","doi-asserted-by":"publisher","first-page":"1195","DOI":"10.1109\/TCC.2019.2902380","volume":"9","author":"J Sun","year":"2021","unstructured":"Sun J, Su Y, Qin J, Hu J, Ma J (2021) Outsourced decentralized multi-authority attribute based signature and its application in iot. IEEE Trans Cloud Comput 9(3):1195\u20131209. https:\/\/doi.org\/10.1109\/TCC.2019.2902380","journal-title":"IEEE Trans Cloud Comput"},{"issue":"6","key":"7872_CR21","doi-asserted-by":"publisher","first-page":"4573","DOI":"10.1109\/JIOT.2021.3104585","volume":"9","author":"J Li","year":"2022","unstructured":"Li J, Chen Y, Han J, Liu C, Zhang Y, Wang H (2022) Decentralized attribute-based server-aid signature in the internet of things. IEEE Internet Things J 9(6):4573\u20134583. https:\/\/doi.org\/10.1109\/JIOT.2021.3104585","journal-title":"IEEE Internet Things J"},{"key":"7872_CR22","doi-asserted-by":"publisher","unstructured":"Wang Q, Chen S, Ge A (2015) A new lattice-based threshold attribute-based signature scheme. In: ISPEC 2015, Beijing, China, pp. 406\u2013420. Springer, Cham. https:\/\/doi.org\/10.1007\/978-3-319-17533-1_28","DOI":"10.1007\/978-3-319-17533-1_28"},{"key":"7872_CR23","doi-asserted-by":"publisher","unstructured":"Zhang Y, Liu X, Hu Y, Zhang Q, Jia H (2019) Attribute-based signatures for inner-product predicate from lattices. In: CSS 2019, Guangzhou, China, pp. 173\u2013185. Springer, Cham. https:\/\/doi.org\/10.1007\/978-3-030-37337-5_14","DOI":"10.1007\/978-3-030-37337-5_14"},{"key":"7872_CR24","doi-asserted-by":"publisher","unstructured":"El Kaafarani A, Katsumata S (2018) Attribute-based signatures for unbounded circuits in the ROM and efficient instantiations from lattices. In: PKC 2018, Rio de Janeiro, Brazil, pp. 89\u2013119. Springer, Berlin, Heidelberg. https:\/\/doi.org\/10.1007\/978-3-319-76581-5_4","DOI":"10.1007\/978-3-319-76581-5_4"},{"key":"7872_CR25","doi-asserted-by":"publisher","unstructured":"Gardham D, Manulis M (2022) Revocable hierarchical attribute-based signatures from lattices. In: ACNS 2022, Rome, Italy, pp. 459\u2013479. Springer, Cham. https:\/\/doi.org\/10.1007\/978-3-031-09234-3_23","DOI":"10.1007\/978-3-031-09234-3_23"},{"key":"7872_CR26","unstructured":"Bansarkhani RE, Kaafarani AE (2016) Post-Quantum Attribute-Based Signatures from Lattice Assumptions. Cryptology ePrint Archive, Paper 2016\/823. https:\/\/eprint.iacr.org\/2016\/823"},{"key":"7872_CR27","doi-asserted-by":"publisher","unstructured":"Ben-Sasson E, Chiesa A, Riabzev M, Spooner N, Virza M, Ward NP (2019) Aurora: transparent succinct arguments for R1CS. In: EUROCRYPT 2019, pp. 103\u2013128. Springer, Berlin, Heidelberg. https:\/\/doi.org\/10.1007\/978-3-030-17653-2_4","DOI":"10.1007\/978-3-030-17653-2_4"},{"key":"7872_CR28","doi-asserted-by":"publisher","unstructured":"Golovnev A, Lee J, Setty STV, Thaler J, Wahby RS (2023) Brakedown: linear-time and field-agnostic snarks for R1CS. In: CRYPTO 2023, pp. 193\u2013226. Springer, Berlin, Heidelberg. https:\/\/doi.org\/10.1007\/978-3-031-38545-2_7","DOI":"10.1007\/978-3-031-38545-2_7"},{"key":"7872_CR29","doi-asserted-by":"publisher","unstructured":"Xie T, Zhang Y, Song D (2022) Orion: Zero knowledge proof with linear prover time. In: CRYPTO 2022, pp. 299\u2013328. Springer, Berlin, Heidelberg. https:\/\/doi.org\/10.1007\/978-3-031-15985-5_11","DOI":"10.1007\/978-3-031-15985-5_11"},{"key":"7872_CR30","doi-asserted-by":"publisher","unstructured":"Albrecht MR, Cini V, Lai RWF, Malavolta G, Thyagarajan SAK (2022) Lattice-based snarks: Publicly verifiable, preprocessing, and recursively composable - (extended abstract). In: CRYPTO 2022, pp. 102\u2013132. Springer, Berlin, Heidelberg. https:\/\/doi.org\/10.1007\/978-3-031-15979-4_4","DOI":"10.1007\/978-3-031-15979-4_4"},{"key":"7872_CR31","doi-asserted-by":"publisher","unstructured":"Beullens W, Seiler G (2023) Labrador: compact proofs for R1CS from module-sis. In: CRYPTO 2023, pp. 518\u2013548. Springer, Berlin, Heidelberg. https:\/\/doi.org\/10.1007\/978-3-031-38554-4_17","DOI":"10.1007\/978-3-031-38554-4_17"},{"key":"7872_CR32","doi-asserted-by":"publisher","unstructured":"Kim D, Lee D, Seo J, Song Y (2023) Toward practical lattice-based proof of knowledge from hint-mlwe. In: CRYPTO 2023, pp. 549\u2013580. Springer, Berlin, Heidelberg. https:\/\/doi.org\/10.1007\/978-3-031-38554-4_18","DOI":"10.1007\/978-3-031-38554-4_18"},{"key":"7872_CR33","doi-asserted-by":"crossref","unstructured":"Lyubashevsky V, Nguyen NK, Plancon M (2022) Lattice-based zero-knowledge proofs and applications: shorter, simpler, and more general. Cryptology ePrint Archive, Paper 2022\/284. https:\/\/eprint.iacr.org\/2022\/284","DOI":"10.1007\/978-3-031-15979-4_3"},{"key":"7872_CR34","doi-asserted-by":"publisher","first-page":"625","DOI":"10.1007\/BF01445125","volume":"296","author":"W Banaszczyk","year":"1993","unstructured":"Banaszczyk W (1993) New bounds in some transference theorems in the geometry of numbers. Math Ann 296:625\u2013635. https:\/\/doi.org\/10.1007\/BF01445125","journal-title":"Math Ann"},{"key":"7872_CR35","doi-asserted-by":"publisher","unstructured":"Boudgoust K, Jeudy C, Roux-Langlois A, Wen W (2020) Towards classical hardness of module-lwe: The linear rank case. In: ASIACRYPT 2020, Daejeon, South Korea, pp. 289\u2013317. Springer, Cham. https:\/\/doi.org\/10.1007\/978-3-030-64834-3_10","DOI":"10.1007\/978-3-030-64834-3_10"},{"key":"7872_CR36","unstructured":"Micciancio D, Peikert C (2011) Trapdoors for lattices: simpler, tighter, faster, smaller. Cryptology ePrint Archive, Paper 2011\/501. https:\/\/eprint.iacr.org\/2011\/501"},{"key":"7872_CR37","doi-asserted-by":"publisher","unstructured":"Langlois A, Stehl\u00e9 D, Steinfeld R (2014) Gghlite: more efficient multilinear maps from ideal lattices. In: EUROCRYPT 2014, Copenhagen, Denmark, pp. 239\u2013256. Springer, Berlin, Heidelberg. https:\/\/doi.org\/10.1007\/978-3-642-55220-5_14","DOI":"10.1007\/978-3-642-55220-5_14"},{"issue":"3","key":"7872_CR38","doi-asserted-by":"publisher","first-page":"565","DOI":"10.1007\/S10623-014-9938-4","volume":"75","author":"A Langlois","year":"2015","unstructured":"Langlois A, Stehl\u00e9 D (2015) Worst-case to average-case reductions for module lattices. Des Codes Cryptogr 75(3):565\u2013599. https:\/\/doi.org\/10.1007\/S10623-014-9938-4","journal-title":"Des Codes Cryptogr"},{"key":"7872_CR39","doi-asserted-by":"publisher","unstructured":"Ajtai M (1996) Generating hard instances of lattice problems (extended abstract). In: Proceedings of the Twenty-Eighth Annual ACM Symposium on Theory of Computing. STOC \u201996, pp. 99\u2013108. Association for Computing Machinery, New York, NY, USA. https:\/\/doi.org\/10.1145\/237814.237838","DOI":"10.1145\/237814.237838"},{"key":"7872_CR40","doi-asserted-by":"publisher","unstructured":"Cramer R, Damg\u00e5rd I, Schoenmakers B (1994) Proofs of partial knowledge and simplified design of witness hiding protocols. In: CRYPTO 1994, pp. 174\u2013187. Springer, Berlin, Heidelberg. https:\/\/doi.org\/10.1007\/3-540-48658-5_19","DOI":"10.1007\/3-540-48658-5_19"},{"key":"7872_CR41","doi-asserted-by":"publisher","unstructured":"Chase M, Lysyanskaya A (2006) On signatures of knowledge. In: CRYPTO 2006, pp. 78\u201396. Springer, Berlin, Heidelberg. https:\/\/doi.org\/10.1007\/11818175_5","DOI":"10.1007\/11818175_5"},{"issue":"9","key":"7872_CR42","doi-asserted-by":"publisher","first-page":"9424","DOI":"10.1109\/TII.2022.3228688","volume":"19","author":"Q Su","year":"2023","unstructured":"Su Q, Zhang R, Xue R, Sun Y, Gao S (2023) Distributed attribute-based signature with attribute dynamic update for smart grid. IEEE Trans Ind Inform 19(9):9424\u20139435. https:\/\/doi.org\/10.1109\/TII.2022.3228688","journal-title":"IEEE Trans Ind Inform"},{"key":"7872_CR43","doi-asserted-by":"publisher","unstructured":"Sun Y, Zhang R, Wang X, Gao K, Liu L (2018) A decentralizing attribute-based signature for healthcare blockchain. In: 27th International Conference on Computer Communication and Networks, pp. 1\u20139. IEEE, Hangzhou, China. https:\/\/doi.org\/10.1109\/ICCCN.2018.8487349","DOI":"10.1109\/ICCCN.2018.8487349"},{"key":"7872_CR44","doi-asserted-by":"publisher","unstructured":"Gama N, Nguyen PQ (2008) Predicting lattice reduction. In: EUROCRYPT 2008, pp. 31\u201351. Springer, Berlin, Heidelberg. https:\/\/doi.org\/10.1007\/978-3-540-78967-3_3","DOI":"10.1007\/978-3-540-78967-3_3"}],"container-title":["The Journal of Supercomputing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-025-07872-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11227-025-07872-w\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-025-07872-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,23]],"date-time":"2025-09-23T13:00:24Z","timestamp":1758632424000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11227-025-07872-w"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,9,23]]},"references-count":44,"journal-issue":{"issue":"15","published-online":{"date-parts":[[2025,10]]}},"alternative-id":["7872"],"URL":"https:\/\/doi.org\/10.1007\/s11227-025-07872-w","relation":{},"ISSN":["1573-0484"],"issn-type":[{"value":"1573-0484","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,9,23]]},"assertion":[{"value":"17 April 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"13 September 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"23 September 2025","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors have no relevant financial or non-financial interests to disclose.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}},{"value":"Not applicable.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethical approval"}},{"value":"Not applicable.","order":4,"name":"Ethics","group":{"name":"EthicsHeading","label":"Consent to participate"}},{"value":"Not applicable.","order":5,"name":"Ethics","group":{"name":"EthicsHeading","label":"Consent for publication"}}],"article-number":"1375"}}