Efficient and secure multi-homed systems based on binary random linear network coding

Reem Melki

doi:10.1016/j.compeleceng.2020.106774

Return

Efficient and secure multi-homed systems based on binary random linear network coding

2020-10-01

PRE

Reem Melki *

Hassan Noura

Ali Chehab

DOI：10.1016/j.compeleceng.2020.106774

Original

Original request for help

Save

Abstract

En 中文

Recently, multi-homing has received a lot of interest, since it enables devices which are currently equipped with multiple network interfaces to transmit data over multiple paths, simultaneously. However, with parallel transmission over heterogeneous links, issues and challenges related to security arise. In this paper, we propose a novel channel-based security solution to enhance the security of multi-homed systems. Unlike existing techniques in the literature, the proposed scheme utilizes simple cryptographic operations and Random Linear Network Coding (RNLC), to ensure better robustness against attacks, and improve the performance and reliability of transmitted messages, concurrently. In particular, channel-based parameters are combined with a master secret key, only known to communicating entities, to derive dynamic cipher primitives, which include substitution tables, permutation tables and binary RNLC matrices. The theoretical and experimental results showed that the proposed scheme is secure and efficient compared with many work in this field. (C) 2020 Elsevier Ltd. All rights reserved.

Keywords:

Binary RLNC

Data confidentiality

Source authentication

Invertibility

Dynamic cryptographic algorithms

Multi-homed systems

AI Summary

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