A Novel 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. In this paper we propose 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 NTRUand 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.
multi-secret sharing NTRU algorithm threshold scheme verifiable
Bu ShanYue Yang Rong Gen
School of Computer Engineering, Huaiyin Institute of Technology Huaian, China
国际会议
成都
英文
1286-1290
2010-12-17(万方平台首次上网日期,不代表论文的发表时间)