Novel and Effective Multi-Secret Sharing Scheme
A new multi-secret sharing (t, n) threshold scheme is proposed in this paper. The scheme uses the Lagrange interpolating polynomial to split and reconstruct the secrets based on Shamir secret sharing scheme, and verifies the legality of data by NTRU algorithm and one-way hashing function. Compared with other public key cryptosystems such as elliptic curve cryptography, the proposed is simpler in design, which requires less calculation and fewer storage spaces. It can detect effectively a variety of cheating and forgery behaviors, which guarantee that the reconstruction of secret is the secure and trustworthy.
KeywordsMulti-secret sharing NTRU algorithm Threshold scheme Verifiable
- 3.Heidarvand S, Villar JL (2008) Public verifiability from pairings in secret sharing schemes. SAC LNCS 53(1):294–308Google Scholar
- 4.Tartary C, Pieprzyk J, Wang H (2007) Verifiable multi-secret sharing schemes for multiple threshold access structures. Inscrypt LNCS 49(9):167–181Google Scholar
- 6.Bu YS, Kun Y, Wang RC (2009) A secret sharing scheme based on NTRU algorithm. J Chin Comput Syst 30(10):1986–1987Google Scholar
- 8.Qia S, Du WZ (2011) Multi-secret sharing scheme based on RSA and remainder theorem. Comput Eng 37(2):141–142Google Scholar