Unique ring signatures are an important variant of ring signatures that combine anonymity with signer distinguishability by enabling verifiers to determine whether the same signer generated signatures on the same message under the same ring without revealing the signer’s identity. Such schemes have significant applications in blockchain systems, cryptocurrencies, e-voting, e-tokens, anonymous authentication, spam prevention in online forums, and Internet of Things (IoT) environments. Most existing unique ring signature schemes are based on number-theoretic assumptions and are vulnerable to quantum attacks. Lattice-based cryptography has emerged as a promising alternative for constructing post-quantum secure unique ring signature schemes. Since lattice-based unique ring signatures involve computationally intensive algebraic operations and complex zero-knowledge proof systems, achieving practical efficiency remains a significant challenge. High-performance implementations and parallel processing techniques are therefore important for improving scalability and enabling real-time deployment. In this paper, we propose an efficient lattice-based unique ring signature scheme using optimized zero-knowledge proof techniques. We further provide detailed security and efficiency analyses, including a comparison with the existing state-of-the-art scheme. The comparative results demonstrate that the proposed scheme achieves a more compact signature size and improved computational efficiency than the state-of-the-art URS scheme (ESORICS 2022), while maintaining strong security guarantees. The reduced communication overhead and optimized performance make the proposed scheme more suitable for scalable real-time distributed applications.