Geodesic
Research of applying bounds of the information protection scheme based on PS-codes
Diskretnyj analiz i issledovanie operacij, Tome 18 (2011) no. 3, pp. 21-38.

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

The issue of copyrighted media secure distribution is considered. Mathematical model of a broadcast encryption scheme is constructed, bounds of applying of the scheme in case of excess of threshold coalition power value is researched. Bibliogr. 12.
Keywords: generalized Reed–Solomon code, list decoding, broadcast encryption, coalition attack. 
@article{DA_2011_18_3_a2,
     author = {V. M. Deundyak and V. V. Mkrtichan},
     title = {Research of applying bounds of the information protection scheme based on {PS-codes}},
     journal = {Diskretnyj analiz i issledovanie operacij},
     pages = {21--38},
     publisher = {mathdoc},
     volume = {18},
     number = {3},
     year = {2011},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/DA_2011_18_3_a2/}
}
TY  - JOUR
AU  - V. M. Deundyak
AU  - V. V. Mkrtichan
TI  - Research of applying bounds of the information protection scheme based on PS-codes
JO  - Diskretnyj analiz i issledovanie operacij
PY  - 2011
SP  - 21
EP  - 38
VL  - 18
IS  - 3
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/DA_2011_18_3_a2/
LA  - ru
ID  - DA_2011_18_3_a2
ER  - 
%0 Journal Article
%A V. M. Deundyak
%A V. V. Mkrtichan
%T Research of applying bounds of the information protection scheme based on PS-codes
%J Diskretnyj analiz i issledovanie operacij
%D 2011
%P 21-38
%V 18
%N 3
%I mathdoc
%U http://geodesic.mathdoc.fr/item/DA_2011_18_3_a2/
%G ru
%F DA_2011_18_3_a2
V. M. Deundyak; V. V. Mkrtichan. Research of applying bounds of the information protection scheme based on PS-codes. Diskretnyj analiz i issledovanie operacij, Tome 18 (2011) no. 3, pp. 21-38. http://geodesic.mathdoc.fr/item/DA_2011_18_3_a2/

[1] Deundyak V. M., Mkrtichyan V. V., “Matematicheskaya model effektivnoi skhemy spetsialnogo shirokoveschatelnogo shifrovaniya i issledovanie granits eë primeneniya”, Izv. vuzov. Severo-Kavkazskii region. Estestv. nauki, 2009, no. 1, 5–8 | Zbl

[2] Kabatyanskii G. A., “Kody dlya zaschity avtorskikh prav: sluchai dvukh piratov”, Problemy peredachi informatsii, 41:2 (2005), 123–127 | MR | Zbl

[3] Mkrtichyan V. V., “Kompyuternaya model skhemy spetsialnogo shirokoveschatelnogo shifrovaniya na osnove kodov Rida–Solomona i spisochnogo dekodera Gurusvami–Sudana”, Mat. IX mezhdunarodnoi nauchno-prakticheskoi konf. “Informatsionnaya bezopasnost”, v. 2, YuFU, Taganrog, 2007, 111–115

[4] Mkrtichyan V. V., “Kompyuternye modeli spisochnykh dekoderov Gurusvami–Sudana dlya obobschënnykh kodov Rida–Solomona i konkatenirovannykh kodov”, Vestn. DGTU, 7:4 (2007), 384–394

[5] Mkrtichyan V. V., “Ob eksperimentalnom issledovanii nadezhnosti i primenenii skhemy spetsialnogo shirokoveschatelnogo shifrovaniya”, Izv. YuFU. Tekhn. nauki, 2008, no. 8, 203–210

[6] Sidelnikov V. M., Teoriya kodirovaniya, Fizmatlit, M., 2008, 324 pp.

[7] Shnaier B., Prikladnaya kriptografiya. Protokoly, algoritmy, iskhodnye teksty na yazyke Si, Triumf, M., 2002, 816 pp.

[8] Barg A., Blakley G. R., Kabatiansky G. A., “Digital fingerprinting codes: problem statements, constructions, identification of traitors”, IEEE Trans. Inf. Theory, 49 (2003), 852–865 | DOI | MR | Zbl

[9] Chor B., Fiat A., Naor M., “Tracing traitors”, Proc. Advances in cryptology (Crypto' 94), Lect. Notes Comp. Sci., 839, 1994, 257–270 | Zbl

[10] Guruswami V., List decoding of error-correcting codes, Springer-Verl., New York, 2005, 350 pp.

[11] Silverberg A., Staddon J., Walker J., “Application of list decoding to tracing traitors”, Proc. Advances in cryptology (ASIACRYPT 2001), Lect. Notes Comp. Sci., 2248, 2001, 175–192 | MR | Zbl

[12] Staddon J. N., Stinson D. R., Wei R., “Combinatorial properties of frameproof and traceability codes”, IEEE Trans. Inf. Theory, 47 (2001), 1042–1049 | DOI | MR | Zbl