Home > Research > Publications & Outputs > Information security in a random network coding...
View graph of relations

Information security in a random network coding network

Research output: Contribution to Journal/MagazineJournal articlepeer-review

Published

Standard

Information security in a random network coding network. / Gabidulin, E. M.; Pilipchuk, N.; Honary, Bahram et al.
In: Problems of Information Transmission, Vol. 49, No. 2, 04.2013, p. 179-191.

Research output: Contribution to Journal/MagazineJournal articlepeer-review

Harvard

Gabidulin, EM, Pilipchuk, N, Honary, B & Rashwan, H 2013, 'Information security in a random network coding network', Problems of Information Transmission, vol. 49, no. 2, pp. 179-191. https://doi.org/10.1134/S0032946013020075

APA

Gabidulin, E. M., Pilipchuk, N., Honary, B., & Rashwan, H. (2013). Information security in a random network coding network. Problems of Information Transmission, 49(2), 179-191. https://doi.org/10.1134/S0032946013020075

Vancouver

Gabidulin EM, Pilipchuk N, Honary B, Rashwan H. Information security in a random network coding network. Problems of Information Transmission. 2013 Apr;49(2):179-191. doi: 10.1134/S0032946013020075

Author

Gabidulin, E. M. ; Pilipchuk, N. ; Honary, Bahram et al. / Information security in a random network coding network. In: Problems of Information Transmission. 2013 ; Vol. 49, No. 2. pp. 179-191.

Bibtex

@article{d9f288684d0a4408a070da6c3c289a30,
title = "Information security in a random network coding network",
abstract = "We consider a communication network with random network coding which can be attacked by adversaries of two types. One of them can wiretap original packets outgoing from source to destination. The other can insert its own packets into information flow, which are wrong messages for the receiver. To provide secure communication, we use a scheme based on combining the GPT (Gabidulin-Paramonov-Tretjakov) public key cryptosystem and SKK (Silva-Kschischang-Koetter) codes. Encrypted packets are transmitted to the destination through wired channels. Performance of this system is investigated. The main result is that the proposed scheme is secure against wiretapping and insertion attacks under some conditions which depend on rank code parameters.",
author = "Gabidulin, {E. M.} and N. Pilipchuk and Bahram Honary and Haitham Rashwan",
year = "2013",
month = apr,
doi = "10.1134/S0032946013020075",
language = "English",
volume = "49",
pages = "179--191",
journal = "Problems of Information Transmission",
issn = "0032-9460",
publisher = "Maik Nauka-Interperiodica Publishing",
number = "2",

}

RIS

TY - JOUR

T1 - Information security in a random network coding network

AU - Gabidulin, E. M.

AU - Pilipchuk, N.

AU - Honary, Bahram

AU - Rashwan, Haitham

PY - 2013/4

Y1 - 2013/4

N2 - We consider a communication network with random network coding which can be attacked by adversaries of two types. One of them can wiretap original packets outgoing from source to destination. The other can insert its own packets into information flow, which are wrong messages for the receiver. To provide secure communication, we use a scheme based on combining the GPT (Gabidulin-Paramonov-Tretjakov) public key cryptosystem and SKK (Silva-Kschischang-Koetter) codes. Encrypted packets are transmitted to the destination through wired channels. Performance of this system is investigated. The main result is that the proposed scheme is secure against wiretapping and insertion attacks under some conditions which depend on rank code parameters.

AB - We consider a communication network with random network coding which can be attacked by adversaries of two types. One of them can wiretap original packets outgoing from source to destination. The other can insert its own packets into information flow, which are wrong messages for the receiver. To provide secure communication, we use a scheme based on combining the GPT (Gabidulin-Paramonov-Tretjakov) public key cryptosystem and SKK (Silva-Kschischang-Koetter) codes. Encrypted packets are transmitted to the destination through wired channels. Performance of this system is investigated. The main result is that the proposed scheme is secure against wiretapping and insertion attacks under some conditions which depend on rank code parameters.

U2 - 10.1134/S0032946013020075

DO - 10.1134/S0032946013020075

M3 - Journal article

VL - 49

SP - 179

EP - 191

JO - Problems of Information Transmission

JF - Problems of Information Transmission

SN - 0032-9460

IS - 2

ER -