.png){kind=icon}
.png){kind=icon}
Return
Low-Complexity Secure Network Coding Against Wiretapping Using Intra/Inter-generation Coding
.png){kind=icon}
PRE
AI
DOI：10.1109/CC.2015.7122470.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Existing solutions against wiretapping attacks for network coding either bring significant bandwidth overhead or incur a high computational complexity. In order to reduce the security overhead of the existing solutions for securing network coding, a novel securing network coding paradigm is presented relying on two coding models: intra-generation coding and inter-generation coding. The basic idea to secure network coding using intra-generation coding is to limit the encryption operations for each generation, and then subject the scrambled and the remaining original source vectors to a linear transformation. This method is then generalized seamlessly using inter-generation coding by further exploiting the algebraic structure of network coding. We show that the proposed schemes have properties of low-complexity security, little bandwidth consumption, and high efficiency in integrating with the existing security techniques effectively.
Keywords:
network coding
security
wiretapping attacks
algebraic coding
encryption
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.