Byzantine attacks against network coding in peer to peer distributed storage

2009 ◽  
Author(s):  
Luisa Lima ◽  
Joao Barros ◽  
Ralf Koetter
Keyword(s):  
Network Coding ◽  
Distributed Storage ◽  
Peer To Peer ◽  
Byzantine Attacks

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.

AN EXPLORATION OF NON-ASYMPTOTIC LOW-DENSITY, PARITY CHECK ERASURE CODES FOR WIDE-AREA STORAGE APPLICATIONS

2007 ◽  
Vol 17 (01) ◽  
pp. 103-123 ◽  
Author(s):  
JAMES S. PLANK ◽  
MICHAEL G. THOMASON
Keyword(s):  
Storage Systems ◽  
Distributed Storage ◽  
Ldpc Codes ◽  
Peer To Peer ◽  
Erasure Codes ◽  
Low Density ◽  
Parity Check ◽  
Finite Systems ◽  
Low Density Parity Check ◽  
Distributed Storage Systems

As peer-to-peer and widely distributed storage systems proliferate, the need to perform efficient erasure coding, instead of replication, is crucial to performance and efficiency. Low-Density Parity-Check (LDPC) codes have arisen as alternatives to standard erasure codes, such as Reed-Solomon codes, trading off vastly improved decoding performance for inefficiencies in the amount of data that must be acquired to perform decoding. The scores of papers written on LDPC codes typically analyze their collective and asymptotic behavior. Unfortunately, their practical application requires the generation and analysis of individual codes for finite systems. This paper attempts to illuminate the practical considerations of LDPC codes for peer-to-peer and distributed storage systems. The three main types of LDPC codes are detailed, and a huge variety of codes are generated, then analyzed using simulation. This analysis focuses on the performance of individual codes for finite systems, and addresses several important heretofore unanswered questions about employing LDPC codes in real-world systems.

scholarly journals Super Generation Network Coding for Peer-to-Peer Content Distribution Networks

IEEE Access ◽  
2020 ◽  
Vol 8 ◽  
pp. 195240-195252
Author(s):  
Anas Ahmad Abudaqa ◽  
Ashraf Mahmoud ◽  
Marwan Abu-Amara ◽  
Tarek R. Sheltami
Keyword(s):  
Network Coding ◽  
Content Distribution ◽  
Distribution Networks ◽  
Peer To Peer ◽  
Content Distribution Networks ◽  
Generation Network
Sign in / Sign up

Export Citation Format

Share Document