Secure Network Coding With Erasures and Feedback

Secure network coding assumes that the underlying network channels are error-free; thus, if our channels introduce errors, we need to first apply a channel code to correct them, and then build security on top of the resulting error-free network. In this paper, we develop achievability protocols and...

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	IEEE transactions on information theory Ročník 61; číslo 4; s. 1667 - 1686
Hlavní autoři:	Czap, Laszlo, Fragouli, Christina, Prabhakaran, Vinod M., Diggavi, Suhas
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	New York IEEE 01.04.2015 The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Témata:	Coding theory Cryptography Encoding Error correction & detection Feedback Network coding Receivers State feedback Vectors network coding Encoding erasure networks security coding decoding message secrecy
ISSN:	0018-9448, 1557-9654
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	Secure network coding assumes that the underlying network channels are error-free; thus, if our channels introduce errors, we need to first apply a channel code to correct them, and then build security on top of the resulting error-free network. In this paper, we develop achievability protocols and outer bounds for the secure network coding setting, where the edges are subject to packet erasures, and public feedback of the channel state is available to both Eve and the legitimate network nodes. We show that by leveraging erasures and feedback, we can achieve secrecy rates that are in some cases multiple times higher than the alternative of separate channel-error-correction followed by secure network coding; moreover, we develop outer bounds and prove optimality of our proposed schemes in some special cases.
AbstractList	Secure network coding assumes that the underlying network channels are error-free; thus, if our channels introduce errors, we need to first apply a channel code to correct them, and then build security on top of the resulting error-free network. In this paper, we develop achievability protocols and outer bounds for the secure network coding setting, where the edges are subject to packet erasures, and public feedback of the channel state is available to both Eve and the legitimate network nodes. We show that by leveraging erasures and feedback, we can achieve secrecy rates that are in some cases multiple times higher than the alternative of separate channel-error-correction followed by secure network coding; moreover, we develop outer bounds and prove optimality of our proposed schemes in some special cases.
Author	Czap, Laszlo Diggavi, Suhas Fragouli, Christina Prabhakaran, Vinod M.
Author_xml	– sequence: 1 givenname: Laszlo surname: Czap fullname: Czap, Laszlo email: laszlo.czap@epfl.ch organization: Swiss Fed. Inst. of Technol. Lausanne, Lausanne, Switzerland – sequence: 2 givenname: Christina surname: Fragouli fullname: Fragouli, Christina email: christina.fragouli@epfl.ch organization: Swiss Fed. Inst. of Technol. Lausanne, Lausanne, Switzerland – sequence: 3 givenname: Vinod M. surname: Prabhakaran fullname: Prabhakaran, Vinod M. email: vinodmp@tifr.res.in organization: Tata Inst. of Fundamental Res., Mumbai, India – sequence: 4 givenname: Suhas surname: Diggavi fullname: Diggavi, Suhas email: suhas@ee.ucla.edu organization: Univ. of California at Los Angeles, Los Angeles, CA, USA
BookMark	eNp9kD1LA0EQhheJYBLtBZsD64s7-72lhCQGghZGLJfN3pxeEu_i7gXx33shwcLCahjmfeaFZ0B6dVMjIddARwDU3i3nyxGjIEdMUMY0OyN9kFLnVknRI31KweRWCHNBBimtu1VIYH1CnzHsI2aP2H41cZONm6Kq37LXqn3PJtGn7pYyXxfZFLFY-bC5JOel3ya8Os0heZlOluOHfPE0m4_vF3ngnLe5LkstOBijjBdBFIJqvtJKIDDkVEhfaFkWNgCjSgW0gMxCqbkXpRRdER-S2-PfXWw-95hat272se4qHSilDFfW2i6ljqkQm5Qili5UrW-rpm6jr7YOqDvYcZ0dd7DjTnY6kP4Bd7H68PH7P-TmiFSI-BvXlBswlv8ANQVvSA
CODEN	IETTAW
CitedBy_id	crossref_primary_10_1109_JPROC_2015_2438312 crossref_primary_10_1007_s10623_015_0155_6 crossref_primary_10_1109_TIT_2017_2743688 crossref_primary_10_3390_app10072206 crossref_primary_10_1016_j_comnet_2018_03_013 crossref_primary_10_1109_LCSYS_2020_3000853 crossref_primary_10_1109_TDSC_2018_2799227
Cites_doi	10.1109/NETCOD.2012.6261888 10.1080/01621459.1963.10500830 10.1109/ISIT.2013.6620656 10.1109/TIT.2002.807285 10.1109/MWC.2004.1269720 10.1109/TIT.2010.2090212 10.1109/18.850663 10.1109/ITW.2011.6089579 10.1109/CIG.2010.5592818 10.1109/ISIT.2008.4594969 10.1109/18.256484 10.1109/Allerton.2013.6736707 10.1109/ISIT.2010.5513777 10.1109/TIT.2011.2173631 10.1002/j.1538-7305.1975.tb02040.x 10.1109/TIT.2010.2090197
ContentType	Journal Article
Copyright	Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) Apr 2015
Copyright_xml	– notice: Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) Apr 2015
DBID	97E RIA RIE AAYXX CITATION 7SC 7SP 8FD JQ2 L7M L~C L~D
DOI	10.1109/TIT.2015.2402272
DatabaseName	IEEE All-Society Periodicals Package (ASPP) 2005–Present IEEE All-Society Periodicals Package (ASPP) Online 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 Computer Science
EISSN	1557-9654
EndPage	1686
ExternalDocumentID	3636332181 10_1109_TIT_2015_2402272 7038189
Genre	orig-research Feature
GrantInformation_xml	– fundername: Department of Science and Technology, Government of India through the Ramanujan Fellowship – fundername: Division of Computing and Communication Foundations through the CIF Project entitled Wireless Network Security Building on Erasures grantid: NSF: CCF-1321120 funderid: 10.13039/100000143 – fundername: ERC Starting Grant Project NOWIRE grantid: ERC-2009-StG-240317 – fundername: Air Force Office of Scientific Research grantid: FA9550-09-064 funderid: 10.13039/100000181 – fundername: Division of Computer and Network Systems grantid: 1136174 funderid: 10.13039/100000144 – fundername: Information Technology Research Academy, Government of India, within the ITRA-Mobile Project grantid: ITRA/15(64)/Mobile/USEAADWN/01
GroupedDBID	-~X .DC 0R~ 29I 3EH 4.4 5GY 5VS 6IK 97E AAJGR AARMG AASAJ AAWTH ABAZT ABFSI ABQJQ ABVLG ACGFO ACGFS ACGOD ACIWK AENEX AETEA AETIX AGQYO AGSQL AHBIQ AI. AIBXA AKJIK AKQYR ALLEH ALMA_UNASSIGNED_HOLDINGS ASUFR ATWAV BEFXN BFFAM BGNUA BKEBE BPEOZ CS3 DU5 E.L EBS EJD F5P HZ~ H~9 IAAWW IBMZZ ICLAB IDIHD IFIPE IFJZH IPLJI JAVBF LAI M43 MS~ O9- OCL P2P PQQKQ RIA RIE RNS RXW TAE TN5 VH1 VJK AAYXX CITATION 7SC 7SP 8FD JQ2 L7M L~C L~D
ID	FETCH-LOGICAL-c333t-7ff74318868a4c4d4073b764e12e3045ad75fd9c12066ce91e291f73a4f54dba3
IEDL.DBID	RIE
ISICitedReferencesCount	9
ISICitedReferencesURI	http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000351470800011&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN	0018-9448
IngestDate	Sun Sep 07 03:20:57 EDT 2025 Sat Nov 29 03:31:33 EST 2025 Tue Nov 18 22:28:57 EST 2025 Tue Aug 26 16:50:03 EDT 2025
IsDoiOpenAccess	false
IsOpenAccess	true
IsPeerReviewed	true
IsScholarly	true
Issue	4
Keywords	network coding Encoding erasure networks security coding decoding message secrecy
Language	English
License	https://ieeexplore.ieee.org/Xplorehelp/downloads/license-information/IEEE.html
LinkModel	DirectLink
MergedId	FETCHMERGED-LOGICAL-c333t-7ff74318868a4c4d4073b764e12e3045ad75fd9c12066ce91e291f73a4f54dba3
Notes	SourceType-Scholarly Journals-1 ObjectType-Feature-1 content type line 14
OpenAccessLink	http://infoscience.epfl.ch/record/208302
PQID	1666836999
PQPubID	36024
PageCount	20
ParticipantIDs	proquest_journals_1666836999 crossref_citationtrail_10_1109_TIT_2015_2402272 crossref_primary_10_1109_TIT_2015_2402272 ieee_primary_7038189
PublicationCentury	2000
PublicationDate	2015-April 2015-4-00 20150401
PublicationDateYYYYMMDD	2015-04-01
PublicationDate_xml	– month: 04 year: 2015 text: 2015-April
PublicationDecade	2010
PublicationPlace	New York
PublicationPlace_xml	– name: New York
PublicationTitle	IEEE transactions on information theory
PublicationTitleAbbrev	TIT
PublicationYear	2015
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 ref12 ref15 ref14 ref11 ref10 ref21 cai (ref16) 2005 ref2 ref1 ref17 ref8 ref9 ref4 feldman (ref7) 2004 ref3 ref6 ref5 gabidulin (ref20) 1985; 21 siavoshani (ref18) 2010 cui (ref19) 2010
References_xml	– ident: ref11 doi: 10.1109/NETCOD.2012.6261888 – ident: ref21 doi: 10.1080/01621459.1963.10500830 – start-page: 323 year: 2005 ident: ref16 article-title: Secure network coding publication-title: Proc IEEE Int Symp Inf Theory (ISIT) – ident: ref10 doi: 10.1109/ISIT.2013.6620656 – ident: ref3 doi: 10.1109/TIT.2002.807285 – ident: ref6 doi: 10.1109/MWC.2004.1269720 – ident: ref15 doi: 10.1109/TIT.2010.2090212 – ident: ref2 doi: 10.1109/18.850663 – ident: ref17 doi: 10.1109/ITW.2011.6089579 – volume: 21 start-page: 3 year: 1985 ident: ref20 article-title: Theory of codes with maximum rank distance publication-title: Problemy Peredachi Informat – start-page: 1 year: 2004 ident: ref7 article-title: On the capacity of secure network coding publication-title: Proc 42nd Allerton Conf Commun Control Comput – ident: ref9 doi: 10.1109/CIG.2010.5592818 – year: 2010 ident: ref19 article-title: Coding for wireless broadcast and network secrecy – ident: ref5 doi: 10.1109/ISIT.2008.4594969 – ident: ref14 doi: 10.1109/18.256484 – ident: ref1 doi: 10.1109/Allerton.2013.6736707 – ident: ref12 doi: 10.1109/ISIT.2010.5513777 – start-page: 719 year: 2010 ident: ref18 article-title: Group secret key generation over broadcast erasure channels publication-title: Proc Asilomar Conf Signals Syst Comput – ident: ref8 doi: 10.1109/TIT.2011.2173631 – ident: ref13 doi: 10.1002/j.1538-7305.1975.tb02040.x – ident: ref4 doi: 10.1109/TIT.2010.2090197
SSID	ssj0014512
Score	2.2128577
Snippet	Secure network coding assumes that the underlying network channels are error-free; thus, if our channels introduce errors, we need to first apply a channel...
SourceID	proquest crossref ieee
SourceType	Aggregation Database Enrichment Source Index Database Publisher
StartPage	1667
SubjectTerms	Coding theory Cryptography Encoding Error correction & detection Feedback Network coding Receivers State feedback Vectors
Title	Secure Network Coding With Erasures and Feedback
URI	https://ieeexplore.ieee.org/document/7038189 https://www.proquest.com/docview/1666836999
Volume	61
WOSCitedRecordID	wos000351470800011&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: 1557-9654 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0014512 issn: 0018-9448 databaseCode: RIE dateStart: 19630101 isFulltext: true titleUrlDefault: https://ieeexplore.ieee.org/ providerName: IEEE
link	http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV07T8MwED61FQMMFFoQhYI8sCCRNg87tkdUtYKlYiiiW-TEtqhAKWpTfj-28xAIhMSWwT5Fn3O5x3e-A7iWviZECu4JTEPPeODKY0oLT0lNzSGrQAvfDZug8zlbLvljC26buzBKKVd8pkb20XH5cp3tbKpsTB2txdvQpjQu72o1jAEmQdkZPDAKbGKOmpL0-XjxsLA1XGRkmYSQht9MkJup8uNH7KzLrPu_9zqCw8qLRHflsR9DS-U96NYTGlClsD04-NJusA--S64rNC9Lv9FkbQ0Xel4VL2i6cbnCLRK5RDNj0lKRvZ7A02y6mNx71cQEL4uiqPCo1tYjYCxmAmdYmmgtSmmMVRAqS4kKSYmWPAtsE_dM8UCFPNA0ElgTbARHp9DJ17k6A2TcLoZTQpxIzIUwno6OLK_LKE91PIBxDWKSVe3E7VSLt8SFFT5PDOyJhT2pYB_ATbPjvWyl8cfavoW5WVchPIBhfU5JpWvbxBKfLIqNp3v--64L2Leyy3qbIXSKzU5dwl72Uay2myv3GX0C-VbCVQ
linkProvider	IEEE
linkToHtml	http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1RT8IwEL4gmqgPoqARRe2DLyYOtrVd10dDIBCR-ICRt6VsbSSaYWD4-227jWg0Jr7toe2W73q7u37XO4DrxFWUJoI7gjDf0R64dEKphCMTxbSQpaeEa5tNsPE4nE75YwVuN3dhpJQ2-Uy2zaPl8pNFvDZHZR1maS2-BduUEN_Nb2ttOANCvbw2uKdVWEcdJSnp8s5kODFZXLRtuASf-d-MkO2q8uNXbO1Lv_a_LzuEg8KPRHe54I-gItM61MoeDahQ2Trsfyk42ADXHq9LNM6Tv1F3YUwXep5nL6i3tKeFKyTSBPW1UZuJ-PUYnvq9SXfgFD0TnBhjnDlMKeMThGEQChKTRMdreMYCIj1fGlJUJIyqhMeeKeMeS-5Jn3uKYUEUJXphfALVdJHKU0Da8QrJjFK7JOFCaF9HYcPshozPVNCETgliFBcFxU1fi7fIBhYujzTskYE9KmBvws1mxnteTOOPsQ0D82ZcgXATWqWcokLbVpGhPkMcaF_37PdZV7A7mDyMotFwfH8Oe-Y9efZNC6rZci0vYCf-yOar5aXdUp9FMMWc
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=Secure+Network+Coding+With+Erasures+and+Feedback&rft.jtitle=IEEE+transactions+on+information+theory&rft.au=Czap%2C+Laszlo&rft.au=Fragouli%2C+Christina&rft.au=Prabhakaran%2C+Vinod+M.&rft.au=Diggavi%2C+Suhas&rft.date=2015-04-01&rft.issn=0018-9448&rft.eissn=1557-9654&rft.volume=61&rft.issue=4&rft.spage=1667&rft.epage=1686&rft_id=info:doi/10.1109%2FTIT.2015.2402272&rft.externalDBID=n%2Fa&rft.externalDocID=10_1109_TIT_2015_2402272
thumbnail_l	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0018-9448&client=summon
thumbnail_m	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0018-9448&client=summon
thumbnail_s	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0018-9448&client=summon