An Improved Polynomial Time Linear Network Coding Algorithm

2012 ◽  
pp. 571-576
Author(s):  
Jie Yang ◽  
Lili Yang
Keyword(s):  
Network Coding ◽  
Polynomial Time ◽  
Linear Network ◽  
Linear Network Coding ◽  
Time Linear

Polynomial-Time Construction of Linear Network Coding

2008 ◽  
pp. 271-282 ◽  
Author(s):  
Kazuo Iwama ◽  
Harumichi Nishimura ◽  
Mike Paterson ◽  
Rudy Raymond ◽  
Shigeru Yamashita
Keyword(s):  
Network Coding ◽  
Polynomial Time ◽  
Linear Network ◽  
Linear Network Coding

Random Linear Network Coding with Probabilistic Polynomial-Time Wiretap Adversary

2014 ◽  
Vol 556-562 ◽  
pp. 6354-6357
Author(s):  
Zhi Wen Hu ◽  
Xian Ming Wang ◽  
Tao Tao Lv ◽  
Shan Shan Zhao ◽  
Rui Jun Jing
Keyword(s):  
Network Coding ◽  
Polynomial Time ◽  
Network Capacity ◽  
Single Source ◽  
Secret Key ◽  
Linear Network ◽  
Pseudorandom Generator ◽  
Linear Network Coding ◽  
Random Linear Network Coding ◽  
Probabilistic Polynomial Time

Linear network coding can achieve the network capacity in the single source multicast case. For the single source multicast network with wiretap adversary, the paper of Cai and Yeung constructs an information-secure linear coding which tightly achieves the transmitting rate upper bound , where is the capacity of the network and is the maximum number of edges the adversary can wiretap. The current paper considers the cryptographic security for the messages in the random linear network coding setting. The indistinguishability under chosen-message-attack (or CMA-Security) from probabilistic polynomial-time (PPT) wiretap adversary is defined. With a pseudorandom generator against linear cryptanalysis, an end-to-end protocol is constructed for multicast network using random linear network coding. When the adversary wiretap less than edges, the protocol is CMA-Secure and attains transmitting rate approaching the network’s capacity from below, asymptotically in the expanding ratio (i.e., length of output string/length of input string) of the pseudorandom generator. Compared with secret-key based scheme, no secret is needed by the receiver nodes, which means the key managing issues for dynamic networks would never come up.

On the Optimal Linear Network Coding Design for Information Theoretically Secure Unicast Streaming

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

scholarly journals Semantically Secure Symmetric Encryption with Error Correction for Distributed Storage

2017 ◽  
Vol 2017 ◽  
pp. 1-10
Author(s):  
Juha Partala
Keyword(s):  
Error Correction ◽  
Network Coding ◽  
Linear Combination ◽  
Distributed Storage ◽  
Homomorphic Encryption ◽  
Error Correcting Codes ◽  
Symmetric Encryption ◽  
Goppa Codes ◽  
Linear Network ◽  
Linear Network Coding

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.

scholarly journals Exact Decoding Probability Under Random Linear Network Coding

2011 ◽  
Vol 15 (1) ◽  
pp. 67-69 ◽  
Author(s):  
Oscar Trullols-Cruces ◽  
Jose M. Barcelo-Ordinas ◽  
Marco Fiore
Keyword(s):  
Network Coding ◽  
Linear Network ◽  
Linear Network Coding ◽  
Random Linear Network Coding
Sign in / Sign up

Export Citation Format

Share Document