An Analytical Model for the Partial Intercept Probability in Sparse Linear Network Coding

The security of linear network coding schemes such as Random Linear Network Coding (RLNC) and Sparse Random Linear Network Coding (SRLNC) is an important performance metric. One of the security aspects of these coding schemes is the probability that a potential eavesdropper recovers a fraction of so...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:IEEE communications letters Ročník 24; číslo 4; s. 725 - 728
Hlavní autoři: Sehat, Hadi, Pahlevani, Peyman
Médium: Journal Article
Jazyk:angličtina
Vydáno: New York IEEE 01.04.2020
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Témata:
ISSN:1089-7798, 1558-2558
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Abstract The security of linear network coding schemes such as Random Linear Network Coding (RLNC) and Sparse Random Linear Network Coding (SRLNC) is an important performance metric. One of the security aspects of these coding schemes is the probability that a potential eavesdropper recovers a fraction of source packets. In this work, we consider a network consisted of a sender, a legitimate receiver and an eavesdropper, where the sender uses SRLNC to broadcast data. We propose an analytical approximation for the probability of decoding a fraction of source packets, i.e., the partial intercept probability, by the eavesdropper. Using this analytical model, we propose an algorithm for the maximum sparsity that satisfies a threshold on the number of the source packets decoded by the eavesdropper. Using simulation technique, We proved that the maximum sparsity found by this algorithm satisfies the aforementioned threshold.
AbstractList The security of linear network coding schemes such as Random Linear Network Coding (RLNC) and Sparse Random Linear Network Coding (SRLNC) is an important performance metric. One of the security aspects of these coding schemes is the probability that a potential eavesdropper recovers a fraction of source packets. In this work, we consider a network consisted of a sender, a legitimate receiver and an eavesdropper, where the sender uses SRLNC to broadcast data. We propose an analytical approximation for the probability of decoding a fraction of source packets, i.e., the partial intercept probability, by the eavesdropper. Using this analytical model, we propose an algorithm for the maximum sparsity that satisfies a threshold on the number of the source packets decoded by the eavesdropper. Using simulation technique, We proved that the maximum sparsity found by this algorithm satisfies the aforementioned threshold.
Author Sehat, Hadi
Pahlevani, Peyman
Author_xml – sequence: 1
  givenname: Hadi
  orcidid: 0000-0002-6262-4834
  surname: Sehat
  fullname: Sehat, Hadi
  organization: Department of Computer Science, Institute for Advanced Studies in Basic Sciences, Zanjan, Iran
– sequence: 2
  givenname: Peyman
  orcidid: 0000-0001-5918-7250
  surname: Pahlevani
  fullname: Pahlevani, Peyman
  email: pahlevani@iasbs.ac.ir
  organization: Department of Computer Science and Information Technology, Institute for Advanced Studies in Basic Sciences, Zanjan, Iran
BookMark eNp9kE1PwzAMhiMEEtvgD8AlEueOJG3W5DhVfEzq2CTgwKlKMxcySlKSTGj_no5NHDhwsS3Lj_36HaJj6ywgdEHJmFIir8tiMZ-PGWFkzOREppk8QgPKuUhYH477mgiZ5LkUp2gYwpoQIhinA_QytXhqVbuNRqsWz90KWtw4j-Mb4KXy0fTdmY3gNXQRL72rVW1aE7fYWPzYKR8Al8aC8vgB4pfz77hwK2Nfz9BJo9oA54c8Qs-3N0_FfVIu7mbFtEw0kzwmgoIE0YuBjAvVa2e8YTnTNIWac614ozRvRD6puSJa54zWHHhGAfQqSwVNR-hqv7fz7nMDIVZrt_H9S6FiqRCUUCryfortp7R3IXhoqs6bD-W3FSXVzsLqx8JqZ2F1sLCHxB9Im6iicTZ6Zdr_0cs9agDg95aQE8FFmn4DUjyAtQ
CODEN ICLEF6
CitedBy_id crossref_primary_10_1109_ACCESS_2021_3137209
crossref_primary_10_1109_LCOMM_2020_3031011
crossref_primary_10_1007_s11277_021_08497_x
Cites_doi 10.1109/LCOMM.2019.2896626
10.1109/TVT.2019.2907290
10.1109/LCOMM.2018.2840139
10.1109/LCOMM.2013.062113.130478
10.1017/CBO9780511977985
10.1109/LCOMM.2015.2470662
10.1109/LCOMM.2013.060513.130684
ContentType Journal Article
Copyright Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) 2020
Copyright_xml – notice: Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) 2020
DBID 97E
RIA
RIE
AAYXX
CITATION
7SP
8FD
L7M
DOI 10.1109/LCOMM.2020.2969349
DatabaseName IEEE Xplore (IEEE)
IEEE All-Society Periodicals Package (ASPP) 1998–Present
IEEE Electronic Library (IEL)
CrossRef
Electronics & Communications Abstracts
Technology Research Database
Advanced Technologies Database with Aerospace
DatabaseTitle CrossRef
Technology Research Database
Advanced Technologies Database with Aerospace
Electronics & Communications Abstracts
DatabaseTitleList
Technology Research Database
Database_xml – sequence: 1
  dbid: RIE
  name: IEEE Electronic Library (IEL)
  url: https://ieeexplore.ieee.org/
  sourceTypes: Publisher
