Cryptology ePrint Archive: Report 2009/504
Insecure ``Provable Secure Network Coding''
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).
Category / Keywords: public-key cryptography /
Publication Info: submitted to some journals
Date: received 18 Oct 2009
Contact author: yonwang at uncc edu
Available format(s): PDF | BibTeX Citation
Version: 20091020:114723 (All versions of this report)
Short URL: ia.cr/2009/504
Discussion forum: Show discussion | Start new discussion
[ Cryptology ePrint archive ]