General secret sharing scheme
Based on the idea in (J. Benaloh, J. Leichter, Generalized secret sharing and monotone functions, in: Advances in Cryptology-CRYPTO'88, Lecture Notes in Computer Science, Springer, Berlin, 1990, pp. 27-35.), a method to realize general secret sharing scheme is given in this research note. It is not necessary for the group participants to store several shares but an interpolating polynomial. However, it suits some extensive situation that there are several secrets shared in system, while the methods in (E. Dawson, D. Donovan, The breadth of shamir's secret sharing scheme. Computers and Security, 13 (1995) 69-78., J. Benaloh, J. Leichter, Generalized secret sharing and monotone functions, in: Advances in Cryptology-CRYPTO'88, Lecture Notes in Computer Science, Springer, Berlin, 1990, pp. 27-35.;. C.C. Chang, H.C. Lee, A new generalized group-oriented cryptoscheme without trusted centers. IEEE Journal on Selected Areas in Communications, 11(5) (1993) 725-729.) cannot do that. (C) 1999 Elsevier Science B.V. All rights reserved.
general secret sharing scheme interpolating polynomial information theory cryptosystems threshold minimal authority subgroup