Preventing Pollution Attacks in Multi-source Network Coding

被引:0
作者
Agrawal, Shweta [1 ]
Boneh, Dan [2 ]
Boyen, Xavier [3 ]
Freeman, David Mandell [2 ]
机构
[1] Univ Texas Austin, Austin, TX 78712 USA
[2] Stanford Univ, Stanford, CA 94305 USA
[3] Univ Liege, B-4000 Liege, Belgium
来源
PUBLIC KEY CRYPTOGRAPHY - PKC 2010, PROCEEDINGS | 2010年 / 6056卷
关键词
D O I
暂无
中图分类号
TP31 [计算机软件];
学科分类号
081202 ; 0835 ;
摘要
Network coding is a method for achieving channel capacity in networks. The key idea is to allow network routers to linearly mix packets as they traverse the network so that recipients receive linear combinations of packets. Network coded systems are vulnerable to pollution attacks where a single malicious node floods the network with bad packets and prevents the receiver from decoding correctly. Cryptographic defenses to these problems are based on homomorphic signatures and MACs. These proposals, however, cannot handle mixing of packets from multiple sources, which is needed to achieve the full benefits of network coding. In this paper we address integrity of multi-source mixing. We propose a security model for this setting and provide a generic construction.
引用
收藏
页码:161 / +
页数:3
相关论文
共 19 条
[11]   Network coding: An instant primer [J].
Fragouli, C ;
Le Boudec, JY ;
Widmer, J .
ACM SIGCOMM COMPUTER COMMUNICATION REVIEW, 2006, 36 (01) :63-68
[12]  
Fragouli C., 2007, NETWORK CODING FUNDA
[13]  
HAN K, 2007, MIL COMM C MILC
[14]   Resilient network coding in the presence of Byzantine adversaries [J].
Jaggi, Sidharth ;
Langberg, Michael ;
Katti, Sachin ;
Ho, Tracey ;
Katabi, Dina ;
Medard, Muriel ;
Effros, Michelle .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2008, 54 (06) :2596-2603
[15]   XORs in the air:: Practical wireless network coding [J].
Katti, Sachin ;
Rahul, Hariharan ;
Hu, Wenjun ;
Katabi, Dina ;
Medard, Muriel ;
Crowcroft, Jon .
IEEE-ACM TRANSACTIONS ON NETWORKING, 2008, 16 (03) :497-510
[16]   An algebraic approach to network coding [J].
Koetter, R ;
Médard, M .
IEEE-ACM TRANSACTIONS ON NETWORKING, 2003, 11 (05) :782-795
[17]  
Krohn MN, 2004, P IEEE S SECUR PRIV, P226
[18]  
LI Y, 2010, IEEE INFOCO IN PRESS
[19]  
Servedio R. A., 2004, P 42 ANN ALL C COMM