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.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Shamir, A.: How to Share a Secret. Communications of the ACM 22, 612–613 (1979)
Blakley, G.: Safeguarding Cryptographic Key. In: Smith, M., Zanca, J.T. (eds.) Proc. AFIPS 1979 Natl. Conf., pp. 313–317. AFIPS Press, New York (1979)
He, J., Dawson, E.: Multistage Secret Sharing Based on One-way Function. Electronics Letters 30, 1591–1592 (1994)
Harn, L.: Efficient Sharing (Broadcasting) of Multiple Secrets. IEE Proceedings-—Computers and Digital Techniques 142, 237–240 (1995)
Chien, H.-Y., Jan, J.-K., Tseng, Y.-M.: A Practical (t, n) Multi-secret Sharing Scheme. IEICE Transactions on Fundamentals E83-A (12), 2762–2765 (2000)
Yang, C.-C., Chang, T.-Y., Hwang, M.S.: A (t, n) Multi-secret Sharing Scheme. Applied Mathematics and Computation 151, 483–490 (2004)
Pang, L.-J., Wang, Y.-M.: A New (t,n) Multi-secret Sharing Scheme Based on Shamir’s Secret Sharing. Applied Mathematics and Computation 167, 840–848 (2005)
Tan, K.-J., Zhu, H.-W., Gu, S.-J.: Cheater Identification in (t, n) Threshold Scheme. Computer Communications 22, 762–765 (1999)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Li, H., Cheng, C., Pang, L. (2005). A New (t, n)-Threshold Multi-secret Sharing Scheme. In: Hao, Y., et al. Computational Intelligence and Security. CIS 2005. Lecture Notes in Computer Science(), vol 3802. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11596981_61
Download citation
DOI: https://doi.org/10.1007/11596981_61
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-30819-5
Online ISBN: 978-3-540-31598-8
eBook Packages: Computer ScienceComputer Science (R0)