Geodesic
Математика разделения секрета
Matematicheskoe Prosveshchenie, Matematicheskoe Prosveshchenie (1998), pp. 115-126.

Voir la notice de l'article provenant de la source Math-Net.Ru

@article{MP_1998_a8,
     author = {G. A. Kabatiansky},
     title = {{\CYRM}{\cyra}{\cyrt}{\cyre}{\cyrm}{\cyra}{\cyrt}{\cyri}{\cyrk}{\cyra} {\cyrr}{\cyra}{\cyrz}{\cyrd}{\cyre}{\cyrl}{\cyre}{\cyrn}{\cyri}{\cyrya} {\cyrs}{\cyre}{\cyrk}{\cyrr}{\cyre}{\cyrt}{\cyra}},
     journal = {Matematicheskoe Prosveshchenie},
     pages = {115--126},
     publisher = {mathdoc},
     year = {1998},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/MP_1998_a8/}
}
TY  - JOUR
AU  - G. A. Kabatiansky
TI  - Математика разделения секрета
JO  - Matematicheskoe Prosveshchenie
PY  - 1998
SP  - 115
EP  - 126
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/MP_1998_a8/
LA  - ru
ID  - MP_1998_a8
ER  - 
%0 Journal Article
%A G. A. Kabatiansky
%T Математика разделения секрета
%J Matematicheskoe Prosveshchenie
%D 1998
%P 115-126
%I mathdoc
%U http://geodesic.mathdoc.fr/item/MP_1998_a8/
%G ru
%F MP_1998_a8
G. A. Kabatiansky. Математика разделения секрета. Matematicheskoe Prosveshchenie, Matematicheskoe Prosveshchenie (1998), pp. 115-126. http://geodesic.mathdoc.fr/item/MP_1998_a8/

[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