Please use this identifier to cite or link to this item:
Title: Byzantine modification detection in multicast networks with random network coding
Authors: Ho, T.
Leong, B. 
Koetter, R.
Medard, M.
Effros, M.
Karger, D.R.
Keywords: Byzantine adversary
Network coding
Network error detection
Issue Date: 2008
Citation: Ho, T., Leong, B., Koetter, R., Medard, M., Effros, M., Karger, D.R. (2008). Byzantine modification detection in multicast networks with random network coding. IEEE Transactions on Information Theory 54 (6) : 2798-2803. ScholarBank@NUS Repository.
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. © 2008 IEEE.
Source Title: IEEE Transactions on Information Theory
ISSN: 00189448
DOI: 10.1109/TIT.2008.921894
Appears in Collections:Staff Publications

Show full item record
Files in This Item:
There are no files associated with this item.

Google ScholarTM



Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.