A Generic Secure Transmission Scheme Based on Random Linear Network Coding

Unlike general routing strategies, network coding (NC) can combine encoding functions with multi-path propagation over a network. This allows network capacity to be achieved to support complex security solutions. Moreover, NC has intrinsic security advantages against passive attacks over traditional...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:IEEE/ACM transactions on networking Ročník 30; číslo 2; s. 855 - 866
Hlavní autoři: Wu, Renyong, Ma, Jieming, Tang, Zhixiang, Li, Xiehua, Choo, Kim-Kwang Raymond
Médium: Journal Article
Jazyk:angličtina
Vydáno: New York IEEE 01.04.2022
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Témata:
ISSN:1063-6692, 1558-2566
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 Unlike general routing strategies, network coding (NC) can combine encoding functions with multi-path propagation over a network. This allows network capacity to be achieved to support complex security solutions. Moreover, NC has intrinsic security advantages against passive attacks over traditional routing techniques. However, due to the transmission of the global encoding kernels, the system is fragile to eavesdropping attacks with multiple probes. This paper proposes a generic unicast secure transmission scheme based on random linear network coding (RLNC). Specifically, the intended receiver generates a random matrix upon receiving the request from the source node, and then transmits each row vector of this matrix over a link reversely to the source node. Each intermediate node rearranges all received vectors to form a matrix by row, and then post-multiplies its local encoding kernel by this matrix to obtain a new matrix. Similarly, each row vector of the new matrix is reversely transmitted over a link to the source node. This procedure is performed until we have the source node, where the generalized inverse of the received matrix (or part of it) can be used as its local encoding kernel. Hence, the intended receiver can use the generated matrix (or the corresponding part) to decode the received data packets directly. We also analyze the security to demonstrate that the proposed scheme is at least as secure as other methods against wiretapping attacks. We also evaluate the performance of the proposed scheme to demonstrate its utility.
AbstractList Unlike general routing strategies, network coding (NC) can combine encoding functions with multi-path propagation over a network. This allows network capacity to be achieved to support complex security solutions. Moreover, NC has intrinsic security advantages against passive attacks over traditional routing techniques. However, due to the transmission of the global encoding kernels, the system is fragile to eavesdropping attacks with multiple probes. This paper proposes a generic unicast secure transmission scheme based on random linear network coding (RLNC). Specifically, the intended receiver generates a random matrix upon receiving the request from the source node, and then transmits each row vector of this matrix over a link reversely to the source node. Each intermediate node rearranges all received vectors to form a matrix by row, and then post-multiplies its local encoding kernel by this matrix to obtain a new matrix. Similarly, each row vector of the new matrix is reversely transmitted over a link to the source node. This procedure is performed until we have the source node, where the generalized inverse of the received matrix (or part of it) can be used as its local encoding kernel. Hence, the intended receiver can use the generated matrix (or the corresponding part) to decode the received data packets directly. We also analyze the security to demonstrate that the proposed scheme is at least as secure as other methods against wiretapping attacks. We also evaluate the performance of the proposed scheme to demonstrate its utility.
Author Ma, Jieming
Wu, Renyong
Li, Xiehua
Tang, Zhixiang
Choo, Kim-Kwang Raymond
Author_xml – sequence: 1
  givenname: Renyong
  orcidid: 0000-0003-4002-2813
  surname: Wu
  fullname: Wu, Renyong
  email: wurenyong@hnu.edu.cn
  organization: College of Computer Science and Electronic Engineering, Hunan University, Changsha, China
– sequence: 2
  givenname: Jieming
  orcidid: 0000-0001-5795-0400
  surname: Ma
  fullname: Ma, Jieming
  email: eric07ace@hnu.edu.cn
  organization: College of Computer Science and Electronic Engineering, Hunan University, Changsha, China
– sequence: 3
  givenname: Zhixiang
  orcidid: 0000-0002-7821-7010
  surname: Tang
  fullname: Tang, Zhixiang
  email: tzx@hnu.edu.cn
  organization: College of Computer Science and Electronic Engineering, Hunan University, Changsha, China
– sequence: 4
  givenname: Xiehua
  surname: Li
  fullname: Li, Xiehua
  email: beverly@hnu.edu.cn
  organization: College of Computer Science and Electronic Engineering, Hunan University, Changsha, China
– sequence: 5
  givenname: Kim-Kwang Raymond
  orcidid: 0000-0001-9208-5336
  surname: Choo
  fullname: Choo, Kim-Kwang Raymond
  email: raymond.choo@fulbrightmail.org
  organization: Department of Information Systems and Cyber Security, The University of Texas at San Antonio, San Antonio, TX, USA