DeliveryMethod fulltext_linktorsrc
Discipline Engineering
EISSN 1558-2558
EndPage 728
ExternalDocumentID 10_1109_LCOMM_2020_2969349
8968583
Genre orig-research
GroupedDBID -~X
0R~
29I
4.4
5GY
5VS
6IK
97E
AAJGR
AARMG
AASAJ
AAWTH
ABAZT
ABQJQ
ABVLG
ACGFO
ACIWK
AENEX
AETIX
AGQYO
AGSQL
AHBIQ
AI.
AIBXA
AKJIK
AKQYR
ALLEH
ALMA_UNASSIGNED_HOLDINGS
ATWAV
AZLTO
BEFXN
BFFAM
BGNUA
BKEBE
BPEOZ
CS3
DU5
EBS
EJD
HZ~
H~9
IES
IFIPE
IFJZH
IPLJI
JAVBF
LAI
M43
O9-
OCL
P2P
RIA
RIE
RNS
TN5
VH1
AAYXX
CITATION
7SP
8FD
L7M
ID FETCH-LOGICAL-c295t-81e9e8825e458a96925f272c13eb55ca5fac5f876b5a0cc721b5e541eecd43813
IEDL.DBID RIE
ISICitedReferencesCount 4
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000528817100005&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN 1089-7798
IngestDate Mon Jun 30 10:22:15 EDT 2025
Tue Nov 18 22:45:34 EST 2025
Sat Nov 29 03:56:02 EST 2025
Wed Aug 27 02:35:29 EDT 2025
IsPeerReviewed true
IsScholarly true
Issue 4
Language English
License https://ieeexplore.ieee.org/Xplorehelp/downloads/license-information/IEEE.html
https://doi.org/10.15223/policy-029
https://doi.org/10.15223/policy-037
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-c295t-81e9e8825e458a96925f272c13eb55ca5fac5f876b5a0cc721b5e541eecd43813
Notes ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ORCID 0000-0002-6262-4834
0000-0001-5918-7250
PQID 2388101187
PQPubID 85419
PageCount 4
ParticipantIDs proquest_journals_2388101187
ieee_primary_8968583
crossref_primary_10_1109_LCOMM_2020_2969349
crossref_citationtrail_10_1109_LCOMM_2020_2969349
PublicationCentury 2000
PublicationDate 2020-04-01
PublicationDateYYYYMMDD 2020-04-01
PublicationDate_xml – month: 04
  year: 2020
  text: 2020-04-01
  day: 01
PublicationDecade 2020
PublicationPlace New York
PublicationPlace_xml – name: New York
PublicationTitle IEEE communications letters
PublicationTitleAbbrev COML
PublicationYear 2020
Publisher IEEE
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher_xml – name: IEEE
– name: The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
References ref8
ref7
sehat (ref9) 2019
ref4
ref3
ref6
ref10
cai (ref1) 2002
ref2
bhattad (ref5) 2005
pedersen (ref11) 2011
References_xml – ident: ref10
  doi: 10.1109/LCOMM.2019.2896626
– year: 2019
  ident: ref9
  article-title: On the probability of partial decoding in sparse network coding
  publication-title: arXiv 1907 12051
– start-page: 145
  year: 2011
  ident: ref11
  publication-title: KODO An Open and Research Oriented Network Coding Library
– ident: ref3
  doi: 10.1109/TVT.2019.2907290
– ident: ref4
  doi: 10.1109/LCOMM.2018.2840139
– year: 2005
  ident: ref5
  article-title: Weakly secure network coding
  publication-title: Proc NetCod
– ident: ref7
  doi: 10.1109/LCOMM.2013.062113.130478
– ident: ref8
  doi: 10.1017/CBO9780511977985
– ident: ref2
  doi: 10.1109/LCOMM.2015.2470662
– ident: ref6
  doi: 10.1109/LCOMM.2013.060513.130684
– start-page: 323
  year: 2002
  ident: ref1
  article-title: Secure network coding
  publication-title: Proc IEEE Int Symp Inf Theory
