In 2000, a new type of multi-secret sharing scheme, called the multiple secret sharing scheme, is proposed by Chien et al., in which more than one secret instead of only one secret can be shared in the same sharing session. In 2004, Yang et al. proposed another implementation of the above scheme based on Shamir's secret sharing to reduce the complexity of computation. In 2005, Pang et al. also proposed a more efficient implementation of Yang’s scheme. However, all these schemes have no property of verification and cannot authenticate the entity of the participant and the message. Motivated by these concerns, a new verifiable (t, n) multiple secret sharing scheme is proposed, which is based on Pang et al’s scheme. And then, some analyses are made on the proposed scheme.