Abstract
In this paper, a novel threshold multi-group-secret sharing scheme is proposed based on Chan et al.’s scheme. Multiple groups of secrets are packed into a group of large secrets by using the Chinese Remain Theorem, and then shared by constructing a secret polynomial such that its coefficients are those large secrets. In the proposed scheme, the secret distribution procedure is needed only once to share multiple groups of secrets, which reduces the amount of computation largely. Moreover, each group of secrets has a different threshold access structure and includes a distinct number of secrets. Analysis results show that the proposed scheme needs fewer public values and is higher in efficiency and easier in implementation than existing schemes, especially for sharing many groups of secrets, which makes it more practical in practice.
This work is supported by the National Science Foundation for Post-doctoral Scientists of China (Grant No. 20060401008).
This is a preview of subscription content, log in via an institution to check access.
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
Desmedt, Y.: Some recent research aspects of threshold cryptography. In: Okamoto, R., Davida, G., Mambo, M. (eds.) Information Security, pp. 158–173. Springer, Berlin (1997)
Shamir, A.: How to share a secret. Communications of the ACM 22, 612–613 (1979)
Blakley, G.: Safeguarding cryptographic key. In: Merwin, R.E., Zanca, J.T., Smith, M. (eds.) Proceedings of AFIPS, pp. 313–317. AFIPS Press, New York (1979)
Asmuth, C., Bloom, J.: A modular approach to key safeguarding. IEEE Transactions on Information Theory IT-29, 208–210 (1983)
Crescenzo, G.D.: Sharing one secret vs. sharing many secrets. Theoret. Comput. Sci. 295, 123–140 (2003)
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, 2762-2765 (2000)
Li, H.X., Cheng, C.T., Pang, L.J.: A new (t, n)-threshold multi-secret sharing scheme. In: Hao, Y., Liu, J., Wang, Y., et al. (eds.) Computational Intelligence and Security, pp. 421–426. Springer, Berlin (2005)
Pang, L.J., Wang, Y.M.: A new (t, n) multi-secret sharing scheme based on Shamir’s secret sharing. Appl. Math. & Compt 167, 840–848 (2005)
Chan, C.W., Chang, C.C.: A scheme for threshold multi-secret sharing. Appl. Math. & Compt 166, 1–14 (2005)
El Gamal, T.: A public-key cryptosystem and a signature scheme based on discrete logarithms. IEEE Trans. on Info. Theory IT-31, 469–472 (1985)
Nathanson, M.B.: Elementary methods in number theory. Springer, New York (2000)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Li, HX., Pang, LJ., Cai, WD. (2007). An Efficient Threshold Multi-group-Secret Sharing Scheme. In: Cao, BY. (eds) Fuzzy Information and Engineering. Advances in Soft Computing, vol 40. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-71441-5_99
Download citation
DOI: https://doi.org/10.1007/978-3-540-71441-5_99
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-71440-8
Online ISBN: 978-3-540-71441-5
eBook Packages: EngineeringEngineering (R0)