An l-Span Generalized Secret Sharing Scheme
For some secret sharing applications, the secret reconstructed is not revealed to the participants, and therefore, the secret/shadows can be repeatedly used without having to be changed. But for other applications, in which the secret reconstructed is revealed to participants, a new secret must be chosen and its corresponding shadows must be regenerated and then secretly distributed to participants again, in order to enforce the same secret sharing policy. This is inefficient because of the overhead in the generation and distribution of shadows. In this paper, an l-span secret sharing scheme for the general sharing policy is proposed to solve the secret/shadows regeneration problem by extending the life span of the shadows from 1 to l, i. e., the shadows can be repeatedly used for l times to generate l different secrets.
- M. Ito, A. Saito, and T. Nishizeki, “Secret Sharing Scheme Realizing General Access Structure”, Proc. Glob. Com (1987).Google Scholar
- J. Benaloh, and J. Leichter, “Generalized Secret Sharing and Monotone Functions”, Proc. Crypto’ 88, Springer-Verlag, 27–35.Google Scholar
- H. Y. Lin and L. Harn, “A Generalized Secret Sharing Scheme with Cheater Detection”, Proc. Asiacrypt’ 91, Nov. 1991, Japan.Google Scholar
- C. S. Laih, L. Harn, J. Y. Lee and T. Hwang, “Dynamic Threshold Scheme Based on the Definition of Cross-Product in an N-Dimensional Linear Space”, Proc. Crypto’ 89, Springer-Verlag, 286–297.Google Scholar