Geodesic
The evaluation of code noising security against the $l$-fold partial data observation in the network
Prikladnaâ diskretnaâ matematika, no. 4 (2014), pp. 62-71.

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

A communication network with linear coding in the nodes is considered. It is assumed that an adversary can overhear data transmitted through some edges of the network and code noising is used to protect incoming information. In the paper, the security of code noising against multiple eavesdropping the network data is analysed. A formula for calculating the security against $l$ interceptions of information words is obtained. The formula is applied to the security analysis of code noising based on Reed–Muller code $\mathcal R(1,3)$.
Keywords: network coding, code noising, analysis of security.
Mots-clés : partial observation 
@article{PDM_2014_4_a6,
     author = {I. I. Vinnichuk and Y. V. Kosolapov},
     title = {The evaluation of code noising security against the $l$-fold partial data observation in the network},
     journal = {Prikladna\^a diskretna\^a matematika},
     pages = {62--71},
     publisher = {mathdoc},
     number = {4},
     year = {2014},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/PDM_2014_4_a6/}
}
TY  - JOUR
AU  - I. I. Vinnichuk
AU  - Y. V. Kosolapov
TI  - The evaluation of code noising security against the $l$-fold partial data observation in the network
JO  - Prikladnaâ diskretnaâ matematika
PY  - 2014
SP  - 62
EP  - 71
IS  - 4
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/PDM_2014_4_a6/
LA  - ru
ID  - PDM_2014_4_a6
ER  - 
%0 Journal Article
%A I. I. Vinnichuk
%A Y. V. Kosolapov
%T The evaluation of code noising security against the $l$-fold partial data observation in the network
%J Prikladnaâ diskretnaâ matematika
%D 2014
%P 62-71
%N 4
%I mathdoc
%U http://geodesic.mathdoc.fr/item/PDM_2014_4_a6/
%G ru
%F PDM_2014_4_a6
I. I. Vinnichuk; Y. V. Kosolapov. The evaluation of code noising security against the $l$-fold partial data observation in the network. Prikladnaâ diskretnaâ matematika, no. 4 (2014), pp. 62-71. http://geodesic.mathdoc.fr/item/PDM_2014_4_a6/

[1] Gabidulin E. M., Pilipchuk N. I., Kolybelnikov A. I. i dr., “Setevoe kodirovanie”, Trudy MFTI, 1:2 (2009), 3–25

[2] Yeung R. W., Zhang Z., “Distributed source coding for satellite communications”, IEEE Trans. Inform. Theory, 1:45 (1999), 1111–1120 | DOI | MR

[3] Ahlswede R., Cai N., Li S. R., Yeung R. W., “Network information flow”, IEEE Trans. Inform. Theory, 46:6 (2000), 1204–1216 | DOI | MR | Zbl

[4] Barash L. S., “Setevoe kodirovanie”, Kompyuternoe obozrenie, 5:671 (2009), 20–31

[5] Rouayheb S. E., Soljanin E., “On wiretap networks II”, Proc. 2007 IEEE Intern. Symp., ISIT-2007 (Nice, France, 24–29 June 2007), 551–555

[6] Rouayheb S. E., Soljanin E., Sprinston A., “Secure network coding for wiretap networks of type II”, IEEE Trans. Inform. Theory, 58:3 (2012), 1361–1371 | DOI | MR

[7] Ozarov H., Wyner A. D., “Wire-Tap Channel II”, BLTj, 63:10 (1984), 2135–2157

[8] Vinnichuk I. I., Gazaryan Yu. O., Kosolapov Yu. V., “Stoikost kodovogo zashumleniya v ramkakh modeli mnogokratnogo chastichnogo nablyudeniya kodovykh soobschenii”, Materialy XII Mezhdunar. nauch.-praktich. konf. “Informatsionnaya bezopasnost”, Izvestiya YuFU, Taganrog, 2012, 258–263

[9] Yeung R. W., Li S. R., Cai N., et al., “Network coding theory, foundation and trends”, Communic. Inform. Theory, 2:4 (2005), 241–381 | DOI | MR

[10] Deundyak V. M., Kosolapov Yu. V., “Matematicheskaya model kanala s perekhvatom vtorogo tipa”, Izv. vuzov. Severo-Kavkazskii region, Ser. Estestvennye nauki, 3:145 (2008), 3–8 | Zbl

[11] Shankin G. P., Tsennost informatsii. Voprosy teorii i prilozhenii, Filomatis, M., 2004, 128 pp.

[12] Deundyak V. M., Kosolapov Yu. V., “Ob odnom metode snyatiya neopredelennosti v kanale s pomekhami v sluchae primeneniya kodovogo zashumleniya”, Izvestiya YuFU. Tekhnicheskie nauki, 2:151 (2014), 197–208