On Locating Byzantine Attackers

We examine networks that employ network coding, and are subject to Byzantine attacks. We consider systems where an appropriate network error correcting scheme is employed that is able to correct (up to a certain number of) Byzantine errors. Given this setup, we formulate the problem of locating these malicious nodes that insert errors. We utilize the subspace properties of (randomized) network coding to develop algorithms to locate the Byzantine attackers.


Published in:
In proceedgins
Presented at:
4th IEEE Workshop on Network Coding Theory and Applications (NetCod 2008), Hong Kong, January 3-4, 2008
Year:
2008
Laboratories:




 Record created 2009-11-19, last modified 2018-03-17

Fulltext:
Download fulltext
PDF.WEBLOC

Rate this document:

Rate this document:
1
2
3
 
(Not yet reviewed)