SSID ssj0008251
Score 2.318863
Snippet The security of linear network coding schemes such as Random Linear Network Coding (RLNC) and Sparse Random Linear Network Coding (SRLNC) is an important...
SourceID proquest
crossref
ieee
SourceType Aggregation Database
Enrichment Source
Index Database
Publisher
StartPage 725
SubjectTerms Algorithms
Analytical models
Approximation algorithms
Coding
Computer simulation
Decoding
Mathematical analysis
Mathematical models
Network coding
physical layer security
probability of partial decoding
Receivers
Security
Security aspects
Sparse matrices
Sparse random network coding
Sparsity
Title An Analytical Model for the Partial Intercept Probability in Sparse Linear Network Coding
URI https://ieeexplore.ieee.org/document/8968583
https://www.proquest.com/docview/2388101187
Volume 24
WOSCitedRecordID wos000528817100005&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
journalDatabaseRights – providerCode: PRVIEE
  databaseName: IEEE Electronic Library (IEL)
  customDbUrl:
  eissn: 1558-2558
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0008251
  issn: 1089-7798
  databaseCode: RIE
  dateStart: 19970101
  isFulltext: true
  titleUrlDefault: https://ieeexplore.ieee.org/
  providerName: IEEE
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1LSwMxEB5q8aAH32K1Sg7edNt9pUmOpVg82FpQQU_LbnYCgmxLH4L_3kx2uxQUwdsSkrBkMpNvkplvAK4xj9JYG-0RWPXiTJIdNLlnZM83Co3gJnbFJsR4LF9f1aQBt3UuDCK64DPs0Kd7y8-nekVXZV2piC092oItIXplrlZtdSkFswymVxYxKrlOkPFV92HwOBpZVzD0O6HqqYh4MzcOIVdV5YcpdufLcP9_f3YAexWOZP1S8IfQwOIIdjfYBY_hrV8wxznirqsZVT37YBajMov52IS2jG11N4IU2sImc6vaLlT2i70X7GlmXV5k1le1usDGZbQ4G0zprDuBl-Hd8-DeqyopeDpUfOnJABVaLM0x5jK1axByE4pQBxFmnOuUm1RzYw1jxlNfa-sVZhx5HCDqnDjAolNoFtMCz4BJn-cqjo0WmZ1MhynXgRAys425lIq3IFgvbaIrmnGqdvGROHfDV4kTR0LiSCpxtOCmHjMrSTb-7H1MAqh7VmvfgvZagkmlh4vEAhJiMAukOP991AXs0NxlLE4bmsv5Ci9hW38u3xfzK7fFvgHXOc4T
linkProvider IEEE
linkToHtml http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV3dS8MwED_8AvXBrynOzzz4pt3aNLHJowxFcZsDFfSptOkFBtLJnIL_vbm0G4Ii-FZC0pZccvnd5e53ACdYxJkw1gQEVgORK9KDtgisOg-tRptIK3yxiaTfV09PejAHZ7NcGET0wWfYokd_l1-MzDu5ytpKE1t6PA-LUggeVtlaM71LSZhVOL12mFGraYpMqNvdzl2v54xBHra4PtcxMWd-O4Z8XZUfytifMFfr__u3DVirkSS7qES_CXNYbsHqN37BBjxflMyzjniHNaO6Zy_MoVTmUB8b0KJxrd4nSMEtbDB2m9sHy36yYcnuX53Ri8xZq243sH4VL846IzrttuHx6vKhcx3UtRQCw7WcBCpCjQ5NSxRSZW4OuLQ84SaKMZfSZNJmRlqnGnOZhcY4uzCXKEWEaApiAYt3YKEclbgLTIWy0EJYk-TuZYZn0kRJonLXWCilZROi6dSmpiYap3oXL6k3OEKdenGkJI60FkcTTmdjXiuajT97N0gAs5713DfhYCrBtN6Jb6mDJMRhFqlk7_dRx7B8_dDrpt2b_u0-rNB3qsicA1iYjN_xEJbMx2T4Nj7yy-0LukfRWg
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=An+Analytical+Model+for+the+Partial+Intercept+Probability+in+Sparse+Linear+Network+Coding&rft.jtitle=IEEE+communications+letters&rft.au=Sehat%2C+Hadi&rft.au=Pahlevani%2C+Peyman&rft.date=2020-04-01&rft.pub=IEEE&rft.issn=1089-7798&rft.volume=24&rft.issue=4&rft.spage=725&rft.epage=728&rft_id=info:doi/10.1109%2FLCOMM.2020.2969349&rft.externalDocID=8968583
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1089-7798&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1089-7798&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1089-7798&client=summon