Skip to main content
Log in

(t, n) Multi-Secret Sharing Scheme Based on Bivariate Polynomial

  • Published:
Wireless Personal Communications Aims and scope Submit manuscript

Abstract

In a (tn) secret sharing scheme (SS), a dealer divides the secret into n shares in such way that any t or more than t shares can reconstruct the secret but fewer than t shares cannot reconstruct the secret. The multi-SS is an extension of the (tn) SS in which shares can be reused to reconstruct multiple secrets. Thus, the efficiency of the multi-SS is better than the efficiency of the (tn) SS. In this paper, we propose the first multi-SS using a bivariate polynomial. Our design is unique in comparing with all existing multi-SSs. Shares generated using a bivariate polynomial can not only be used to reconstruct multiple secrets but also be used to establish pairwise keys between any pair of shareholders. The pairwise keys can protect exchange information in the secret reconstruction to prevent outsiders from obtaining the recovered secrets. All existing multi-SSs require additional key establishment to accomplish this.

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

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Asmuth, C. A., & Bloom, J. (1983). A modular approach to key safeguarding. IEEE Transactions on Information Theory, 30(2), 208–210.

    Article  MathSciNet  Google Scholar 

  2. Blakley, G. R. (1979). Safeguarding cryptographic keys. In Proceedings of AFIPS’79 national computer conference (Vol. 48, pp. 313–317). Montvale: AFIPS Press.

  3. Benaloh, J. C. (1987). Secret sharing homomorphisms: Keeping shares of a secret. In Advances in cryptology—CRYPTO’86, in LNCS (Vol. 263, pp. 251–260). New York: Springer.

  4. Gennaro, R., Ishai, Y., Kushilevitz, E., & Rabin, T. (2001). The round complexity of verifiable secret sharing and secure multicast. In STOC (pp. 580–589).

  5. Harn, L., & Lin, C. (2010). Authenticated group key transfer protocol based on secret sharing. IEEE Transactions on Computers, 59(6), 842–846.

    Article  MathSciNet  MATH  Google Scholar 

  6. Harn, L. (2013). Group authentication. IEEE Transactions on Computers, 62(9), 1893–1898.

    Article  MathSciNet  MATH  Google Scholar 

  7. Harn, L. (2014). Secure secret reconstruction and multi-secret sharing schemes with unconditional security. Security and Communication Networks, 7(3), 567–573.

    Article  Google Scholar 

  8. Harn, L. (1995). Efficient sharing (broadcasting) of multiple secrets. IEE Computers and Digital Techniques, 142(3), 237–240.

    Article  Google Scholar 

  9. Harn, L. (1995). Comment multistage secret sharing based on one-way function. Electronic Letters, 31(4), 262.

    Article  Google Scholar 

  10. He, J., & Dawson, E. (1994). Multistage secret sharing based on one-way function. Electronic Letters, 30(19), 1591–1592.

    Article  Google Scholar 

  11. He, J., & Dawson, E. (1995). Multi-secret sharing scheme based on one-way function. Electronic Letters, 31(2), 93–94.

    Article  Google Scholar 

  12. Katz, J., Koo, C., & Kumaresan, R. (2008). Improved the round complexity of VSS in point-to-point networks. In Proceedings of ICALP ‘08, Part II, in: LNCS (Vol. 5126, pp. 499–510). New York: Springer.

  13. Kumaresan, R., Patra, A., & Rangan, C. P. (2010). The round complexity of verifiable secret sharing: the statistical case. In Advances in cryptology—ASIACRYPT 2010, in: LNCS (Vol. 6477, pp. 431–447). New York: Springer.

  14. Lin, T. Y., & Wu, T. C. (1999). (tn) threshold verifiable multisecret sharing scheme based on factorisation intractability and discrete logarithm modulo a composite problems. IEE Proceedings of Computers & Digital Techniques, 146(5), 264–268.

    Article  Google Scholar 

  15. Lin, H. Y., & Yeh, Y. S. (2008). Dynamic multi-secret sharing scheme. International Journal of Contemporary Mathematical Sciences, 3(1), 37–42.

    MathSciNet  MATH  Google Scholar 

  16. Mignotte, M. (1983). How to share a secret. In Cryptography-proceedings of the workshop on cryptography, lecture notes in computer science (Vol. 149, pp. 371–375). New York: Springer.

  17. Nirmala, S. J., Bhanu, S. M. S., & Patel, A. A. (2012). A comparative study of the secret sharing algorithms for secure data in the cloud. International Journal on Cloud Computing: Services and Architecture (IJCCSA), 2(4), 63–71.

    Google Scholar 

  18. Nojoumian, M., & Stinson, D. R. (2012). Social secret sharing in cloud computing using a new trust function. In Proceeding of 2012 tenth annual international conference on privacy, security and trust (pp. 16–167).

  19. Nikov, V., & Nikova, S. (2005). On proactive secret sharing schemes. In LNCS (Vol. 3357, pp. 308–325). New York: Springer.

  20. Shamir, A. (1979). How to share a secret. Communications of the ACM, 22(11), 612–613.

    Article  MathSciNet  MATH  Google Scholar 

  21. Shao, J., & Cao, Z. (2005). A new efficient (tn) verifiable multi-secret sharing (VMSS) based on YCH scheme. Applied Mathematics and Computation, 168(1), 135–140.

    Article  MathSciNet  MATH  Google Scholar 

  22. Takahashi, S., & Iwamura, K. (2013). Secret sharing scheme suitable for cloud computing. In Proceeding of 2013 IEEE 27th international conference on advanced information networking and applications (pp. 530–537).

  23. Yang, C. C., Chang, T. Y., & Hwang, M. S. (2004). A (t, n) multi secret sharing scheme. Applied Mathematics and Computation, 151, 483–490.

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Ching-Fang Hsu.

Additional information

L. Harn and C.-F. Hsu have been contributed equally to this work.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Harn, L., Hsu, CF. (t, n) Multi-Secret Sharing Scheme Based on Bivariate Polynomial. Wireless Pers Commun 95, 1495–1504 (2017). https://doi.org/10.1007/s11277-016-3862-z

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11277-016-3862-z

Keywords

Navigation