Abstract: The problem of how to design secure and efficient general verifiable secret sharing protocol is discussed. Based on the difficulty of computing discrete logarithm over finite field of large prime order and the method of Lagrange interpolation, an unconditional secure general verifiable secret sharing protocol applicable to arbitrary access structures is presented. Compared with the protocols of the same sort, it has a higher information rate and the amount of secret information to be stored by the participants is greatly decreased. With respect to computational complexity, the newly proposed protocol just has a small increase compared with the efficient threshold verifiable secret sharing schemes available. Due to its properties of security, efficiency and algebraic structure, the proposed protocol will find wide applications in distributed key escrow, distributed fault tolerant computation, group oriented cryptography, and electronic commerce.