An Efficient Threshold Multi-group-Secret Sharing Scheme
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.
KeywordsSecret sharing Threshold Multi-group-secret sharing Chinese Remain Theorem
Unable to display preview. Download preview PDF.
- 1.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)Google Scholar
- 3.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)Google Scholar
- 7.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)Google Scholar
- 11.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)Google Scholar