Byzantine Modification Detection in Multicast Networks using Randomized Network Coding
Abstract:
Distributed randomized network coding, a robust approach to multicasting in distributed network settings, can be extended to provide Byzantine modification detection without the use of cryptographic functions is presented in this paper.
Bibtex:
@inproceedings{ho04byzantine,
author = {Tracey Ho and Ben Leong and Ralf Koetter and Muriel
M{\~A}\leavevmode\hbox{\raise.6em\hbox{\copyright}}dard and
Michelle Effros and David Karger},
title = {Byzantine Modification Detection in Multicast Networks using
Randomized Network Coding},
booktitle = {Proceedings of the 2004 IEEE International Symposium on
Information Theory (ISIT)},
month = jun,
year = {2004}
}
Resilient Network Coding in the Presence of Byzantine Adversaries
Abstract:
Recent work on network coding renders a new view on multicasting in a network. In the paradigm of network coding, the nodes in a network are allowed to encode the information received from the input links. The usual function of switching at a node is a special case of network coding. The advantage of network coding is that the full capacity of the network can be utilized. In this paper, we propose a new model which incorporates network coding and information security. Specifically, a collection of subsets of links is given, and a wiretapper is allowed to access any one (but not more than one) of these subsets without being able to obtain any information about the message transmitted. Our model includes secret sharing as a special case. We present a construction of secure linear network codes provided a certain graph-theoretic sufficient condition is satisfied.
Bibtex:
@ARTICLE{jaggi2006rnc,
author = {Jaggi, S. and Langberg, M. and Katti, S. and Ho, T. and Katabi, D.
and Medard, M.},
title = {Resilient Network Coding In the Presence of Byzantine Adversaries},
year = {2006},
publisher = {Massachusetts Institute of Technology Computer Science and Artificial
Intelligence Laboratory}
}
