Zobrazit v EDS

On the robustness of three classes of rateless codes against pollution attacks in P2P networks

Uloženo v:
Podrobná bibliografie
Název: On the robustness of three classes of rateless codes against pollution attacks in P2P networks
Autoři: Gaeta, Rossano, Grangetto, Marco
Přispěvatelé: Gaeta, Rossano, Grangetto, Marco
Rok vydání: 2021
Sbírka: Università degli studi di Torino: AperTo (Archivio Istituzionale ad Accesso Aperto)
Témata: Rateless code, Random linear code, LT code, Band code, Data modification attack, Pollution attack
Popis: Rateless codes (a.k.a. fountain codes, digital fountain) have found their way in numerous peer-to-peer based applications although their robustness to the so called pollution attack has not been deeply investigated because they have been originally devised as a solution for dealing with block erasures and not for block modification. In this paper we provide an analysis of the intrinsic robustness of three rateless codes algorithms, i.e., random linear network codes (RLNC), Luby transform (LT), and band codes (BC) against intentional data modification. By intrinsic robustness we mean the ability of detecting as soon as possible that modification of at least one equation has occurred as well as the possibility a receiver can decode from the set of equations with and without the modified ones. We focus on bare rateless codes where no additional information is added to equations (e.g., tags) or higher level protocol are used (e.g., verification keys to pre-distribute to receivers) to detect and recover from data modification. We consider several scenarios that combine both random and targeted selection of equations to alter and modification of an equation that can either change the rank of the coding matrix or not. Our analysis reveals that a high percentage of attacks goes undetected unless a minimum code redundancy is achieved, LT codes are the most fragile in virtually all scenarios, RLNC and BC are quite insensitive to the victim selection and type of alteration of chosen equations and exhibit virtually identical robustness although BC offer a low complexity of the decoding algorithm.
Druh dokumentu: article in journal/newspaper
Jazyk: English
Relation: info:eu-repo/semantics/altIdentifier/wos/WOS:000665693700001; volume:14; issue:6; firstpage:3595; lastpage:3604; numberofpages:10; journal:PEER-TO-PEER NETWORKING AND APPLICATIONS; https://hdl.handle.net/2318/1811400; info:eu-repo/semantics/altIdentifier/scopus/2-s2.0-85117630034
DOI: 10.1007/s12083-021-01206-2
Dostupnost: https://hdl.handle.net/2318/1811400
https://doi.org/10.1007/s12083-021-01206-2
Rights: info:eu-repo/semantics/openAccess
Přístupové číslo: edsbas.E62018F6
Databáze: BASE
Popis
Abstrakt:Rateless codes (a.k.a. fountain codes, digital fountain) have found their way in numerous peer-to-peer based applications although their robustness to the so called pollution attack has not been deeply investigated because they have been originally devised as a solution for dealing with block erasures and not for block modification. In this paper we provide an analysis of the intrinsic robustness of three rateless codes algorithms, i.e., random linear network codes (RLNC), Luby transform (LT), and band codes (BC) against intentional data modification. By intrinsic robustness we mean the ability of detecting as soon as possible that modification of at least one equation has occurred as well as the possibility a receiver can decode from the set of equations with and without the modified ones. We focus on bare rateless codes where no additional information is added to equations (e.g., tags) or higher level protocol are used (e.g., verification keys to pre-distribute to receivers) to detect and recover from data modification. We consider several scenarios that combine both random and targeted selection of equations to alter and modification of an equation that can either change the rank of the coding matrix or not. Our analysis reveals that a high percentage of attacks goes undetected unless a minimum code redundancy is achieved, LT codes are the most fragile in virtually all scenarios, RLNC and BC are quite insensitive to the victim selection and type of alteration of chosen equations and exhibit virtually identical robustness although BC offer a low complexity of the decoding algorithm.
DOI:10.1007/s12083-021-01206-2