### Abstract

The quadratic Gaussian CEO problem is studied when the agents are under Byzantine attack. That is, an unknown subset of agents is controlled by an adversary that attempts to damage the quality of the estimate at the Central Estimation Officer, or CEO. Inner and outer bounds are presented for the achievable rate region as a function of the fraction of adversarial agents. The inner bound is derived from a generalization of the Berger-Tung quantize-and-bin strategy, which has been shown to be tight in the non-Byzantine case. The outer bound has similarities to the Singleton bound in that the traitorous agents must be prevented from allowing two sources to result in the same transmitted codewords if their values are too far apart for the distortion constraint to be satisfied with a single estimate. The inner and outer bounds on the rate regions are used to find bounds on the asym ptotic proportionality constant in the limit of a large number of agents and high sum-rate. These bounds on the proportionality constant differ at most by a factor of 4.

Original language | English (US) |
---|---|

Title of host publication | IEEE International Symposium on Information Theory - Proceedings |

Pages | 1145-1149 |

Number of pages | 5 |

DOIs | |

State | Published - 2009 |

Externally published | Yes |

Event | 2009 IEEE International Symposium on Information Theory, ISIT 2009 - Seoul, Korea, Republic of Duration: Jun 28 2009 → Jul 3 2009 |

### Other

Other | 2009 IEEE International Symposium on Information Theory, ISIT 2009 |
---|---|

Country | Korea, Republic of |

City | Seoul |

Period | 6/28/09 → 7/3/09 |

### Fingerprint

### ASJC Scopus subject areas

- Applied Mathematics
- Modeling and Simulation
- Theoretical Computer Science
- Information Systems

### Cite this

*IEEE International Symposium on Information Theory - Proceedings*(pp. 1145-1149). [5206013] https://doi.org/10.1109/ISIT.2009.5206013

**The quadratic gaussian CEO problem with byzantine agents.** / Kosut, Oliver; Tong, Lang.

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

*IEEE International Symposium on Information Theory - Proceedings.*, 5206013, pp. 1145-1149, 2009 IEEE International Symposium on Information Theory, ISIT 2009, Seoul, Korea, Republic of, 6/28/09. https://doi.org/10.1109/ISIT.2009.5206013

}

TY - GEN

T1 - The quadratic gaussian CEO problem with byzantine agents

AU - Kosut, Oliver

AU - Tong, Lang

PY - 2009

Y1 - 2009

N2 - The quadratic Gaussian CEO problem is studied when the agents are under Byzantine attack. That is, an unknown subset of agents is controlled by an adversary that attempts to damage the quality of the estimate at the Central Estimation Officer, or CEO. Inner and outer bounds are presented for the achievable rate region as a function of the fraction of adversarial agents. The inner bound is derived from a generalization of the Berger-Tung quantize-and-bin strategy, which has been shown to be tight in the non-Byzantine case. The outer bound has similarities to the Singleton bound in that the traitorous agents must be prevented from allowing two sources to result in the same transmitted codewords if their values are too far apart for the distortion constraint to be satisfied with a single estimate. The inner and outer bounds on the rate regions are used to find bounds on the asym ptotic proportionality constant in the limit of a large number of agents and high sum-rate. These bounds on the proportionality constant differ at most by a factor of 4.

AB - The quadratic Gaussian CEO problem is studied when the agents are under Byzantine attack. That is, an unknown subset of agents is controlled by an adversary that attempts to damage the quality of the estimate at the Central Estimation Officer, or CEO. Inner and outer bounds are presented for the achievable rate region as a function of the fraction of adversarial agents. The inner bound is derived from a generalization of the Berger-Tung quantize-and-bin strategy, which has been shown to be tight in the non-Byzantine case. The outer bound has similarities to the Singleton bound in that the traitorous agents must be prevented from allowing two sources to result in the same transmitted codewords if their values are too far apart for the distortion constraint to be satisfied with a single estimate. The inner and outer bounds on the rate regions are used to find bounds on the asym ptotic proportionality constant in the limit of a large number of agents and high sum-rate. These bounds on the proportionality constant differ at most by a factor of 4.

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

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

U2 - 10.1109/ISIT.2009.5206013

DO - 10.1109/ISIT.2009.5206013

M3 - Conference contribution

AN - SCOPUS:70449517069

SN - 9781424443130

SP - 1145

EP - 1149

BT - IEEE International Symposium on Information Theory - Proceedings

ER -