Advertisement

Novel and Effective Multi-Secret Sharing Scheme

Conference paper
Part of the Lecture Notes in Electrical Engineering book series (LNEE, volume 219)

Abstract

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.

Keywords

Multi-secret sharing NTRU algorithm Threshold scheme Verifiable 

References

  1. 1.
    Shamir A (1979) How to share a secret. Commun ACM 22(11):612–613CrossRefMATHMathSciNetGoogle Scholar
  2. 2.
    Harn L (1995) Efficient sharing (broadcasting) of multiple secrets. IEE Comput Digital Tech 142(3):237–240CrossRefGoogle Scholar
  3. 3.
    Heidarvand S, Villar JL (2008) Public verifiability from pairings in secret sharing schemes. SAC LNCS 53(1):294–308Google Scholar
  4. 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
  5. 5.
    Pang LJ, Pei QQ et al (2008) An identity (ID)-based threshold multi-secret sharing scheme. J Softw 19(10):2739–2745CrossRefMATHGoogle Scholar
  6. 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
  7. 7.
    Zhu JH, Cui GH et al (2008) Trusted verifiable multisecret sharing scheme based on (t, n) threshold. J Chin Comput Syst 29(4):635–638MathSciNetGoogle Scholar
  8. 8.
    Qia S, Du WZ (2011) Multi-secret sharing scheme based on RSA and remainder theorem. Comput Eng 37(2):141–142Google Scholar

Copyright information

© Springer-Verlag London 2013

Authors and Affiliations

  1. 1.Department of Computer EngineeringHuaiyin Institute of TechnologyHuaianChina

Personalised recommendations