Generating hard instances of lattice problems (extended abstract)
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
A Secure Routing Protocol for Ad Hoc Networks
ICNP '02 Proceedings of the 10th IEEE International Conference on Network Protocols
Coding Constructions for Blacklisting Problems without Computational Assumptions
CRYPTO '99 Proceedings of the 19th Annual International Cryptology Conference on Advances in Cryptology
Network coding for efficient communication in extreme networks
Proceedings of the 2005 ACM SIGCOMM workshop on Delay-tolerant networking
XORs in the air: practical wireless network coding
Proceedings of the 2006 conference on Applications, technologies, architectures, and protocols for computer communications
Trading structure for randomness in wireless opportunistic routing
Proceedings of the 2007 conference on Applications, technologies, architectures, and protocols for computer communications
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
Dice: a game theoretic framework for wireless multipath network coding
Proceedings of the 9th ACM international symposium on Mobile ad hoc networking and computing
Context-based routing: techniques, applications and experience
NSDI'08 Proceedings of the 5th USENIX Symposium on Networked Systems Design and Implementation
Optimized Multipath Network Coding in Lossy Wireless Networks
ICDCS '08 Proceedings of the 2008 The 28th International Conference on Distributed Computing Systems
DCAR: Distributed Coding-Aware Routing in Wireless Networks
ICDCS '08 Proceedings of the 2008 The 28th International Conference on Distributed Computing Systems
Practical defenses against pollution attacks in intra-flow network coding for wireless mesh networks
Proceedings of the second ACM conference on Wireless network security
Signing a Linear Subspace: Signature Schemes for Network Coding
Irvine Proceedings of the 12th International Conference on Practice and Theory in Public Key Cryptography: PKC '09
Homomorphic MACs: MAC-Based Integrity for Network Coding
ACNS '09 Proceedings of the 7th International Conference on Applied Cryptography and Network Security
Nonlinear network coding is necessary to combat general Byzantine attacks
Allerton'09 Proceedings of the 47th annual Allerton conference on Communication, control, and computing
Speeding up homomorpic hashing using GPUs
ICC'09 Proceedings of the 2009 IEEE international conference on Communications
RIPPLE authentication for network coding
INFOCOM'10 Proceedings of the 29th conference on Information communications
IEEE Transactions on Information Theory
IEEE Transactions on Information Theory
A Rank-Metric Approach to Error Control in Random Network Coding
IEEE Transactions on Information Theory
Hi-index | 0.00 |
Numerous practical systems based on network coding have been proposed in recent years demonstrating the wide range of benefits of network coding, such as increased throughput, reliability, and energy efficiency. However, network coding systems are inherently vulnerable to a severe attack, known as packet pollution, which presents a key obstacle to the deployment of such systems. Several cryptographic schemes have been proposed to defend against pollution attacks. We conduct a detailed analysis and an experimental evaluation in a realistic wireless network coding setting of a set of representative cryptographic defenses against pollution attacks. Our analysis identifies severe limitations of asymmetric-based schemes, which impose high communication overhead by placing constraints on the basic network coding parameters and high computation overhead by relying on numerous operations over large fields. Our analysis also shows that symmetric cryptographic schemes, while having better performance than asymmetric cryptographic-based schemes, impose prohibitive overhead in the presence of multiple byzantine adversaries. We further evaluate these schemes by using a set of typical network coding system parameters on a realistic topology. Our experimental evaluation shows that all the schemes we compare induce a throughput degradation that negates the performance benefits of network coding in the presence of multiple colluding adversaries.