Optimal Design of Linear Network Coding for information theoretically secure unicast

2011 ◽  
Author(s):  
Jin Wang ◽  
Jianping Wang ◽  
Kejie Lu ◽  
Yi Qian ◽  
Bin Xiao ◽  
...  
Keyword(s):  
Optimal Design ◽  
Network Coding ◽  
Linear Network ◽  
Linear Network Coding

Modeling and Optimal Design of Linear Network Coding for Secure Unicast with Multiple Streams

2013 ◽  
Vol 24 (10) ◽  
pp. 2025-2035 ◽  
Author(s):  
Jin Wang ◽  
Jianping Wang ◽  
Kejie Lu ◽  
Bin Xiao ◽  
Naijie Gu
Keyword(s):  
Optimal Design ◽  
Network Coding ◽  
Multiple Streams ◽  
Linear Network ◽  
Linear Network Coding

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