Verifiable and Efficient Multi-secret Sharing Threshold Scheme
一种可验证和高效的多秘密共享门限方案

In most of the multi-secret sharing schemes already published, RSA, ECC or other public key cryptosystems are used to improve security. But such schemes would take up lots of resources and result in low speed. We proposed a new multi secret sharing(t, n) threshold scheme based on shamir secret sharing scheme, using the Lagrange interpolating polynomial to split and reconstruct the secrets and the NTRU and oncway hashing function to verify the validity of data. The scheme is simple in design and requires limited calculation and limited storage space. It can detect effectively a variety of cheating or forgery behaviors and guarantee that the reconstruction of the secret is the secure and trustworthy.