BookMark eNp9kMFKAzEQhoNUsK0-gHgJeN6aSXbTzbGWWpVSwa7nkGZnNbWbrckW8e3dUvHgwdPMwP_NMN-A9HzjkZBLYCMApm6K5awYccZhJICnuWInpA9Zlic8k7LX9UyKRErFz8ggxg1jIBiXffI4oXP0GJylK7T7gLQIxsfaxegaT1f2DWuktyZiSbv52fiyqenCeTSBLrH9bMI7nTal86_n5LQy24gXP3VIXu5mxfQ-WTzNH6aTRWK5Em0yrnI0LEVYr8EgNwqAVyxTIsstsNJwKVGVIl0rCUYCgyyVrOJoLc8rACGG5Pq4dxeajz3GVm-affDdSc1lxrjKBZddCo4pG5oYA1Z6F1xtwpcGpg_K9EGZPijTP8o6ZvyHsa41bSeiDcZt_yWvjqRDxN9L3QdMAhffQxB5QQ
CODEN IEANEP
CitedBy_id crossref_primary_10_1109_COMST_2024_3408277
crossref_primary_10_1038_s41598_024_77510_7
crossref_primary_10_3390_s24010285
crossref_primary_10_1016_j_ijleo_2022_170252
Cites_doi 10.1109/TIFS.2019.2954742
10.1109/ISIT.2002.1023595
10.1561/0100000007I
10.1109/LCOMM.2013.062113.130478
10.1109/ISIT.2007.4557282
10.1109/NETCOD.2010.5487671
10.1109/JIOT.2019.2919743
10.1109/18.850663
10.1109/TIT.2010.2090197
10.1109/MWC.2004.1269720
10.1016/j.comnet.2018.03.013
10.1109/TIT.2002.807285
10.1109/TNET.2003.818197
10.1109/ISIT.2011.6034201
10.1109/ISIT.2003.1228459
10.1109/TIT.2005.847712
10.1109/INFCOM.2010.5462050
10.1145/777463.777464
10.1109/JPROC.2010.2094592
10.1109/TIT.2011.2173631
10.1109/TIT.2010.2090212
10.1109/TIT.2006.881746
10.1016/j.comnet.2015.12.012
10.1109/TIT.1976.1055638
10.4236/jis.2018.91007
10.1109/COMST.2016.2598968
10.1109/TrustCom.2014.35
10.1109/ICC.2008.336
ContentType Journal Article
Copyright Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) 2022
Copyright_xml – notice: Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) 2022
DBID 97E
RIA
RIE
AAYXX
CITATION
7SC
7SP
8FD
JQ2
L7M
L~C
L~D
DOI 10.1109/TNET.2021.3124890
DatabaseName IEEE All-Society Periodicals Package (ASPP) 2005–Present
IEEE All-Society Periodicals Package (ASPP) 1998–Present
IEEE Electronic Library (IEL)
CrossRef
Computer and Information Systems Abstracts
Electronics & Communications Abstracts
Technology Research Database
ProQuest Computer Science Collection
Advanced Technologies Database with Aerospace
Computer and Information Systems Abstracts – Academic
Computer and Information Systems Abstracts Professional
DatabaseTitle CrossRef
Technology Research Database
Computer and Information Systems Abstracts – Academic
Electronics & Communications Abstracts
ProQuest Computer Science Collection
Computer and Information Systems Abstracts
Advanced Technologies Database with Aerospace
Computer and Information Systems Abstracts Professional
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-2566
EndPage 866
ExternalDocumentID 10_1109_TNET_2021_3124890
9610612
Genre orig-research
GrantInformation_xml – fundername: Cloud Technology Endowed Professorship
GroupedDBID -DZ
-~X
.DC
0R~
29I
4.4
5GY
5VS
6IK
85S
8US
97E
9M8
AAJGR
AAKMM
AALFJ
AARMG
AASAJ
AAWTH
AAWTV
ABAZT
ABPPZ
ABQJQ
ABVLG
ACGFS
ACGOD
ACIWK
ACM
ADBCU
ADL
AEBYY
AEFXT
AEJOY
AENSD
AETEA
AETIX
AFWIH
AFWXC
AGQYO
AGSQL
AHBIQ
AI.
AIBXA
AIKLT
AKJIK
AKQYR
AKRVB
ALLEH
ALMA_UNASSIGNED_HOLDINGS
ATWAV
BDXCO
BEFXN
BFFAM
BGNUA
BKEBE
BPEOZ
CCLIF
CS3
D0L
EBS
EJD
FEDTE
GUFHI
HF~
HGAVV
HZ~
H~9
I07
ICLAB
IEDLZ
IES
IFIPE
IFJZH
IPLJI
JAVBF
LAI
LHSKQ
M43
MVM
O9-
OCL
P1C
P2P
PQQKQ
RIA
RIE
RNS
ROL
TN5
UPT
UQL
VH1
XOL
YR2
ZCA
AAYXX
CITATION
7SC
7SP
8FD
JQ2
L7M
L~C
L~D
ID FETCH-LOGICAL-c293t-7f8ea04e1bb1ae2a9112f059358c10da266e9d34b961a61015460f2ecc28f1133
IEDL.DBID RIE
ISICitedReferencesCount 5
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000732276100001&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN 1063-6692
IngestDate Sun Jun 29 12:32:10 EDT 2025
Tue Nov 18 22:36:05 EST 2025
Sat Nov 29 03:05:25 EST 2025
Wed Aug 27 02:40:44 EDT 2025
IsPeerReviewed true
IsScholarly true
Issue 2
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-c293t-7f8ea04e1bb1ae2a9112f059358c10da266e9d34b961a61015460f2ecc28f1133
Notes ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ORCID 0000-0002-7821-7010
0000-0001-5795-0400
0000-0003-4002-2813
0000-0001-9208-5336
PQID 2650298326
PQPubID 32020
PageCount 12
ParticipantIDs proquest_journals_2650298326
crossref_primary_10_1109_TNET_2021_3124890
ieee_primary_9610612
crossref_citationtrail_10_1109_TNET_2021_3124890
PublicationCentury 2000
PublicationDate 2022-April
2022-4-00
20220401
PublicationDateYYYYMMDD 2022-04-01
PublicationDate_xml – month: 04
  year: 2022
  text: 2022-April
