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
FullText Text:
  Availability: 0
CustomLinks:
  – Url: https://hdl.handle.net/2318/1811400#
    Name: EDS - BASE (s4221598)
    Category: fullText
    Text: View record from BASE
  – Url: https://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=EBSCO&SrcAuth=EBSCO&DestApp=WOS&ServiceName=TransferToWoS&DestLinkType=GeneralSearchSummary&Func=Links&author=Gaeta%20R
    Name: ISI
    Category: fullText
    Text: Nájsť tento článok vo Web of Science
    Icon: https://imagesrvr.epnet.com/ls/20docs.gif
    MouseOverText: Nájsť tento článok vo Web of Science
Header DbId: edsbas
DbLabel: BASE
An: edsbas.E62018F6
RelevancyScore: 919
AccessLevel: 3
PubType: Academic Journal
PubTypeId: academicJournal
PreciseRelevancyScore: 918.9462890625
IllustrationInfo
Items – Name: Title
  Label: Title
  Group: Ti
  Data: On the robustness of three classes of rateless codes against pollution attacks in P2P networks
– Name: Author
  Label: Authors
  Group: Au
  Data: <searchLink fieldCode="AR" term="%22Gaeta%2C+Rossano%22">Gaeta, Rossano</searchLink><br /><searchLink fieldCode="AR" term="%22Grangetto%2C+Marco%22">Grangetto, Marco</searchLink>
– Name: Author
  Label: Contributors
  Group: Au
  Data: Gaeta, Rossano<br />Grangetto, Marco
– Name: DatePubCY
  Label: Publication Year
  Group: Date
  Data: 2021
– Name: Subset
  Label: Collection
  Group: HoldingsInfo
  Data: Università degli studi di Torino: AperTo (Archivio Istituzionale ad Accesso Aperto)
– Name: Subject
  Label: Subject Terms
  Group: Su
  Data: <searchLink fieldCode="DE" term="%22Rateless+code%22">Rateless code</searchLink><br /><searchLink fieldCode="DE" term="%22Random+linear+code%22">Random linear code</searchLink><br /><searchLink fieldCode="DE" term="%22LT+code%22">LT code</searchLink><br /><searchLink fieldCode="DE" term="%22Band+code%22">Band code</searchLink><br /><searchLink fieldCode="DE" term="%22Data+modification+attack%22">Data modification attack</searchLink><br /><searchLink fieldCode="DE" term="%22Pollution+attack%22">Pollution attack</searchLink>
– Name: Abstract
  Label: Description
  Group: Ab
  Data: 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.
– Name: TypeDocument
  Label: Document Type
  Group: TypDoc
  Data: article in journal/newspaper
– Name: Language
  Label: Language
  Group: Lang
  Data: English
– Name: NoteTitleSource
  Label: Relation
  Group: SrcInfo
  Data: 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
– Name: DOI
  Label: DOI
  Group: ID
  Data: 10.1007/s12083-021-01206-2
– Name: URL
  Label: Availability
  Group: URL
  Data: https://hdl.handle.net/2318/1811400<br />https://doi.org/10.1007/s12083-021-01206-2
– Name: Copyright
  Label: Rights
  Group: Cpyrght
  Data: info:eu-repo/semantics/openAccess
– Name: AN
  Label: Accession Number
  Group: ID
  Data: edsbas.E62018F6
PLink https://erproxy.cvtisr.sk/sfx/access?url=https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&db=edsbas&AN=edsbas.E62018F6
RecordInfo BibRecord:
  BibEntity:
    Identifiers:
      – Type: doi
        Value: 10.1007/s12083-021-01206-2
    Languages:
      – Text: English
    Subjects:
      – SubjectFull: Rateless code
        Type: general
      – SubjectFull: Random linear code
        Type: general
      – SubjectFull: LT code
        Type: general
      – SubjectFull: Band code
        Type: general
      – SubjectFull: Data modification attack
        Type: general
      – SubjectFull: Pollution attack
        Type: general
    Titles:
      – TitleFull: On the robustness of three classes of rateless codes against pollution attacks in P2P networks
        Type: main
  BibRelationships:
    HasContributorRelationships:
      – PersonEntity:
          Name:
            NameFull: Gaeta, Rossano
      – PersonEntity:
          Name:
            NameFull: Grangetto, Marco
      – PersonEntity:
          Name:
            NameFull: Gaeta, Rossano
      – PersonEntity:
          Name:
            NameFull: Grangetto, Marco
    IsPartOfRelationships:
      – BibEntity:
          Dates:
            – D: 01
              M: 01
              Type: published
              Y: 2021
          Identifiers:
            – Type: issn-locals
              Value: edsbas
            – Type: issn-locals
              Value: edsbas.oa
ResultId 1