Access the full text.
Sign up today, get DeepDyve free for 14 days.
Loading next page...
/lp/springer_journal/information-security-in-a-random-network-coding-network-5EQfLguF5M
References (15)
-
EM Gabidulin, NI Pilipchuk, M Bossert (2010)
Decoding of Random Network CodesProbl. Peredachi Inf., 46
-
EM Gabidulin, NI Pilipchuk (2008)
Error and Erasure Correcting Algorithms for Rank CodesDes. Codes Cryptogr., 49
-
P Gaborit, O Ruatta, J Schrek (2013)
On the Complexity of the Rank Syndrome Decoding Problem -
AV Ourivski, T Johansson (2002)
New Technique for Decoding Codes in the Rank Metric and Its Cryptography ApplicationsProbl. Peredachi Inf., 38
-
H Rashwan, EM Gabidulin, B Honary (2011)
Security of the GPT Cryptosystems and Its Applications to CryptographySecur. Commun. Netw., 4
-
T Ho, M Médard, R Koetter, DR Karger, M Effros, J Shi, B Leong (2006)
A Random Linear Network Coding Approach to MulticastIEEE Trans. Inform. Theory, 52
-
EM Gabidulin (1992)
Proc. 1st French-Soviet Workshop on Algebraic Coding, Paris, France, 1991 -
T Ho, B Leong, R Koetter, M Médard, M Effros, D Karger (2008)
Byzantine Modification Detection in Multicast Networks with Random Network CodingIEEE Trans. Inform. Theory, 54
-
D Silva, FR Kschischang, R Koetter (2008)
A Rank-Metric Approach to Error Control in Random Network CodingIEEE Trans. Inform. Theory, 54
-
R Ahlswede, N Cai, SR Li, RW Yeung (2000)
Network Information FlowIEEE Trans. Inform. Theory, 47
-
EM Gabidulin, AV Paramonov, OV Tretjakov (1991)
Advances in Cryptology (Proc. EUROCRYPT’91: Workshop on the Theory and Application of Cryptographic Techniques, Brighton, UK, 1991) -
EM Gabidulin, AV Paramonov, OV Tretjakov (1992)
Proc. 4th Int. Colloq. on Coding Theory, Dilijan, Armenia, 1991 -
T Ho, R Koetter, M Médard, DR Karger, M Effros (2003)
Proc. 2003 Int. Sympos. on Information Theory (ISIT’2003), Yokohama, Japan -
EM Gabidulin (1985)
Theory of Codes with Maximum Rank DistanceProbl. Peredachi Inf., 21
-
S Jaggi, M Langberg, S Katti, T Ho, D Katabi, M Médard, M Effros (2008)
Resilient Network Coding in the Presence of Byzantine AdversariesIEEE Trans. Inform. Theory, 54
- Publisher
- Springer Journals
- Copyright
- Copyright © 2013 by Pleiades Publishing, Ltd.
- Subject
- Engineering; Communications Engineering, Networks; Electrical Engineering; Information Storage and Retrieval; Systems Theory, Control
- ISSN
- 0032-9460
- eISSN
- 1608-3253
- DOI
- 10.1134/S0032946013020075
- Publisher site
- See Article on Publisher Site
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.
Journal
Problems of Information Transmission – Springer Journals
Published: Jul 13, 2013