Voir la notice du chapitre de livre provenant de la source Math-Net.Ru
[1] Blakley G. R., “Safeguarding cryptographic keys”, Proc. AFIPS 1979 National Computer Conference, V. 48, N. Y., 1979, 313–317
[2] Shamir A., “How to Share a Secret”, Comm. ACM, 22:1 (1979), 612–613 | DOI | MR | Zbl
[3] Brickell E. F., Davenport D. M., “On the classification of Ideal Secret Sharing Schemes”, J. Cryptology, 4 (1991), 123–134 | MR | Zbl
[4] Mak-Vilyame F. Dzh., Sloen N. Dzh. A., Teoriya kodov, ispravlyayuschikh oshibki, Svyaz, M., 1979
[5] Csirmaz L., “The size of a share must be large”, J. Cryptology, 10:4 (1997), 223–231 | DOI | MR | Zbl
[6] Welsh D. J. A., Matroid Theory, Academic Press, 1976 | MR | Zbl
[7] Bleikli G. R., Kabatyanskii G. A., “Obobschënnye idealnye skhemy, razdelyayuschie sekret, i matroidy”, Problemy peredachi informatsii, 33:3 (1997), 102–110 | MR | Zbl
[8] Seymour P. O., “On Secret-Sharing Matroids”, J. Comb. Theory. Ser. B, 56 (1992), 69–73 | DOI | MR | Zbl
[9] Ashihmin A., Simonis J., “Almost Affine codes”, Designs, Codes and Cryptography, 14:2 (1998), 179–197 | DOI | MR