Network coding: an instant primer
ACM SIGCOMM Computer Communication Review
Information Theory and Network Coding
Information Theory and Network Coding
Practical defenses against pollution attacks in intra-flow network coding for wireless mesh networks
Proceedings of the second ACM conference on Wireless network security
Network Coding Fundamentals
Secure network coding for wireless mesh networks: Threats, challenges, and directions
Computer Communications
Secure network coding over the integers
PKC'10 Proceedings of the 13th international conference on Practice and Theory in Public Key Cryptography
IEEE Transactions on Information Theory
Byzantine Modification Detection in Multicast Networks With Random Network Coding
IEEE Transactions on Information Theory
Hi-index | 0.00 |
Network coding is a promising approach for increasing performance of multicast data transmission and reducing energy costs. Of course, it is essential to consider security aspects to ensure a reliable data transmission. Particularly, pollution attacks may have serious impacts in network coding since a single attacker can jam large parts of the network. Therefore, various approaches have been introduced to secure network coding against this type of attack. However, introducing security increases costs. Even though there are some performance analysis of secure schemes, to our knowledge there are no details whether these schemes are worthwhile to replace routing under the facet of efficiency. Thus, we discuss in this paper parameters to assess the efficiency of secure network coding schemes. Using three network graphs, we evaluate parameters focusing on communication overhead for selected schemes. Our results show that there are still benefits in comparison to routing depending on the network topology.