Blind signatures serve as a crucial cryptographic primitive within privacy-preserving protocols. Historically, the majority of blind signature schemes necessitated a minimum of two interactions (i.e., a two-move) involving the user and the signer. However, there exist certain applications, such as Privacy Pass or lottery systems where there is no requirement for the messages signed by the signer to adhere to a specific distribution. While a few non-interactive blind signature schemes based on integer factoring or discrete logarithms have been proposed, the situation is considerably less satisfactory when it comes to post-quantum assumptions. In this paper, we present a lattice-based non-interactive blind signature (LB-NIBS) and a lattice-based tagged non-interactive blind signature (LB-TNIBS) and prove their security under the random oracle model, based on lattice hardness problems M-SIS/M-LWE. Our schemes rely on the GPV signature and non-interactive zero-knowledge proof and can be easily implemented on module-lattice.