On the Practical and Security Issues of Batch Content Distribution Via Network Coding
ICNP '06 Proceedings of the Proceedings of the 2006 IEEE International Conference on Network Protocols
On large-scale peer-to-peer streaming systems with network coding
MM '08 Proceedings of the 16th ACM international conference on Multimedia
Defending against Sybil nodes in BitTorrent
NETWORKING'11 Proceedings of the 10th international IFIP TC 6 conference on Networking - Volume Part II
Challenging the feasibility of authentication mechanisms for P2P live streaming
Proceedings of the 6th Latin America Networking Conference
Cooperatively securing network coding against pollution attacks with incentive mechanism
Proceedings of the 6th International Conference on Ubiquitous Information Management and Communication
| Hi-index | 0.00 |
Network coding has been shown to be capable of greatly improving quality of service in P2P live streaming systems (e.g., IPTV). However, network coding is vulnerable to pollution attacks where malicious nodes inject into the network bogus data blocks that are combined with other legitimate blocks at downstream nodes, leading to incapability of decoding the original blocks and substantial degradation of network performance. In this paper, we propose a novel approach to limiting pollution attacks by rapidly identifying malicious nodes. Our scheme can fully satisfy the requirements of live streaming systems, and achieves much higher efficiency than previous schemes. Each node in our scheme only needs to perform several hash computations for an incoming block, incurring very small computational latency. The space overhead added to each block is only 20 bytes. The verification information given to each node is independent of the streaming content and thus does not need to be redistributed. The simulation results based on real PPLive channel overlays show that the process of identifying malicious nodes only takes a few seconds even in the presence of a large number of malicious nodes.