A new (t, n)-threshold multi-secret sharing scheme

  • Authors:

  • HuiXian Li;ChunTian Cheng;LiaoJun Pang

  • Affiliations:

  • School of Electronic and Information Engineering, Dalian University of Technology, Dalian1, China;Institute of Hydroinformatics, Dalian University of Technology, Dalian1, China;National Key Labtorary of Integrated Service Networks, Xidian University, Xi’an, China

  • Venue:
  • CIS'05 Proceedings of the 2005 international conference on Computational Intelligence and Security - Volume Part II
  • Year:
  • 2005

Quantified Score

Hi-index 0.00

Visualization

Abstract

In a (t, n)-threshold multi-secret sharing scheme, at least t or more participants in n participants can reconstruct p(p ≥ 1) secrets simultaneously through pooling their secret shadows. Pang et al. proposed a multi-secret sharing scheme using an (n + p – 1)th degree Lagrange interpolation polynomial. In their scheme, the degree of the polynomial is dynamic; with the increase in the number of the shared secrets p, the Lagrange interpolation operation becomes more and more complex, at the same time, computing time and storage requirement are large. Motivated by these concerns, we propose an alternative (t, n)-threshold multi-secret sharing scheme based on Shamir’s secret sharing scheme, which uses a fixed nth degree Lagrange interpolation polynomial and has the same power as Pang et al.’s scheme. Furthermore, our scheme needs less computing time and less storage requirement than Pang et al.’s scheme.