TY - GEN

T1 - The Byzantine CEO Problem

AU - Kosut, Oliver

AU - Tong, Lang

PY - 2008

Y1 - 2008

N2 - The CEO Problem is considered when a subset of the agents are under Byzantine attack; that is, they have been taken over and reprogrammed by a malicious intruder. Inner and outer bounds are given for the error exponent with respect to the sum rate, as a function of the fraction of reprogrammed, or traitor, agents. The inner bound is proved by introducing a coding scheme that takes advantage of the fact that the set of honest (non-traitor) agents will report jointly typical information. The CEO looks for a group with the same size as the set of honest agents that appear to do so. Even if not all the agents in this group are honest, the fact that they all agree keeps the probability of error in check. The outer bound is given in two parts, based on two different possible attacks by the traitors. The first is a black hole attack, in which the traitors simply transmit no information at all. The second is one in which they fabricate false data such that the CEO cannot determine which of two possibilities is the truth.

AB - The CEO Problem is considered when a subset of the agents are under Byzantine attack; that is, they have been taken over and reprogrammed by a malicious intruder. Inner and outer bounds are given for the error exponent with respect to the sum rate, as a function of the fraction of reprogrammed, or traitor, agents. The inner bound is proved by introducing a coding scheme that takes advantage of the fact that the set of honest (non-traitor) agents will report jointly typical information. The CEO looks for a group with the same size as the set of honest agents that appear to do so. Even if not all the agents in this group are honest, the fact that they all agree keeps the probability of error in check. The outer bound is given in two parts, based on two different possible attacks by the traitors. The first is a black hole attack, in which the traitors simply transmit no information at all. The second is one in which they fabricate false data such that the CEO cannot determine which of two possibilities is the truth.

KW - Byzantine attack

KW - Distributed source coding

KW - Network security

KW - Sensor fusion

UR - http://www.scopus.com/inward/record.url?scp=52349100560&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=52349100560&partnerID=8YFLogxK

U2 - 10.1109/ISIT.2008.4594945

DO - 10.1109/ISIT.2008.4594945

M3 - Conference contribution

AN - SCOPUS:52349100560

SN - 9781424422579

T3 - IEEE International Symposium on Information Theory - Proceedings

SP - 46

EP - 50

BT - Proceedings - 2008 IEEE International Symposium on Information Theory, ISIT 2008

T2 - 2008 IEEE International Symposium on Information Theory, ISIT 2008

Y2 - 6 July 2008 through 11 July 2008

ER -