{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,24]],"date-time":"2026-01-24T20:26:01Z","timestamp":1769286361190,"version":"3.49.0"},"reference-count":21,"publisher":"MDPI AG","issue":"1","license":[{"start":{"date-parts":[[2026,1,22]],"date-time":"2026-01-22T00:00:00Z","timestamp":1769040000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"name":"Hubei Minzu University","award":["RZ1900000906"],"award-info":[{"award-number":["RZ1900000906"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Entropy"],"abstract":"<jats:p>Linkable ring signatures are a type of ring signature scheme that can protect the anonymity of signers while allowing the public to verify whether the same signer has signed the same message multiple times. This functionality makes linkable ring signatures suitable for applications such as cryptocurrencies and anonymous voting systems, achieving the dual goals of identity privacy protection and misuse prevention. However, existing post-quantum linkable ring signature schemes often suffer from issues such as excessive linear data growth the adoption of post-quantum signature algorithms, and high circuit complexity resulting from the use of post-quantum zero-knowledge proof protocols. To address these issues, a logarithmic-size post-quantum linkable ring signature scheme based on aggregation operations is proposed. The scheme constructs a Merkle tree from ring members\u2019 public keys via a hash algorithm to achieve logarithmic-scale signing and verification operations. Moreover, it introduces, for the first time, a post-quantum aggregate signature scheme to replace post-quantum zero-knowledge proof protocols, thereby effectively avoiding the construction of complex circuits. Scheme analysis confirms that the proposed scheme meets the correctness requirements of linkable ring signatures. In terms of security, the scheme satisfies the anonymity, unforgeability, and linkability requirements of linkable ring signatures. Moreover, the aggregation process does not leak information about the signing members, ensuring strong privacy protection. Experimental results demonstrate that, when the ring size scales to 1024 members, our scheme outperforms the existing Dilithium-based logarithmic post-quantum ring signature scheme, with nearly 98.25% lower signing time, 98.90% lower verification time, and 99.81% smaller signature size.<\/jats:p>","DOI":"10.3390\/e28010130","type":"journal-article","created":{"date-parts":[[2026,1,23]],"date-time":"2026-01-23T10:41:34Z","timestamp":1769164894000},"page":"130","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Logarithmic-Size Post-Quantum Linkable Ring Signatures Based on Aggregation Operations"],"prefix":"10.3390","volume":"28","author":[{"given":"Minghui","family":"Zheng","sequence":"first","affiliation":[{"name":"School of Intelligent Science and Engineering, Hubei Minzu University, 39 Xueyuan Road, Enshi 445000, China"},{"name":"School of Cyberspace Security, Sichuan University, Chengdu 610065, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0009-9674-0380","authenticated-orcid":false,"given":"Shicheng","family":"Huang","sequence":"additional","affiliation":[{"name":"School of Intelligent Science and Engineering, Hubei Minzu University, 39 Xueyuan Road, Enshi 445000, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Deju","family":"Kong","sequence":"additional","affiliation":[{"name":"School of Intelligent Science and Engineering, Hubei Minzu University, 39 Xueyuan Road, Enshi 445000, China"},{"name":"School of Cyberspace Security, Sichuan University, Chengdu 610065, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xing","family":"Fu","sequence":"additional","affiliation":[{"name":"School of Intelligent Science and Engineering, Hubei Minzu University, 39 Xueyuan Road, Enshi 445000, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Qiancheng","family":"Yao","sequence":"additional","affiliation":[{"name":"School of Intelligent Science and Engineering, Hubei Minzu University, 39 Xueyuan Road, Enshi 445000, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wenyi","family":"Hou","sequence":"additional","affiliation":[{"name":"School of Intelligent Science and Engineering, Hubei Minzu University, 39 Xueyuan Road, Enshi 445000, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"1968","published-online":{"date-parts":[[2026,1,22]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","unstructured":"Rivest, R.L., Shamir, A., and Tauman, Y. (2001, January 9\u201313). How to Leak a Secret. Proceedings of the Advances in Cryptology\u2014ASIACRYPT, Gold Coast, Australia.","DOI":"10.1007\/3-540-45682-1_32"},{"key":"ref_2","unstructured":"Chaum, D., and Van Heyst, E. (1991, January 8\u201311). Group Signatures. Proceedings of the Workshop on the Theory and Application of Cryptographic Techniques, Brighton, UK."},{"key":"ref_3","doi-asserted-by":"crossref","unstructured":"Liu, J.K., Wei, V.K., and Wong, D.S. (2004, January 13\u201315). Linkable Spontaneous Anonymous Group Signature for Ad Hoc Groups. Proceedings of the Information Security and Privacy\u2014ACISP 2004, Sydney, Australia.","DOI":"10.1007\/978-3-540-27800-9_28"},{"key":"ref_4","unstructured":"Jivanyan, A. (2019). Lelantus: A new design for anonymous and confidential cryptocurrencies. Cryptology. Eprint Arch., 373. Available online: https:\/\/eprint.iacr.org\/2019\/373."},{"key":"ref_5","doi-asserted-by":"crossref","unstructured":"Noether, S., and Goodell, B. (2020, January 17\u201318). Triptych: Logarithmic-Sized Linkable Ring Sign Signatures with Applications. Proceedings of the International Workshop on Data Privacy Management, Guildford, UK.","DOI":"10.1007\/978-3-030-66172-4_22"},{"key":"ref_6","unstructured":"Xie, Z.J., Zhang, Y., and Yang, Q.C. (2025). Ring Signature Scheme Based on SM9 Algorithm. Comput. Sci., 1\u20139. Available online: https:\/\/link.cnki.net\/urlid\/50.1075.tp.20250226.1734.008."},{"key":"ref_7","doi-asserted-by":"crossref","first-page":"250505","DOI":"10.1103\/PhysRevLett.99.250505","article-title":"Experimental Demonstration of a Compiled Version of Shor\u2019s Algorithm with Quantum Entanglement","volume":"99","author":"Lanyon","year":"2007","journal-title":"Phys. Rev. Lett."},{"key":"ref_8","doi-asserted-by":"crossref","first-page":"022307","DOI":"10.1103\/PhysRevA.64.022307","article-title":"Grover Algorithm with Zero Theoretical Failure Rate","volume":"64","author":"Long","year":"2001","journal-title":"Phys. Rev."},{"key":"ref_9","first-page":"567","article-title":"A lattice-based ring signature scheme with gradual revelation of non-signers","volume":"17","author":"Kumar","year":"2025","journal-title":"Int. J. Inf. Technol."},{"key":"ref_10","doi-asserted-by":"crossref","unstructured":"Kumar, R., and Padhye, S. (2025). A Quantum Secure Convertible Ring Signature Scheme Over SIS Problem. Int. J. Found. Computer. Sci.","DOI":"10.1142\/S0129054125500315"},{"key":"ref_11","doi-asserted-by":"crossref","first-page":"33","DOI":"10.56557\/ajomcor\/2024\/v31i48966","article-title":"Enhanced Security in Post-Quantum Cryptography: A Comprehensive Lattice-Based Signature Scheme Using Matrix Groups","volume":"31","author":"Musa","year":"2024","journal-title":"Asian J. Math. Comput. Res."},{"key":"ref_12","doi-asserted-by":"crossref","first-page":"739","DOI":"10.1109\/TVT.2023.3305037","article-title":"LaRRS: Lattice-based revocable ring signature and its application for VANETs","volume":"73","author":"Wen","year":"2023","journal-title":"IEEE Trans. Veh. Technol."},{"key":"ref_13","doi-asserted-by":"crossref","unstructured":"Gao, Y., Chen, X., and Shang, W. (2024, January 1\u20133). A lattice-based linkable ring signature scheme for blockchain privacy protection. Proceedings of the 2024 IEEE\/ACIS 27th International Conference on Software Engineering, Artificial Intelligence, Networking and Parallel\/Distributed Computing (SNPD), Xi\u2019an, China.","DOI":"10.1109\/SNPD61259.2024.10673921"},{"key":"ref_14","doi-asserted-by":"crossref","first-page":"84739","DOI":"10.1109\/ACCESS.2021.3087808","article-title":"Identity-Based Linkable Ring Signatures From Lattices","volume":"9","author":"Le","year":"2021","journal-title":"IEEE Access"},{"key":"ref_15","doi-asserted-by":"crossref","first-page":"110885","DOI":"10.1016\/j.comnet.2024.110885","article-title":"NTRU-CLS: Efficient quantum-resistant NTRU lattice-based certificateless signature scheme for VANETs","volume":"256","author":"Xiong","year":"2025","journal-title":"Comput. Netw."},{"key":"ref_16","first-page":"20","article-title":"A Traceable Ring Signature Scheme Based on Dilithium","volume":"44","author":"Liu","year":"2025","journal-title":"Netw. Secur. Data Gov."},{"key":"ref_17","doi-asserted-by":"crossref","first-page":"238","DOI":"10.46586\/tches.v2018.i1.238-268","article-title":"CRYSTALS-Dilithium: A lattice-based digital signature scheme","volume":"2018","author":"Ducas","year":"2018","journal-title":"Iacr Trans. Cryptogr. Hardw. Embed. Syst."},{"key":"ref_18","doi-asserted-by":"crossref","unstructured":"Xue, Y., Lu, X., and Au, M.H. (2024, January 16\u201320). Efficient linkable ring signatures: New framework and post-quantum instantiations. Proceedings of the European Symposium on Research in Computer Security, The Hague, The Netherlands.","DOI":"10.1007\/978-3-031-70903-6_22"},{"key":"ref_19","first-page":"402","article-title":"Lattice-based linkable threshold ring signature for electronic voting protocol","volume":"8","author":"Zhuang","year":"2021","journal-title":"J. Cryptologic Res."},{"key":"ref_20","doi-asserted-by":"crossref","unstructured":"Huiwen, J., Chunming, T., and Yanhua, Z. (2021). Lattice-Based Logarithmic-Size Non-Interactive Deniable Ring Signatures. Entropy, 23.","DOI":"10.3390\/e23080980"},{"key":"ref_21","first-page":"396","article-title":"Identity-based linkable ring signcryption on NTRU lattice","volume":"52","author":"Tang","year":"2025","journal-title":"Comput. Sci."}],"container-title":["Entropy"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/1099-4300\/28\/1\/130\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,1,23]],"date-time":"2026-01-23T10:44:54Z","timestamp":1769165094000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/1099-4300\/28\/1\/130"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,1,22]]},"references-count":21,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2026,1]]}},"alternative-id":["e28010130"],"URL":"https:\/\/doi.org\/10.3390\/e28010130","relation":{},"ISSN":["1099-4300"],"issn-type":[{"value":"1099-4300","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,1,22]]}}}