The quadratic gaussian CEO problem with byzantine agents

Oliver Kosut, Lang Tong

Research output: Chapter in Book/Report/Conference proceedingConference contribution

2 Citations (Scopus)

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 languageEnglish (US)
Title of host publicationIEEE International Symposium on Information Theory - Proceedings
Pages1145-1149
Number of pages5
DOIs
StatePublished - 2009
Externally publishedYes
Event2009 IEEE International Symposium on Information Theory, ISIT 2009 - Seoul, Korea, Republic of
Duration: Jun 28 2009Jul 3 2009

Other

Other2009 IEEE International Symposium on Information Theory, ISIT 2009
CountryKorea, Republic of
CitySeoul
Period6/28/097/3/09

Fingerprint

Bins
Estimate
Damage
Attack
Unknown
Subset
Similarity
Generalization
Strategy

ASJC Scopus subject areas

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

Cite this

Kosut, O., & Tong, L. (2009). The quadratic gaussian CEO problem with byzantine agents. In 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.

IEEE International Symposium on Information Theory - Proceedings. 2009. p. 1145-1149 5206013.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Kosut, O & Tong, L 2009, The quadratic gaussian CEO problem with byzantine agents. in 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
Kosut O, Tong L. The quadratic gaussian CEO problem with byzantine agents. In IEEE International Symposium on Information Theory - Proceedings. 2009. p. 1145-1149. 5206013 https://doi.org/10.1109/ISIT.2009.5206013
Kosut, Oliver ; Tong, Lang. / The quadratic gaussian CEO problem with byzantine agents. IEEE International Symposium on Information Theory - Proceedings. 2009. pp. 1145-1149
@inproceedings{7bd527814f0f489e83c37f1f45344ac2,
title = "The quadratic gaussian CEO problem with byzantine agents",
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.",
author = "Oliver Kosut and Lang Tong",
year = "2009",
doi = "10.1109/ISIT.2009.5206013",
language = "English (US)",
isbn = "9781424443130",
pages = "1145--1149",
booktitle = "IEEE International Symposium on Information Theory - Proceedings",

}

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

SN - 9781424443130

SP - 1145

EP - 1149

BT - IEEE International Symposium on Information Theory - Proceedings

ER -