Skip to main content

Part of the book series: Lecture Notes in Electrical Engineering ((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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 169.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 219.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 219.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Shamir A (1979) How to share a secret. Commun ACM 22(11):612–613

    Article  MATH  MathSciNet  Google Scholar 

  2. Harn L (1995) Efficient sharing (broadcasting) of multiple secrets. IEE Comput Digital Tech 142(3):237–240

    Article  Google Scholar 

  3. Heidarvand S, Villar JL (2008) Public verifiability from pairings in secret sharing schemes. SAC LNCS 53(1):294–308

    Google Scholar 

  4. Tartary C, Pieprzyk J, Wang H (2007) Verifiable multi-secret sharing schemes for multiple threshold access structures. Inscrypt LNCS 49(9):167–181

    Google Scholar 

  5. Pang LJ, Pei QQ et al (2008) An identity (ID)-based threshold multi-secret sharing scheme. J Softw 19(10):2739–2745

    Article  MATH  Google Scholar 

  6. Bu YS, Kun Y, Wang RC (2009) A secret sharing scheme based on NTRU algorithm. J Chin Comput Syst 30(10):1986–1987

    Google Scholar 

  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–638

    MathSciNet  Google Scholar 

  8. Qia S, Du WZ (2011) Multi-secret sharing scheme based on RSA and remainder theorem. Comput Eng 37(2):141–142

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Shanyue Bu .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2013 Springer-Verlag London

About this paper

Cite this paper

Bu, S., Yang, R. (2013). Novel and Effective Multi-Secret Sharing Scheme. In: Zhong, Z. (eds) Proceedings of the International Conference on Information Engineering and Applications (IEA) 2012. Lecture Notes in Electrical Engineering, vol 219. Springer, London. https://doi.org/10.1007/978-1-4471-4853-1_58

Download citation

  • DOI: https://doi.org/10.1007/978-1-4471-4853-1_58

  • Published:

  • Publisher Name: Springer, London

  • Print ISBN: 978-1-4471-4852-4

  • Online ISBN: 978-1-4471-4853-1

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics