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!
Description
Summary: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.
Bibliography:SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ObjectType-Article-2
content type line 23
ISSN:0018-9448
1557-9654
DOI:10.1109/TIT.2008.921894