PublicationDecade 2020
PublicationPlace New York
PublicationPlace_xml – name: New York
PublicationTitle IEEE/ACM transactions on networking
PublicationTitleAbbrev TNET
PublicationYear 2022
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 ref13
Wischik (ref29)
ref12
ref15
ref14
ref31
ref30
ref11
ref10
ref32
ref2
ref1
ref17
ref16
ref19
Liang (ref5) 2010
ref24
ref26
ref25
ref20
ref22
ref21
Feldman (ref23)
ref28
ref27
ref8
Bhattad (ref18)
ref7
ref9
ref4
ref3
ref6
References_xml – ident: ref2
  doi: 10.1109/TIFS.2019.2954742
– ident: ref6
  doi: 10.1109/ISIT.2002.1023595
– ident: ref14
  doi: 10.1561/0100000007I
– ident: ref20
  doi: 10.1109/LCOMM.2013.062113.130478
– ident: ref15
  doi: 10.1109/ISIT.2007.4557282
– ident: ref21
  doi: 10.1109/NETCOD.2010.5487671
– ident: ref3
  doi: 10.1109/JIOT.2019.2919743
– start-page: 1
  volume-title: Proc. 1st Workshop Netw. Coding, Theory, Appl.
  ident: ref18
  article-title: Weakly secure network coding
– start-page: 99
  volume-title: Proc. 8th USENIX Conf. Netw. Syst. Design Implement.
  ident: ref29
  article-title: Design, implementation and evaluation of congestion control for multipath TCP
– ident: ref10
  doi: 10.1109/18.850663
– ident: ref22
  doi: 10.1109/TIT.2010.2090197
– ident: ref28
  doi: 10.1109/MWC.2004.1269720
– ident: ref9
  doi: 10.1016/j.comnet.2018.03.013
– ident: ref11
  doi: 10.1109/TIT.2002.807285
– ident: ref31
  doi: 10.1109/TNET.2003.818197
– ident: ref17
  doi: 10.1109/ISIT.2011.6034201
– ident: ref16
  doi: 10.1109/ISIT.2003.1228459
– ident: ref12
  doi: 10.1109/TIT.2005.847712
– ident: ref26
  doi: 10.1109/INFCOM.2010.5462050
– ident: ref30
  doi: 10.1145/777463.777464
– ident: ref7
  doi: 10.1109/JPROC.2010.2094592
– ident: ref24
  doi: 10.1109/TIT.2011.2173631
– ident: ref25
  doi: 10.1109/TIT.2010.2090212
– start-page: 355
  volume-title: Information Theoretic Security
  year: 2010
  ident: ref5
– ident: ref13
  doi: 10.1109/TIT.2006.881746
– ident: ref19
  doi: 10.1016/j.comnet.2015.12.012
– start-page: 63
  volume-title: Proc. 42nd Annu. Allerton Conf. Commun. Control Comput.
  ident: ref23
  article-title: On the capacity of secure network coding
– ident: ref1
  doi: 10.1109/TIT.1976.1055638
– ident: ref32
  doi: 10.4236/jis.2018.91007
– ident: ref4
  doi: 10.1109/COMST.2016.2598968
– ident: ref8
  doi: 10.1109/TrustCom.2014.35
