1. G R Blakley. Safeguarding cryptographic keys. AFIPS conference proceedings, 1979, 48:313^-317

2. A Shamir. How to share a secret. Communications of the ACM, 1979,22(11):612^"613

3. E F Brickell. Some ideal secret sharing scheme. Journal of combinatorial mathematics and combinatorial computing, 1989,9:105113

4. E F Brickell, D M Davenport. On the classification of ideal secret sharing schemes. Journal of Cryptology, 1991, 4:121^ 134

5. L Gong,D L Wheeler. A Matrix key-distribution scheme.]ournal of Cryptology, 1990,2:51_59

6. C S Laih, L Harn, J Lee, T Hwang. Dynamic threshold scheme based on the definition of cross-product in an N-dimensional linear space. Crypto'89, Lecture notes in computer science 435.Springer-verlag, 1990, 286一297

7. S C Kothari. Generalized linear threshold scheme. Advances in Cryptography: Proceedings of Crypto' 84. Springer-verlag, 1985.231^-241

8. E D Karnin, J W Greene, M E Hellman. On sharing secret system. IEEE Transactions on Information Theory, 1983,29:35一41

9. T Matsumoto. Incidence structure for key sharing. Advance in Cryptology: ASIACRYPT'94, Lecture Notes in Computer Science,1995,917:342一353

10. D R Stinson. Cryptography theory and practice. CRC press, Inc, Boca Raton, 1995

11. D R Stinson. On some methods for unconditionally secure key distribution and broadcast encryption. Designs, Codes and Cryptogra-phy, 1997,12:251一243

12. D R Stinson. An explication of secret sharing scheme. Designs, Codes and Cryptography, 1992,4:177^ 191

13. G J Simmons(ed).Contemporary Cryptology, The science of information integrity. IEEE Press, 1992

14. B Schneier. Applied cryptography: Protocol, Algorithm, and Source code in C. John Wiley&Sons, Inc.1996