TESLA-Based Defense Against Pollution Attacks in P2P Systems with Network Coding
Pollution attacks are well-known to have detrimental effect on intra-session network coding in general, and in peer-topeer (P2P) systems with network coding in particular. Previously proposed defense mechanisms against pollution attacks in intrasession network coding face various challenges that make them illsuited for P2P systems: they are either computationally expensive, not collusion resistant, or work only on fixed, known topologies. In this work, we propose a novel, complete defense system for network coding-based P2P systems that can (i) quickly detect corrupted blocks, (Ⅱ) precisely identify the attackers, thereby eliminating them from the network, (iii) resist arbitrary collusion, and (iv) work with unknown, dynamic topologies, as it is the case in P2P systems. Our scheme uses and builds on two key ingredients: homomorphic message authentication codes and time asymmetry (as in TESLA 1) to provide source authentication for the detection scheme and non-repudiation for the identification scheme. Our mechanisms introduce significantly less communication and computation overhead than other comparable state-ofthe-art schemes for P2P systems. Using implementation in both C/C++and Java, on both a PC and an Android device, we show that the computational delay per block at each peer is as low as 600 microseconds and the bandwidth overhead is as low as 1.3%.
Anh Le Athina Markopoulou
University of California, Irvine
国际会议
2011 International Symposium on Network Coding(2011网络编码国际会议 NETCOD 2011)
北京
英文
1-7
2011-07-25（万方平台首次上网日期，不代表论文的发表时间）