General secret sharing scheme

Computer Communications

Volumn 22, Issue 8, 1999, Pages 755-757

  Tan, K J ^a   Zhu, H W ^a  

^a 200030 ^*  (China)

Author keywords

[No Author keywords available]

Indexed keywords

INFORMATION THEORY; INTERPOLATION; POLYNOMIALS; SECURITY OF DATA;

GENERAL SECRET SHARING SCHEMES; MINIMAL AUTHORITY SUBGROUPS;

CRYPTOGRAPHY;

EID: 0032628732     PISSN: 01403664     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0140-3664(99)00041-9     Document Type: Article

References (9)

1. Shamir A. How to share a secret. Comm. ACM. 22:(11):1979;612-613.
2. Blakley G.R. Safeguarding cryptographic keys. Proc. AFIPS 1979 Natl. Comput. Conf., New York. 48:1979;313-317.
3. Karnin E.D., Greene J.W., Massey J.L. On secret sharing systems. IEEE Trans. Inform. Theory. IT-29:(1):1983;35-41.
4. Desmedt Y., Frankel Y. Threshold cryptosystems: advances in cryptology-CRYPTO'89, Lecture Notes in Computer Science. 1989;Springer, New York. pp. 307-315.
5. Stinson D.R. An explication of secret sharing schemes. Des. Codes Crypt. 2:1992;357-390.
6. Sun H.M., Shieh S.P. Construction of dynamic threshold schemes. Electronics Lett. 30:(24):1994;2023-2024.
7. Dawson E., Donovan D., The breadth of Shamir's secret sharing scheme. Comput. Security. 13:1995;69-78.
8. Benaloh J., Leichter J. Generalized secret sharing and monotone functions: advances in cryptology-CRYPTO'88, Lecture Notes in Computer Science. 1990;Springer, Berlin. pp. 27-35.
9. Chang C.C., Lee H.C. A new generalized group-oriented cryptoscheme without trusted centers. IEEE Journal on Selected Areas in Communications. 11:(5):1993;725-729.