DocumentCode :
1232551
Title :
Byzantine Modification Detection in Multicast Networks With Random Network Coding
Author :
Ho, Tracey ; Ben Leong ; Koetter, Ralf ; Médard, Muriel ; Effros, Michelle ; Karger, David R.
Author_Institution :
California Inst. of Technol., Pasadena, CA
Volume :
54
Issue :
6
fYear :
2008
fDate :
6/1/2008 12:00:00 AM
Firstpage :
2798
Lastpage :
2803
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.
Keywords :
cryptography; linear codes; multicast communication; polynomials; probability; random codes; telecommunication security; Byzantine modification detection; data symbols; detection probability; hash symbols; information-theoretic approach; multicast networks; polynomial function; random linear network coding; Ad hoc networks; Associate members; Computer networks; Computer science; Information theory; Laboratories; Network coding; Peer to peer computing; Polynomials; Robustness; Byzantine adversary; multicast; network coding; network error detection;
fLanguage :
English
Journal_Title :
Information Theory, IEEE Transactions on
Publisher :
ieee
ISSN :
0018-9448
Type :
jour
DOI :
10.1109/TIT.2008.921894
Filename :
4529273
Link To Document :
بازگشت