This paper proposes a short lattice-based signature scheme in the standard model. The proposed scheme is designed without using the lattice-based delegation tools whose the verification key size and the signature length are both short. To achieve the provable security and shorten the verification key and the signature length, given a message with bit length l, we firstly encode the message into an m-dimensional vector with the help of l + 1m-dimensional public vectors, and then we use the Gaussian sample algorithm to sign the encoded result on the same lattice by the trapdoor basis. Hence, all the messages are signed on the same lattice in this paper. Moreover, the verification key of the proposed scheme only consists of one shared matrix and l + 1 public vectors. Simultaneously, the signature length of the proposed scheme is the same as that of the signature scheme in the random oracle model. Under the hardness of the shortest integer solution problem, the presented scheme is provable strong unforgeable under adaptive chosen-message attack in the standard model. Copyright © 2016 John Wiley & Sons, Ltd.