.png){kind=icon}
返回
ERSS-RLNC: Efficient and robust secure scheme for random linear network coding
.png){kind=icon}
PRE
AI
DOI：10.1016/j.comnet.2014.09.013.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
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.
Keyword:
Random linear network coding
Authentication and encryption algorithm
Homomorphic encryption
Invertible integer and binary
global encoding matrix
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
4.6
论文数:
1.7K
被引数:
1.6W
机构
引用论文
.png){kind=icon}
分享收藏
查看更多内容