References
- J. Crytology v.4 On the classification of ideal secret sharing schemes Brickell E.F.;Davenport D.M.
- Eurocrypt'92 Graph decomposition and secret sharing schemes Blundo C;De Santis A;Stinson D.R.;Vaccaro U
- Crypto'90 On the information rate of secret sharing schemes Blundo C.;De Santis A;Gargano L;Vaccaro U
- Design theory Beth T;Jungnickel D;Lenz H
- Advances in Cryptography-Proc. of Crypto'88 Generalized secret sharing and monotone functions Benaloh J.;Letchter J.
- Proc, of AFIPS 1979 Nat. Computer Conference v.48 Safeguarding Cryptographic keys Blakley G. R.
- IEEE Tr. IT v.29 A modulor approach to key safeguarding Asmuth C. A.
- J. Cryptology Some improved bounds on the information rate of perfect secret sharing schemes Brickell E. F.;Stinson D. R.
- Design theory Hughes D. R.;Piper F. C.
- Proc. IEEE Globecom'87 Secret sharing scheme realizing general access structure Ito M.;Saito A.;Nishizeki, T.
- IEEE Trans v.IT-29 no.2 On secret sharing systems Karnin E.D.;Green J. W.;Hellman M. E.
- Comm ACM v.24 On sharing secrets and Reed-Solomon codes McEliece R. J.;Sarwate D.
- Comm. of the ACM v.22 How to share secret Shamir A
- Proc. of Crypto'92 New general lower bounds on the information rate of secret sharing schemes Stinson D. R.