2 research outputs found
Communication Overhead of Network Coding Schemes Secure against Pollution Attacks
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 report 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
Insecure ``Provably Secure Network Coding\u27\u27 and Homomorphic Authentication Schemes for Network Coding
Network coding allows the routers to mix the received information
before forwarding them to the next nodes. Though this information mixing
has been proven to maximize network throughput, it also introduces
security challenges such as pollution attacks.
A malicious node could insert a malicious packet
into the system and this corrupted
packet will propagate more quickly than in traditional copy-and-forward
networks. Several authors have studied secure network coding from both
information theoretic and probabilistic viewpoints. In this paper,
we show that there are serious flaws in several of these schemes
(the security ``proofs\u27\u27 for these schemes
were presented in these publications). Furthermore, we will propose a secure
homomorphic authentication scheme for network coding