[Resource Topic] 2009/504: Insecure ``Provable Secure Network Coding''

Welcome to the resource topic for 2009/504

Title:
Insecure ``Provable Secure Network Coding’’

Authors: Yongge Wang

Abstract:

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’’ for these schemes were presented in these publications).

ePrint: https://eprint.iacr.org/2009/504

See all topics related to this paper.

Feel free to post resources that are related to this paper below.

Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.

For more information, see the rules for Resource Topics .