### 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 | 2009 IEEE International Symposium on Information Theory, ISIT 2009 |

Pages | 1145-1149 |

Number of pages | 5 |

DOIs | |

State | Published - Nov 19 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 |

### Publication series

Name | IEEE International Symposium on Information Theory - Proceedings |
---|---|

ISSN (Print) | 2157-8102 |

### Other

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

Country | Korea, Republic of |

City | Seoul |

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

### ASJC Scopus subject areas

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

## Fingerprint Dive into the research topics of 'The quadratic gaussian CEO problem with byzantine agents'. Together they form a unique fingerprint.

## Cite this

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