A Hypergraph Approach to Linear Network Coding in Multicast Networks

2010 ◽  
Vol 21 (7) ◽  
pp. 968-982 ◽  
Author(s):  
Min Yang ◽  
Yuanyuan Yang
Author(s):  
Kishore kumar R ◽  
S Nayana

Privacy threat is a very serious issue in multi-hop wireless networks (MWNs) since open wireless channels are vulnerable to malicious attacks. A distributed random linear network coding approach for transmission and compression of information in general multisource multicast networks. Network nodes independently and randomly select linear mappings from inputs onto output links over some field. Network coding has the potential to thwart traffic analysis attacks since the coding/mixing operation is encouraged at intermediate nodes. However, the simple deployment of network coding cannot achieve the goal once enough packets are collected by the adversaries. This paper proposes non-binary joint network-channel coding for reliable communication in wireless networks. NB-JNCC seamlessly combines non-binary channel coding and random linear network coding, and uses an iterative two-tier coding scheme that we proposed to jointly exploit redundancy inside packets and across packets for error recovery.


2016 ◽  
Vol 18 (6) ◽  
pp. 1149-1162 ◽  
Author(s):  
Jin Wang ◽  
Jianping Wang ◽  
Kejie Lu ◽  
Yi Qian ◽  
Naijie Gu

2017 ◽  
Vol 2017 ◽  
pp. 1-10
Author(s):  
Juha Partala

A distributed storage system (DSS) is a fundamental building block in many distributed applications. It applies linear network coding to achieve an optimal tradeoff between storage and repair bandwidth when node failures occur. Additively homomorphic encryption is compatible with linear network coding. The homomorphic property ensures that a linear combination of ciphertext messages decrypts to the same linear combination of the corresponding plaintext messages. In this paper, we construct a linearly homomorphic symmetric encryption scheme that is designed for a DSS. Our proposal provides simultaneous encryption and error correction by applying linear error correcting codes. We show its IND-CPA security for a limited number of messages based on binary Goppa codes and the following assumption: when dividing a scrambled generator matrix G^ into two parts G1^ and G2^, it is infeasible to distinguish G2^ from random and to find a statistical connection between G1^ and G2^. Our infeasibility assumptions are closely related to those underlying the McEliece public key cryptosystem but are considerably weaker. We believe that the proposed problem has independent cryptographic interest.


2011 ◽  
Vol 15 (1) ◽  
pp. 67-69 ◽  
Author(s):  
Oscar Trullols-Cruces ◽  
Jose M. Barcelo-Ordinas ◽  
Marco Fiore

2013 ◽  
Vol 24 (10) ◽  
pp. 2025-2035 ◽  
Author(s):  
Jin Wang ◽  
Jianping Wang ◽  
Kejie Lu ◽  
Bin Xiao ◽  
Naijie Gu

Sign in / Sign up

Export Citation Format

Share Document