Byzantine Modification Detection in Multicast Networks With Random Network Coding
Tracey Ho, Ben Leong, R. Koetter, Muriel Médard, Michelle Effros, David R. Karger · IEEE Transactions on Information Theory · 2008
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.