CRYPTO '89 Proceedings on Advances in cryptology
An explication of secret sharing schemes
Designs, Codes and Cryptography
The breadth of Shamir's secret-sharing scheme
Computers and Security
Communications of the ACM
Generalized Secret Sharing and Monotone Functions
CRYPTO '88 Proceedings of the 8th Annual International Cryptology Conference on Advances in Cryptology
IEEE Transactions on Information Theory
A new generalized group-oriented cryptoscheme without trusted centers
IEEE Journal on Selected Areas in Communications
Practical secret sharing scheme realizing generalized adversary structure
Journal of Computer Science and Technology
Weighted Threshold Secret Image Sharing
PSIVT '09 Proceedings of the 3rd Pacific Rim Symposium on Advances in Image and Video Technology
A secret sharing scheme with a short share realizing the (t,n) threshold and the adversary structure
Computers & Mathematics with Applications
Hi-index | 0.24 |
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.