• Corpus ID: 14110644

Insecure "Provably Secure Network Coding" and Homomorphic Authentication Schemes for Network Coding

  title={Insecure "Provably Secure Network Coding" and Homomorphic Authentication Schemes for Network Coding},
  author={Yongge Wang},
  journal={IACR Cryptol. ePrint Arch.},
  • Yongge Wang
  • Published 2010
  • Computer Science
  • IACR Cryptol. ePrint Arch.
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… 

Figures from this paper

Efficient Post-Quantum Secure Network Coding Signatures in the Standard Model

An efficient network coding signature scheme in the standard model using lattice theory, which can be viewed as the most promising tool for designing post-quantum cryptographic protocols, and a new method for generating a random lattice and the corresponding trapdoor, which may be used in other cryptographic protocols.

Efficiency of Rateless Secure Network Coding

Secure network coding: Dependency of efficiency on network topology

It is illustrated that there does not exist “the best” secure network scheme concerning efficiency, but all selected schemes are more or less suited under certain network topologies.

Secure network coding against intra/inter-generation pollution attacks

A novel homomorphic signature scheme for network coding for each generation authentication without updating the initial secret key used is proposed, which not only can resist intra-generation pollution attacks effectively but also can efficiently prevent inter- generation pollution attacks.

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

Efficiency of Secure Network Coding Schemes

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

A Homomorphic Network Coding Signature Scheme for Multiple Sources and its Application in IoT

This paper study the problem of designing secure network coding signatures in the network with multiple sources and propose the multisource homomorphic network coding signature, which is given construction and proved its security.

An Approach of Anti-Eavesdropping Linear Network Coding in Wireless Network

This work proposes a novel secure linear network coding scheme that is based on IBC(Identity-Based Cryptography) algorithm and has the characteristic of preventing eavesdropping and pollution attacks and guarantees the data security for each node.

Comparison of different secure network coding paradigms concerning transmission efficiency

  • Stefan PfennigElke Franz
  • Computer Science
    2013 IEEE 18th International Workshop on Computer Aided Modeling and Design of Communication Links and Networks (CAMAD)
  • 2013
This paper compared both paradigms concerning efficiency of data transmission under various circumstances and considered an attacker of a certain strength as well as the influence of the generation size for network coding taking into account both security against pollution attacks and efficiency.

On the Integrity of Network Coding-Based Anonymous P2P File Sharing Networks

This paper presents an integrity strategy for network coding-based P2P anonymous systems, specifically designed to preserve the anonymity of peers, which is significantly easier to implement than current solutions when anonymity is required.



Secure Network Coding Over the Integers

A homomorphic hashing scheme that is more efficient than existing schemes, and which leads to network coding signatures based on the hardness of factoring (in the standard model), and variants of existing schemes that reduce the communication overhead for moderate-size networks, and improve computational efficiency.

RIPPLE Authentication for Network Coding

This work is the first symmetric key based solution to allow arbitrary collusion among adversaries, and also the first to consider {\em tag pollution attacks}, where a single corrupted MAC tag can cause numerous packets to fail authentication farther down the stream, effectively emulating a successful pollution attack.

Homomorphic MACs: MAC-Based Integrity for Network Coding

The homomorphic MAC is designed as a drop-in replacement for traditional MACs (such as HMAC) in systems using network coding, which allows checking the integrity of network coded data.

An Authentication Code Against Pollution Attacks in Network Coding

An unconditionally secure authentication code suitable for multicast network coding, where the keying material is initially computed and distributed by a trusted authority to the destinations and intermediate nodes and shows that the price to pay for tolerating inside attackers is a high decrease in throughput.

Signing a Linear Subspace: Signature Schemes for Network Coding

This work proposes two signature schemes that can be used in conjunction with network coding to prevent malicious modification of data and proves a lower bound on the length of signatures for linear subspaces showing that these schemes are essentially optimal in this regard.

Cooperative Security for Network Coding File Distribution

  • C. GkantsidisP. Rodriguez
  • Computer Science
    Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications
  • 2006
This paper presents a practical security scheme for network coding that reduces the cost of verifying blocks on-the-fly while efficiently preventing the propagation of malicious blocks, and analyzes and study such cooperative security scheme and introduces elegant techniques to prevent DoS attacks.

Secure network coding

  • N. CaiR. Yeung
  • Computer Science
    Proceedings IEEE International Symposium on Information Theory,
  • 2002
This paper proposes a new model which incorporates network coding and information security, and presents a construction of secure linear network codes provided a certain graph-theoretic sufficient condition is satisfied.

Weakly Secure Network Coding

This work shows that under the new security requirements communication is possible at the multicast capacity and if random coding scheme is used the probability of the system being secure can be made arbitrarily close to one by coding over a large enough field.

Secure network coding for wireless mesh networks: Threats, challenges, and directions

Signatures for Content Distribution with Network Coding

This paper proposes a signature scheme for network coding that makes use of the linearity property of the packets in a coded system, and allows nodes to check the integrity of the packet received easily, and shows that the proposed scheme is secure, and its overhead is negligible for large files.