Practical defenses against pollution attacks in intra-flow network coding for wireless mesh networks
Proceedings of the second ACM conference on Wireless network security
Practical Random Linear Network Coding on GPUs
NETWORKING '09 Proceedings of the 8th International IFIP-TC 6 Networking Conference
Secure network coding for wireless mesh networks: Threats, challenges, and directions
Computer Communications
A self-adaptive probabilistic packet filtering scheme against entropy attacks in network coding
Computer Networks: The International Journal of Computer and Telecommunications Networking
Speeding up homomorpic hashing using GPUs
ICC'09 Proceedings of the 2009 IEEE international conference on Communications
MIS: malicious nodes identification scheme in network-coding-based peer-to-peer streaming
INFOCOM'10 Proceedings of the 29th conference on Information communications
INFOCOM'10 Proceedings of the 29th conference on Information communications
Practical defenses against pollution attacks in wireless network coding
ACM Transactions on Information and System Security (TISSEC)
Entropy attacks and countermeasures in wireless network coding
Proceedings of the fifth ACM conference on Security and Privacy in Wireless and Mobile Networks
Tsunami: massively parallel homomorphic hashing on many-core GPUs
Concurrency and Computation: Practice & Experience
On the practicality of cryptographic defences against pollution attacks in wireless network coding
ACM Computing Surveys (CSUR)
| Hi-index | 0.00 |
File distribution via network coding has received a lot of attention lately. However, direct application of network codingmay have security problems. In particular, attackers can inject "faked" packets into the file distribution process to slowdown the information dispersal or even deplete the network resource. Therefore, content verification is an important and practicalissue when network coding is employed. When network coding is used, it is infeasible for the source of the content to provideall the hash values or signatures required for verification, and hence the traditional "hash-and-sign" methods are no longerapplicable. Recently, a new on-the-fly verification technique is proposed by Krohn et al. for rateless erasure codes [1].However, their scheme requires a large number of hash values to be distributed in advance, and all of them are needed to verifyeven for a single packet. We propose a new batch delivery and verification scheme that is similar to the classical scenariowhere the authentication information of a message is embedded with the message and is sufficient for the verification purpose.We investigate how our technique can be applied when random linear network coding is employed, and show that both the computationaland the bandwidth overhead can be greatly reduced by using a variant of the random network coding. We further show by simulationthat this variant is sufficiently effective in practice.