Byzantine Modification Detection in Multicast Networks With Random Network Coding

An information-theoretic approach for detecting Byzantine or adversarial modifications in networks employing random linear network coding is described. Each exogenous source packet is augmented with a flexible number of hash symbols that are obtained as a polynomial function of the data symbols. Thi...

Full description

Saved in:

Bibliographic Details
Published in:	IEEE transactions on information theory Vol. 54; no. 6; pp. 2798 - 2803
Main Authors:	Tracey Ho, Ben Leong, Koetter, R., Medard, M., Effros, M., Karger, D.R.
Format:	Journal Article
Language:	English
Published:	New York IEEE 01.06.2008 The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subjects:	Ad hoc networks Associate members Byzantine adversary Codes Coding Computer networks Computer science Hash based algorithms Information Information theory Laboratories Multicast Network coding network error detection Networks Packet switched networks Peer to peer computing Polynomials Robustness Symbols
ISSN:	0018-9448, 1557-9654
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Abstract	An information-theoretic approach for detecting Byzantine or adversarial modifications in networks employing random linear network coding is described. Each exogenous source packet is augmented with a flexible number of hash symbols that are obtained as a polynomial function of the data symbols. This approach depends only on the adversary not knowing the random coding coefficients of all other packets received by the sink nodes when designing its adversarial packets. We show how the detection probability varies with the overhead (ratio of hash to data symbols), coding field size, and the amount of information unknown to the adversary about the random code.
AbstractList	An information-theoretic approach for detecting Byzantine or adversarial modifications in networks employing random linear network coding is described. Each exogenous source packet is augmented with a flexible number of hash symbols that are obtained as a polynomial function of the data symbols. This approach depends only on the adversary not knowing the random coding coefficients of all other packets received by the sink nodes when designing its adversarial packets. We show how the detection probability varies with the overhead (ratio of hash to data symbols), coding field size, and the amount of information unknown to the adversary about the random code. In this paper, we provide a class of bound entangled states that have positive distillable secure key rate. The smallest state of this kind is 4 otimes 4, which shows that peculiar security contained in bound entangled states does not need high-dimensional systems. We show that for these states a positive key rate can be obtained by (one-way) Devetak-Winter (DW) protocol. Subsequently, the volume of bound entangled key-distillable states for (m) otimes (n) Hilbert space with (m,) (n) > 4 is shown to be nonzero. We provide a scheme of verification of cryptographic quality of experimentally prepared state in terms of local observables. Proposed set of seven collective settings is proven to be optimal in number of settings. An information-theoretic approach for detecting Byzantine or adversarial modifications in networks employing random linear network coding is described. Each exogenous source packet is augmented with a flexible number of hash symbols that are obtained as a polynomial function of the data symbols. This approach depends only on the adversary not knowing the random coding coefficients of all other packets received by the sink nodes when designing its adversarial packets. We show how the detection probability varies with the overhead (ratio of hash to data symbols), coding field size, and the amount of information unknown to the adversary about the random code. An information-theoretic approach for detecting Byzantine or adversarial modifications in networks employing random linear network coding is described. Each exogenous source packet is augmented with a flexible number of hash symbols that are obtained as a polynomial function of the data symbols. This approach depends only on the adversary not knowing the random coding coefficients of all other packets received by the sink nodes when designing its adversarial packets. We show how the detection probability varies with the overhead (ratio of hash to data symbols), coding field size, and the amount of information unknown to the adversary about the random code. [PUBLICATION ABSTRACT]
Author	Ben Leong Koetter, R. Medard, M. Effros, M. Tracey Ho Karger, D.R.
Author_xml	– sequence: 1 surname: Tracey Ho fullname: Tracey Ho organization: California Inst. of Technol., Pasadena, CA – sequence: 2 surname: Ben Leong fullname: Ben Leong – sequence: 3 givenname: R. surname: Koetter fullname: Koetter, R. – sequence: 4 givenname: M. surname: Medard fullname: Medard, M. – sequence: 5 givenname: M. surname: Effros fullname: Effros, M. – sequence: 6 givenname: D.R. surname: Karger fullname: Karger, D.R.
BookMark	eNp9kTtPwzAUhS0EEuUxM7BEDDCl9SNO7RHKU6IgUBGj5STX4JLaELtC8OtxKTB0YLq-9neOru_ZQuvOO0Boj-A-IVgOJleTPsVY9CUlQhZrqEc4H-ay5MU66mFMRC6LQmyirRCmqS04oT10d_LxqV20DrKxb6yxtY7Wu-wUItTfJ-uy8byN6SHE7Abiu-9eQvZo43N2r13jZ7-X2SgZuKcdtGF0G2D3p26jh_Ozyegyv769uBodX-c1kzTmlDKD02zMSMZr2TQEN6birKmElAbLsqmgqAzRw6puhKCGlNoAlAykLoFoto2Olr6vnX-bQ4hqZkMNbasd-HlQYsgxo4LLRB7-S7KCp11wnsCDFXDq551Lv1BEckkFKxcQX0J150PowKjaxu-lxU7bVhGsFnmolIda5KGWeSTdYEX32tmZ7j7-UewvFRYA_uiCU0mHjH0BGP-X5A
CODEN	IETTAW
CitedBy_id	crossref_primary_10_1145_3491062 crossref_primary_10_1109_TDSC_2012_39 crossref_primary_10_3390_app13127129 crossref_primary_10_1109_ACCESS_2017_2769802 crossref_primary_10_1016_j_procs_2018_10_385 crossref_primary_10_1109_TIFS_2014_2299401 crossref_primary_10_1109_TMM_2016_2535781 crossref_primary_10_1140_epjqt_s40507_022_00127_0 crossref_primary_10_1109_TCOMM_2015_2438811 crossref_primary_10_1016_j_phpro_2012_02_271 crossref_primary_10_1109_LCOMM_2020_3027972 crossref_primary_10_1109_ACCESS_2020_2977428 crossref_primary_10_1109_TPDS_2012_342 crossref_primary_10_1109_TMC_2013_137 crossref_primary_10_1109_LCOMM_2011_012511_101323 crossref_primary_10_1007_s11235_021_00842_6 crossref_primary_10_1016_j_comnet_2009_08_002 crossref_primary_10_1109_TPDS_2016_2619686 crossref_primary_10_1109_TMM_2015_2402516 crossref_primary_10_1016_j_adhoc_2013_12_010 crossref_primary_10_4218_etrij_13_0212_0166 crossref_primary_10_1007_s11859_014_0994_4 crossref_primary_10_1051_matecconf_20164207002 crossref_primary_10_1109_TIT_2021_3078812 crossref_primary_10_1016_j_comnet_2015_03_010 crossref_primary_10_1109_TIT_2012_2216952 crossref_primary_10_1155_2010_216524 crossref_primary_10_1007_s11859_016_1186_1 crossref_primary_10_1109_JPROC_2010_2093551 crossref_primary_10_1016_j_comnet_2018_03_013 crossref_primary_10_1002_cpe_3322 crossref_primary_10_1016_j_aeue_2017_05_028 crossref_primary_10_1109_TIT_2023_3241409 crossref_primary_10_1109_JSYST_2020_3034242 crossref_primary_10_1016_j_sysarc_2021_102051 crossref_primary_10_1016_j_comcom_2017_07_001 crossref_primary_10_1109_TIFS_2020_2972129 crossref_primary_10_1109_TWC_2013_062413_121557 crossref_primary_10_1109_TVT_2020_3025305 crossref_primary_10_1016_j_adhoc_2014_04_002 crossref_primary_10_1088_2058_9565_aa8ac4 crossref_primary_10_1109_TNET_2013_2294254 crossref_primary_10_1016_j_aeue_2016_03_008 crossref_primary_10_1109_COMST_2016_2562027 crossref_primary_10_1109_TAES_2014_120442 crossref_primary_10_1016_j_compeleceng_2020_106774 crossref_primary_10_1109_TIFS_2018_2859583 crossref_primary_10_1109_TMC_2012_186 crossref_primary_10_1016_j_jisa_2020_102658 crossref_primary_10_1109_TIFS_2016_2596140 crossref_primary_10_1145_2568223 crossref_primary_10_1109_ACCESS_2019_2933870 crossref_primary_10_1134_S0032946013020075 crossref_primary_10_1088_1742_6596_1693_1_012048 crossref_primary_10_1109_TIT_2018_2865936 crossref_primary_10_1016_j_jnca_2010_02_003 crossref_primary_10_1109_TNSM_2022_3194205 crossref_primary_10_1109_TIT_2010_2102090
Cites_doi	10.1109/TNET.2003.818197 10.1109/ITWTPI.2005.1543954 10.1109/TIT.2005.864424 10.1109/TIT.2006.874523 10.3233/JCS-1997-5203 10.1109/TIT.2006.881746 10.1145/138027.138036 10.4310/CIS.2006.v6.n1.a3 10.1109/ISIT.2007.4557321 10.4310/CIS.2006.v6.n1.a2 10.1049/ip-com:20045307 10.1109/INFCOM.2007.78 10.1109/18.850663 10.1109/ISIT.2003.1228459 10.1109/HICSS.1998.656294 10.1109/ISIT.2004.1365180
ContentType	Journal Article
Copyright	Copyright Institute of Electrical and Electronics Engineers, Inc. (IEEE) Jun 2008
Copyright_xml	– notice: Copyright Institute of Electrical and Electronics Engineers, Inc. (IEEE) Jun 2008
DBID	97E RIA RIE AAYXX CITATION 7SC 7SP 8FD JQ2 L7M L~C L~D F28 FR3
DOI	10.1109/TIT.2008.921894
DatabaseName	IEEE Xplore (IEEE) IEEE All-Society Periodicals Package (ASPP) 1998–Present IEEE/IET 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 ANTE: Abstracts in New Technology & Engineering Engineering Research Database
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 Engineering Research Database ANTE: Abstracts in New Technology & Engineering
DatabaseTitleList	Technology Research Database Technology Research Database 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	2803
ExternalDocumentID	1485793171 10_1109_TIT_2008_921894 4529273
Genre	orig-research Feature
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 F28 FR3
ID	FETCH-LOGICAL-c392t-223f06543f935c9dd10dfb53db899f096dbe4bf1a7bcd882f16afee63e9a6e1a3
IEDL.DBID	RIE
ISICitedReferencesCount	96
ISICitedReferencesURI	http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000258033700030&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	Wed Oct 01 14:46:01 EDT 2025 Thu Oct 02 05:36:51 EDT 2025 Sun Nov 09 06:12:05 EST 2025 Tue Nov 18 22:32:50 EST 2025 Sat Nov 29 03:53:04 EST 2025 Tue Aug 26 16:47:24 EDT 2025
IsDoiOpenAccess	false
IsOpenAccess	true
IsPeerReviewed	true
IsScholarly	true
Issue	6
Language	English
License	https://ieeexplore.ieee.org/Xplorehelp/downloads/license-information/IEEE.html
LinkModel	DirectLink
MergedId	FETCHMERGED-LOGICAL-c392t-223f06543f935c9dd10dfb53db899f096dbe4bf1a7bcd882f16afee63e9a6e1a3
Notes	SourceType-Scholarly Journals-1 ObjectType-Feature-1 content type line 14 ObjectType-Article-2 content type line 23
OpenAccessLink	http://scholarbank.nus.edu.sg/handle/10635/39631
PQID	195928365
PQPubID	23500
PageCount	6
ParticipantIDs	crossref_primary_10_1109_TIT_2008_921894 ieee_primary_4529273 crossref_citationtrail_10_1109_TIT_2008_921894 proquest_miscellaneous_875032859 proquest_miscellaneous_34551255 proquest_journals_195928365
PublicationCentury	2000
PublicationDate	2008-06-01
PublicationDateYYYYMMDD	2008-06-01
PublicationDate_xml	– month: 06 year: 2008 text: 2008-06-01 day: 01
PublicationDecade	2000
PublicationPlace	New York
PublicationPlace_xml	– name: New York
PublicationTitle	IEEE transactions on information theory
PublicationTitleAbbrev	TIT
PublicationYear	2008
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	ref12 castro (ref22) 1999 perlman (ref8) 1988 ref10 ref2 lun (ref4) 2004 ref1 ref19 ref18 feldman (ref15) 2004 ref24 ref23 ref25 ref20 ref21 massey (ref13) 1999 cai (ref14) 2002 bhattad (ref16) 2005 ref7 yeung (ref17) 2006; 6 ref9 ref3 papadimitratos (ref11) 2002 ref5 chou (ref6) 2003
References_xml	– ident: ref2 doi: 10.1109/TNET.2003.818197 – ident: ref12 doi: 10.1109/ITWTPI.2005.1543954 – ident: ref3 doi: 10.1109/TIT.2005.864424 – year: 2002 ident: ref11 article-title: Secure routing for mobile ad hoc networks publication-title: Proc SCS Communication Netwirks and Distributed Systems Modeling and Simulation Conf (CNDS 2002) – start-page: 173 year: 1999 ident: ref22 article-title: Practical byzantine fault tolerance publication-title: OSDI Proc Symp Operating Systems Design and Implementation – ident: ref25 doi: 10.1109/TIT.2006.874523 – year: 2003 ident: ref6 article-title: Practical network coding publication-title: Proc 41st Annu Allerton Conf Communication Control and Computing – ident: ref10 doi: 10.3233/JCS-1997-5203 – ident: ref24 doi: 10.1109/TIT.2006.881746 – year: 2004 ident: ref15 article-title: On the capacity of secure network coding publication-title: Proc 42nd Annu Allerton Conf Communication Control and Computing – ident: ref9 doi: 10.1145/138027.138036 – start-page: 323 year: 2002 ident: ref14 article-title: Secure network coding publication-title: Proc IEEE Int Symp Information Theory – ident: ref18 doi: 10.4310/CIS.2006.v6.n1.a3 – ident: ref21 doi: 10.1109/ISIT.2007.4557321 – volume: 6 start-page: 19 year: 2006 ident: ref17 article-title: Network error correction, part I: Basic concepts and upper bounds publication-title: Commun Inf Syst doi: 10.4310/CIS.2006.v6.n1.a2 – ident: ref19 doi: 10.1049/ip-com:20045307 – year: 2004 ident: ref4 article-title: On coding for reliable communication over packet networks publication-title: Proc 42nd Annu Allerton Conf Communication Control and Computing – year: 2005 ident: ref16 article-title: Weakly secure network coding publication-title: Proc WINMEE RAWNET and NETCOD 2005 Workshops – year: 1988 ident: ref8 publication-title: Network layer protocols with Byzantine robustness – ident: ref20 doi: 10.1109/INFCOM.2007.78 – ident: ref1 doi: 10.1109/18.850663 – ident: ref5 doi: 10.1109/ISIT.2003.1228459 – year: 1999 ident: ref13 publication-title: Contemporary Cryptology The Science Of Information Integrity – ident: ref23 doi: 10.1109/HICSS.1998.656294 – ident: ref7 doi: 10.1109/ISIT.2004.1365180
SSID	ssj0014512
Score	2.3069432
Snippet	An information-theoretic approach for detecting Byzantine or adversarial modifications in networks employing random linear network coding is described. Each...
SourceID	proquest crossref ieee
SourceType	Aggregation Database Enrichment Source Index Database Publisher
StartPage	2798
SubjectTerms	Ad hoc networks Associate members Byzantine adversary Codes Coding Computer networks Computer science Hash based algorithms Information Information theory Laboratories Multicast Network coding network error detection Networks Packet switched networks Peer to peer computing Polynomials Robustness Symbols
Title	Byzantine Modification Detection in Multicast Networks With Random Network Coding
URI	https://ieeexplore.ieee.org/document/4529273 https://www.proquest.com/docview/195928365 https://www.proquest.com/docview/34551255 https://www.proquest.com/docview/875032859
Volume	54
WOSCitedRecordID	wos000258033700030&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/eLvHCXMwlV07T4RAEJ6cxkIL30Y8H1tYWIiy8rotfUYLL2rOaEeWfcRLFMzBmeivd3aXIxq1sCOwBMIwzAzzzfcB7Mr0iFtQe8wD6UdpzvxcYJUSCcY1zdGhuBObSPv93uMju-nAfjsLo5Sy4DN1YDZtL1-WYmx-lR2aJiGG2ymYStPEzWq1HYMopo4ZnKIDY83R0PjQgB0OrgYONMkwnrHoWwSykio_vsM2uFws_O-2FmG-SSLJsbP6EnRUsQwLE4EG0vjrMsx9YRtcgduT9w9uhCEUuS6lgQhZq5AzVVs8VkGGBbEDuYJXNek7gHhFHob1E7njhSxfJjvJaWli3ircX5wPTi_9RlHBF5gH1T7mAtpOk2oWxoJJSQOp8ziUOZZdGqsZmaso15SnuZCYe2uacK1UEirGE0V5uAbTRVmodSBhL-A9luoo0DzSCguvUKA364TqQPA08eBg8pQz0dCNG9WL58yWHQHL0CxOBNOZxYO99oRXx7Tx99IVY4V2WWMAD7oTM2aNJ1aZIc_BFCqJPdhpj6ILmb4IL1Q5rrIwwrQRSysPyB8reqbba6j-Nn6_chdmHY7E_J3ZhOl6NFZbMCPe6mE12rYv6iexTefO
linkProvider	IEEE
linkToHtml	http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1Lb9NAEB6VFAk4EOhDNaXNHnrggFtv_dwjhEaJSKK2CqI3a70PEQnsKnaQ4Nczu-tYVG0PvVn2Wrb8eTwznm_mAziR6Tm3pPaYB9KP0oL5hcAsJRKMa1qgQXEnNpHO59nNDbvcgo9dL4xSypLP1KnZtLV8WYm1-VV2ZoqE6G6fwXaMfjRw3VpdzSCKqZsNTtGEMetoB_nQgJ0tJgtHm2To0Vh0xwdZUZV7X2LrXkb9p93YG3jdhpHkk8P9LWypcgf6G4kG0lrsDrz6b97gLlx9_vOXG2kIRWaVNCQhiwv5ohrLyCrJsiS2JVfwuiFzRxGvyfdl84Nc81JWvzY7ybAyXm8Pvo0uFsOx32oq-AIjocbHaEDbflLNwlgwKWkgdRGHssDES2M-IwsVFZrytBASo29NE66VSkLFeKIoD_ehV1alOgASZgHPWKqjQPNIK0y9QoH2rBOqA8HTxIPTzVPORTtw3Ohe_Mxt4hGwHGFxMpgOFg8-dCfculkbjy_dNSh0y1oAPDjcwJi3tljnZnwOBlFJ7MGgO4pGZCojvFTVus7DCANHTK48II-syEy91wz7e_fwlQfwYryYTfPpZP71EF46Von5V_Mees1qrY7gufjdLOvVsX1p_wHygesb
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=Byzantine+Modification+Detection+in+Multicast+Networks+With+Random+Network+Coding&rft.jtitle=IEEE+transactions+on+information+theory&rft.au=Ho%2C+T&rft.au=Leong%2C+B&rft.au=Koetter%2C+R&rft.au=Medard%2C+M&rft.date=2008-06-01&rft.pub=The+Institute+of+Electrical+and+Electronics+Engineers%2C+Inc.+%28IEEE%29&rft.issn=0018-9448&rft.eissn=1557-9654&rft.volume=54&rft.issue=6&rft.spage=2798&rft_id=info:doi/10.1109%2FTIT.2008.921894&rft.externalDBID=NO_FULL_TEXT&rft.externalDocID=1485793171
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