A Generic Secure Transmission Scheme Based on Random Linear Network Coding

Unlike general routing strategies, network coding (NC) can combine encoding functions with multi-path propagation over a network. This allows network capacity to be achieved to support complex security solutions. Moreover, NC has intrinsic security advantages against passive attacks over traditional...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:IEEE/ACM transactions on networking Jg. 30; H. 2; S. 855 - 866
Hauptverfasser: Wu, Renyong, Ma, Jieming, Tang, Zhixiang, Li, Xiehua, Choo, Kim-Kwang Raymond
Format: Journal Article
Sprache:Englisch
Veröffentlicht: New York IEEE 01.04.2022
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Schlagworte:
Codes
Coding
Eavesdropping
eavesdropping attack
Encoding
Generalized inverse
Kernel
Kernels
Mathematical analysis
Matrices (mathematics)
multi-path propagation
Network coding
Nodes
Packets (communication)
random linear network coding
Receivers
Routing
Secure network coding
Security
Unicast
Wiretapping
ISSN:1063-6692, 1558-2566
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:Unlike general routing strategies, network coding (NC) can combine encoding functions with multi-path propagation over a network. This allows network capacity to be achieved to support complex security solutions. Moreover, NC has intrinsic security advantages against passive attacks over traditional routing techniques. However, due to the transmission of the global encoding kernels, the system is fragile to eavesdropping attacks with multiple probes. This paper proposes a generic unicast secure transmission scheme based on random linear network coding (RLNC). Specifically, the intended receiver generates a random matrix upon receiving the request from the source node, and then transmits each row vector of this matrix over a link reversely to the source node. Each intermediate node rearranges all received vectors to form a matrix by row, and then post-multiplies its local encoding kernel by this matrix to obtain a new matrix. Similarly, each row vector of the new matrix is reversely transmitted over a link to the source node. This procedure is performed until we have the source node, where the generalized inverse of the received matrix (or part of it) can be used as its local encoding kernel. Hence, the intended receiver can use the generated matrix (or the corresponding part) to decode the received data packets directly. We also analyze the security to demonstrate that the proposed scheme is at least as secure as other methods against wiretapping attacks. We also evaluate the performance of the proposed scheme to demonstrate its utility.
Bibliographie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:1063-6692
1558-2566
DOI:10.1109/TNET.2021.3124890