This paper proposes an efficient lattice-based blind signature scheme built upon the BLISS framework. By incor porating bimodal Gaussian distributions and rejection sampling techniques, the scheme ensures secure output distributions and prevents information leakage during the signing process. It achieves blindness and one-more unforgeability with only two rounds of interaction, significantly improving efficiency compared to earlier multi-round lattice-based blind signature schemes. Performance analysis demonstrates that the scheme maintains relatively compact parameters, with a public key size of about 20KB, a private key size of 99KB, and a signature size of 120KB. These characteristics make it practical for post-quantum secure environments. Overall, the proposed scheme combines provable security, anonymity, and efficiency, and is well-suited for privacy preserving applications such as blockchain systems, electronic voting, and anonymous payments.