Efficiency of rateless secure network coding

被引:1
作者
Franz, Elke [1 ]
Pfennig, Stefan [1 ]
Reiher, Tobias [1 ]
机构
[1] Tech Univ Dresden, Fac Comp Sci, D-01062 Dresden, Germany
来源
CONFERENCE ON ELECTRONICS, TELECOMMUNICATIONS AND COMPUTERS - CETC 2013 | 2014年 / 17卷
关键词
Network coding; efficiency; security; pollution attacks;
D O I
10.1016/j.protcy.2014.10.224
中图分类号
TP39 [计算机的应用];
学科分类号
081203 ; 0835 ;
摘要
Network coding allows to increase the throughput as well as the robustness of data transmissions. Regarding robustness, especially rateless network coding was shown to be beneficial. However, the vulnerability of mere network coding against attacks requires introducing security mechanisms, and as known, security implies costs. Within this paper, we evaluate the efficiency of secure network coding schemes applied in a rateless manner. Our results show that secure rateless network coding schemes can still outperform routing. The actual efficiency depends on parameters like generation size, packet size, or network topology. Since conflicting efficiency parameters cannot be fulfilled in equal measure, selection of a secure network coding scheme and its parameters should be done adapted to the actual communication requirements. (C) 2014 The Authors. Published by Elsevier Ltd. This is an open access article under the CC BY-NC-ND license (http://creativecommons.org/licenses/by-nc-nd/3.0/).
引用
收藏
页码:162 / 169
页数:8
相关论文
共 18 条
[1]   Network information flow [J].
Ahlswede, R ;
Cai, N ;
Li, SYR ;
Yeung, RW .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2000, 46 (04) :1204-1216
[2]  
Allman M., 1999, IETF RFC 2581
[3]  
[Anonymous], NTL LIB DOING NUMBER
[4]  
[Anonymous], PBC PAIRING BASED CR
[5]  
[Anonymous], IEEE INT S INF THEOR
[6]  
[Anonymous], INSECURE PROVABLY SE
[7]  
[Anonymous], 2003, P ANN ALL C COMM CON
[8]  
Barker E., 2011, NIST SPECIAL PUBLICA, V3, P1
[9]  
Catalano D, 2012, LECT NOTES COMPUT SC, V7293, P680, DOI 10.1007/978-3-642-30057-8_40
[10]  
Chachulski S., 2007, P SIGCOMM