一种可验证和高效的多秘密共享门限方案

Verifiable and Efficient Multi-secret Sharing Threshold Scheme

已公开的门限多秘密共享方案大都是利用RSA,ECC等公钥体制来提高安全性,其占用的资源较多,速度慢。提出了一种新的多秘密共享(t,n)门限方案,该方案是在shamir秘密共享方案的基础上,利用拉格朗日插值多项式方法进行秘密分割和重构,利用NTUR算法和单向散列函数进行数据合法性验证。方案设计简单、计算量小、存储量少,能有效检测出各种欺骗、伪造行为,以确保恢复的秘密是安全和可信的。

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 one-way 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.