– ident: ref27
  doi: 10.1109/ICC.2008.336
SSID ssj0013026
Score 2.4037664
Snippet Unlike general routing strategies, network coding (NC) can combine encoding functions with multi-path propagation over a network. This allows network capacity...
SourceID proquest
crossref
ieee
SourceType Aggregation Database
Enrichment Source
Index Database
Publisher
StartPage 855
SubjectTerms Codes
Coding
Eavesdropping
eavesdropping attack
Encoding
Generalized inverse
Kernel
Kernels
Mathematical analysis
Matrices (mathematics)
multi-path propagation
Network coding
Nodes
Packets (communication)
random linear network coding
Receivers
Routing
Secure network coding
Security
Unicast
Wiretapping
Title A Generic Secure Transmission Scheme Based on Random Linear Network Coding
URI https://ieeexplore.ieee.org/document/9610612
https://www.proquest.com/docview/2650298326
Volume 30
WOSCitedRecordID wos000732276100001&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-2566
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0013026
  issn: 1063-6692
  databaseCode: RIE
  dateStart: 19930101
  isFulltext: true
  titleUrlDefault: https://ieeexplore.ieee.org/
  providerName: IEEE
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV3dS8MwEA9z-KAPfk1xOiUPPol1SZa2yeMcG-JDEZ2wt5I0KQxcK_vw7_eSdnOgCL61kEC4S-53v0vuDqEbABkVZ1wFRnAgKFKFgSKGBcwCeofcQX7um03ESSImE_ncQHebXBhrrX98Zu_dp7_LN2W2cqGyrowcgQGDuxPHUZWr9X1jQHxrNRjQC6JIsvoGkxLZHSfDMTBBRoGgMi6c-d3CIN9U5Ycl9vAyOvzfwo7QQe1G4n6l92PUsMUJ2t8qLthCT33sa0pPM-yD6hZ7XAK9ugAZfgVtzSx-ABQzGP5fVGHKGQZuCnsfJ9XrcDwoHbadorfRcDx4DOrOCUEG8L0M4lxYRbilWlNlmQKLxnLXvC8UGSVGASpbaXpcw8IVrB38qIjkDNTJRE6Btp6hZlEW9hxhKiRM4qFmlnFtqFA9o6Mey7OQay3CNiJrWaZZXVbcdbd4Tz29IDJ14k-d-NNa_G10u5nyUdXU-Gtwy8l7M7AWdRt11gpL61O3SBm4m0yCjYoufp91ifaYS1_wL286qLmcr-wV2s0-l9PF_NpvqC9jUcVc
linkProvider IEEE
linkToHtml http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV3dS8MwED_GFNQHv6Y4nZoHn8S6NEu75HGOjamziE7YW0mbFAZuk33493vJujlQBN9aSCDcJfe73yV3B3CFIKPqKVeeFhwJilSBp6hmHjOI3gG3kJ-5ZhP1KBL9vnwuwM0qF8YY4x6fmVv76e7y9Tid21BZVYaWwKDB3Qg4Z3SRrfV9Z0BdczUcUvPCULL8DtOnstqLWj3kgsxHisq4sAZ4DYVcW5UfttgBTHvvf0vbh93ckSSNheYPoGBGh7CzVl6wBA8N4qpKD1LiwuqGOGRCzdoQGXlFfQ0NuUMc0wT_X9RIj4cE2SnufhIt3oeT5tii2xG8tVu9ZsfLeyd4KQL4zKtnwijKjZ8kvjJMoU1jmW3fF4jUp1ohLhupazzBhStcO3pSIc0YKpSJzEfiegzF0XhkToD4QuIkHiTMMJ5oX6iaTsIay9KAJ4kIykCXsozTvLC47W_xHjuCQWVsxR9b8ce5-MtwvZrysaiq8dfgkpX3amAu6jJUlgqL83M3jRk6nEyilQpPf591CVud3lM37t5Hj2ewzWwyg3uHU4HibDI357CZfs4G08mF21xf1LzIow
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=A+Generic+Secure+Transmission+Scheme+Based+on+Random+Linear+Network+Coding&rft.jtitle=IEEE%2FACM+transactions+on+networking&rft.au=Wu%2C+Renyong&rft.au=Ma%2C+Jieming&rft.au=Tang%2C+Zhixiang&rft.au=Li%2C+Xiehua&rft.date=2022-04-01&rft.issn=1063-6692&rft.eissn=1558-2566&rft.volume=30&rft.issue=2&rft.spage=855&rft.epage=866&rft_id=info:doi/10.1109%2FTNET.2021.3124890&rft.externalDBID=n%2Fa&rft.externalDocID=10_1109_TNET_2021_3124890
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1063-6692&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1063-6692&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1063-6692&client=summon