arrow
Return

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

delete2014-12-01
delete19
PRE
AI
H
Hassan Noura *
M
Martin, Steven
A
Al Agha, Khaldoun
K
Khaled Chahine
DOI:10.1016/j.comnet.2014.09.013delete
deleteOriginal
deleteOriginal request for help
deleteShare
deleteSave
Abstract

Abstract

En 中文
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. (C) 2014 Elsevier B.V. All rights reserved.
Keywords:
Random linear network coding
Authentication and encryption algorithm
Homomorphic encryption
Invertible integer and binary
global encoding matrix
AI Summary

AI Summary

Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.

Journal

Computer Networks cover
Computer Networks
IF:
4.6
Papers:
1.7K
Citations:
1.6W

Organization

C
centre national de la recherche scientifique (cnrs)
Scholars:
24.5W
Papers: 18.2W
Citations: 279
U
Universite Paris Saclay
Scholars:
7.3W
Papers: 5.3W
Citations: 540
Cited Papers

Cited Papers

Division Mental Health in the New Brigade Combat Team Structure: Part I. Predeployment and Deployment
err2007-09-01
err0
errOAAI
errChristopher H. Warner; Jill E. Breitbach; George N. Appenzeller; Virginia Yates; Thomas Grieger; William G. Webster
errShare
errSave
errShare
errSave
A kinetic investigation of gibbsite precipitation using in situ time resolved energy dispersive X-ray diffraction
err2000-01-01
err0
PREAI
errJoanne S. C. Loh; Andrew M. Fogg; Helen R. Watling; Gordon M. Parkinson; Dermot O'Hare
errShare
errSave
Novel apparatus for the in situ study of hydrothermal crystallizations using time-resolved neutron diffraction
err1999-08-01
err0
PREAI
errRichard I. Walton; Robin J. Francis; P. Shiv Halasyamani; Dermot O’ Hare; Ronald I. Smith; Robert Done; Robin J. Humphreys
errShare
errSave
Pressure-crystallized piezopolymer/ionomer/graphene quantum dot composites: A novel poling-free dynamic hybrid electret with enhanced energy harvesting properties
err2018-08-01
err0
PREAI
errChenwen Xu; Long Jin; Lei Zhang; Chuanfeng Wang; Xi Huang; Xuebing He; Yali Xu; Rui Huang; Chaoliang Zhang; Weiqing Yang; Jun Lu
errShare
errSave
Rhythms of the Brain
err
IF0
err2006-10-26
err0
PREAI
errGyörgy Buzsáki
errShare
errSave
errShare
errSave
researcher View more