A Secure and Efficient Secret Sharing Scheme with General Access Structures
A new secret sharing scheme with general access structures was proposed, which is based on Shamir’s secret sharing scheme and the discrete logarithm problem. In this scheme, the dealer need not send any secret information to participants. And the shared secret, the participant set and the access structure can be changed dynamically without updating any participant’s secret shadow. The degree of the used Lagrange interpolation polynomial is only one, which makes the computational complexity of the proposed scheme very low. The proposed scheme has advantages over the existing schemes and thus provides great capabilities for many applications.
KeywordsSecret Sharing Access Structure Secret Sharing Scheme Secret Information Threshold Scheme
Unable to display preview. Download preview PDF.
- 2.Blakley, G.: Safeguarding cryptographic keys. In: Proc. AFIPS 1979 Natl. Conf., New York, pp. 313–317 (1979)Google Scholar
- 3.Benaloh, J., Leichter, J.: Generalized secret sharing and monotone functions. In: Goldwasser, S. (ed.) CRYPTO 1988. LNCS, vol. 403, pp. 27–35. Springer, Heidelberg (1990)Google Scholar