ERSS-RLNC: Efficient and robust secure scheme for random linear network coding

Random Linear Network Coding (RLNC) is a promising technology of Network Coding (NC) that has been proved to be both sufficient and efficient. To enable the deployment of RLNC in real networks, this paper first introduces a new efficient and flexible authentication–encryption scheme that is immune t...

Full description

Saved in:
Bibliographic Details
Published in:Computer networks (Amsterdam, Netherlands : 1999) Vol. 75; no. Part A; pp. 99 - 112
Main Authors: Noura, Hassan, Martin, Steven, Al Agha, Khaldoun, Chahine, Khaled
Format: Journal Article
Language:English
Published: Kidlington Elsevier B.V 24.12.2014
Elsevier
Elsevier Sequoia S.A
Subjects:
Access methods and protocols, osi model
Applied sciences
Authentication and encryption algorithm
Authenticity
Battery
Coding
Coding theory
Coding, codes
Communications networks
Computation
Computer networks
Computer Science
Confidentiality
Cryptography
Cybersecurity
Data encryption
Deployment
Dynamics
Eavesdropping
Encoding
Energy consumption
Exact sciences and technology
Homomorphic encryption
Information, signal and communications theory
Integers
Invertible integer and binary global encoding matrix
Low energy
Mathematical programming
Mobile phones
Morality
Networks
Radiocommunications
Random linear network coding
Regression analysis
Robustness
Signal and communications theory
Studies
Telecommunications
Telecommunications and information theory
Teleprocessing networks. Isdn
Random linear network coding
Homomorphic encryption
Invertible integer and binary global encoding matrix
Authentication and encryption algorithm
Galois algebra
Byzantine behavior
Inversion
Dynamic properties
Random coding
Eavesdropping
Linear coding
Zero one matrix
Robustness
Arithmetic unit
Computer attack
Lattice-Based Cryptography
Statistical analysis
Computational complexity
Integer matrix
Experimental result
Data integrity
Confidentiality
Storage management
Authentication
Network protocol
Network coding
Wireless network
Transmission rate
Assembler
ISSN:1389-1286, 1872-7069
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Random Linear Network Coding (RLNC) is a promising technology of Network Coding (NC) that has been proved to be both sufficient and efficient. To enable the deployment of RLNC in real networks, this paper first introduces a new efficient and flexible authentication–encryption scheme that is immune to Byzantine and eavesdropping attacks. The proposed scheme achieves simultaneously information confidentiality, packet integrity and source authentication with minimum computational complexity and memory consumption. It also presents a new technique for constructing an integer Global Encoding Matrix (GEM) that satisfies the inversion property in a dynamic manner. In addition, the proposed scheme uses dynamic keys to ensure robustness against attacks. Secondly, an efficient implementation of Binary RLNC, suitable for battery constrained mobile devices with low computational capabilities such as mobile phones and sensors, is defined. The effectiveness of the coding process is proved by modifying the Galois field of calculation from integer (int8, int16) to binary. Not only does this ensure low computational requirements, high throughput and low energy consumption, but also reduces the statistical characteristics of the coding process. The obtained theoretical and experimental results show that the new scheme is secure and efficient compared with many recent works in this field.
Bibliography:SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ObjectType-Article-1
ObjectType-Feature-2
content type line 23
ISSN:1389-1286
1872-7069
DOI:10.1016/j.comnet.2014.09.013