Efficient Schemes for Securing Network Coding Against Wiretapping

Existing solutions for secure network coding either bring significant bandwidth overhead or incur a high computational complexity. For exploiting low-overhead mechanism for secure network coding against wiretapping, three efficient schemes are proposed for the applications with different security re...

Full description

Saved in:
Bibliographic Details
Published inWuhan University journal of natural sciences Vol. 18; no. 4; pp. 355 - 362
Main Authors Liu, Guangjun, Zhou, Hang
Format Journal Article
LanguageEnglish
Published Berlin/Heidelberg Springer Berlin Heidelberg 01.08.2013
Subjects
Online AccessGet full text

Cover

Loading…
More Information
Summary:Existing solutions for secure network coding either bring significant bandwidth overhead or incur a high computational complexity. For exploiting low-overhead mechanism for secure network coding against wiretapping, three efficient schemes are proposed for the applications with different security requirements. The basic idea behind this paper is first to encrypt a small part of source vectors and then subject the remaining original source vectors and the encrypted vectors to a special linear transformation. Also, a lightweight version of this scheme is then presented for resource-constrained networks. Moreover, an extensive scheme with enhanced security is also considered. All proposals are shown to have properties of lower security complexity and smaller bandwidth usage compared with the existing solutions. Also, the proposals can be easy to achieve flexible levels of security for various applications.
Bibliography:Existing solutions for secure network coding either bring significant bandwidth overhead or incur a high computational complexity. For exploiting low-overhead mechanism for secure network coding against wiretapping, three efficient schemes are proposed for the applications with different security requirements. The basic idea behind this paper is first to encrypt a small part of source vectors and then subject the remaining original source vectors and the encrypted vectors to a special linear transformation. Also, a lightweight version of this scheme is then presented for resource-constrained networks. Moreover, an extensive scheme with enhanced security is also considered. All proposals are shown to have properties of lower security complexity and smaller bandwidth usage compared with the existing solutions. Also, the proposals can be easy to achieve flexible levels of security for various applications.
42-1405/N
network coding; security; wiretapping; pseudorandom function; encryption
ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 23
ObjectType-Article-1
ObjectType-Feature-2
ISSN:1007-1202
1993-4998
DOI:10.1007/s11859-013-0942-8