Information security in a random network coding network

Authors:
E. M. Gabidulin;N. I. Pilipchuk;B. Honary;H. Rashwan
Affiliations:
Moscow Institute of Physics and Technology (State University), Moscow, Russia;Moscow Institute of Physics and Technology (State University), Moscow, Russia;Lancaster University, Lancaster, UK;Lancaster University, Lancaster, UK
Venue:
Problems of Information Transmission
Year:
2013

Citing 13
Cited 0

New Technique for Decoding Codes in the Rank Metric and Its Cryptography Applications

Problems of Information Transmission
A Fast Matrix Decoding Algorithm for Rank-Error-Correcting Codes

Proceedings of the First French-Soviet Workshop on Algebraic Coding
Error and erasure correcting algorithms for rank codes

Designs, Codes and Cryptography
Fast encoding and decoding of Gabidulin codes

ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 4
On improving security of GPT cryptosystems

ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 2
Ideals over a non-commutative ring and their application in cryptology

EUROCRYPT'91 Proceedings of the 10th annual international conference on Theory and application of cryptographic techniques
Decoding of random network codes

Problems of Information Transmission
Security Random Network Coding Model against Byzantine Attack Based on CBC

ICICTA '11 Proceedings of the 2011 Fourth International Conference on Intelligent Computation Technology and Automation - Volume 02
Network information flow

IEEE Transactions on Information Theory
A Random Linear Network Coding Approach to Multicast

IEEE Transactions on Information Theory
Byzantine Modification Detection in Multicast Networks With Random Network Coding

IEEE Transactions on Information Theory
Resilient Network Coding in the Presence of Byzantine Adversaries

IEEE Transactions on Information Theory
A Rank-Metric Approach to Error Control in Random Network Coding

IEEE Transactions on Information Theory

Quantified Score

Hi-index	0.00

Visualization

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.