On generalized active attacks by causal adversaries in networks

Oliver Kosut, Li Wei Kao

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

2 Citations (Scopus)

Abstract

Active attacks are studied on noise-free graphical multicast networks. A malicious adversary may enter the network and arbitrarily corrupt transmissions. A very general model is adopted for the scope of attack: a collection of sets of edges is specified, and the adversary may control any one set of edges in this collection. The adversary is assumed to be omniscient but causal, such that the adversary is forced to decide on transmissions before knowing random choices by the honest nodes. Four main results are presented. First, a precise characterization of whether any positive rate can be achieved. Second, a simple erasure upper bound. Third, an achievable bound wherein random hashes are generated and distributed, so that nodes in the network can filter out adversarial corruption. Finally, an example network is presented that has capacity strictly between the general upper and lower bounds.

Original languageEnglish (US)
Title of host publication2014 IEEE Information Theory Workshop, ITW 2014
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages247-251
Number of pages5
ISBN (Print)9781479959990
DOIs
StatePublished - Dec 1 2014
Event2014 IEEE Information Theory Workshop, ITW 2014 - Hobart, Australia
Duration: Nov 2 2014Nov 5 2014

Other

Other2014 IEEE Information Theory Workshop, ITW 2014
CountryAustralia
CityHobart
Period11/2/1411/5/14

ASJC Scopus subject areas

  • Information Systems
  • Computer Networks and Communications

Cite this

Kosut, O., & Kao, L. W. (2014). On generalized active attacks by causal adversaries in networks. In 2014 IEEE Information Theory Workshop, ITW 2014 (pp. 247-251). [6970830] Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/ITW.2014.6970830

On generalized active attacks by causal adversaries in networks. / Kosut, Oliver; Kao, Li Wei.

2014 IEEE Information Theory Workshop, ITW 2014. Institute of Electrical and Electronics Engineers Inc., 2014. p. 247-251 6970830.

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

Kosut, O & Kao, LW 2014, On generalized active attacks by causal adversaries in networks. in 2014 IEEE Information Theory Workshop, ITW 2014., 6970830, Institute of Electrical and Electronics Engineers Inc., pp. 247-251, 2014 IEEE Information Theory Workshop, ITW 2014, Hobart, Australia, 11/2/14. https://doi.org/10.1109/ITW.2014.6970830
Kosut O, Kao LW. On generalized active attacks by causal adversaries in networks. In 2014 IEEE Information Theory Workshop, ITW 2014. Institute of Electrical and Electronics Engineers Inc. 2014. p. 247-251. 6970830 https://doi.org/10.1109/ITW.2014.6970830
Kosut, Oliver ; Kao, Li Wei. / On generalized active attacks by causal adversaries in networks. 2014 IEEE Information Theory Workshop, ITW 2014. Institute of Electrical and Electronics Engineers Inc., 2014. pp. 247-251
@inproceedings{e382436ec9b1404eada07de80d49d8d6,
title = "On generalized active attacks by causal adversaries in networks",
abstract = "Active attacks are studied on noise-free graphical multicast networks. A malicious adversary may enter the network and arbitrarily corrupt transmissions. A very general model is adopted for the scope of attack: a collection of sets of edges is specified, and the adversary may control any one set of edges in this collection. The adversary is assumed to be omniscient but causal, such that the adversary is forced to decide on transmissions before knowing random choices by the honest nodes. Four main results are presented. First, a precise characterization of whether any positive rate can be achieved. Second, a simple erasure upper bound. Third, an achievable bound wherein random hashes are generated and distributed, so that nodes in the network can filter out adversarial corruption. Finally, an example network is presented that has capacity strictly between the general upper and lower bounds.",
author = "Oliver Kosut and Kao, {Li Wei}",
year = "2014",
month = "12",
day = "1",
doi = "10.1109/ITW.2014.6970830",
language = "English (US)",
isbn = "9781479959990",
pages = "247--251",
booktitle = "2014 IEEE Information Theory Workshop, ITW 2014",
publisher = "Institute of Electrical and Electronics Engineers Inc.",

}

TY - GEN

T1 - On generalized active attacks by causal adversaries in networks

AU - Kosut, Oliver

AU - Kao, Li Wei

PY - 2014/12/1

Y1 - 2014/12/1

N2 - Active attacks are studied on noise-free graphical multicast networks. A malicious adversary may enter the network and arbitrarily corrupt transmissions. A very general model is adopted for the scope of attack: a collection of sets of edges is specified, and the adversary may control any one set of edges in this collection. The adversary is assumed to be omniscient but causal, such that the adversary is forced to decide on transmissions before knowing random choices by the honest nodes. Four main results are presented. First, a precise characterization of whether any positive rate can be achieved. Second, a simple erasure upper bound. Third, an achievable bound wherein random hashes are generated and distributed, so that nodes in the network can filter out adversarial corruption. Finally, an example network is presented that has capacity strictly between the general upper and lower bounds.

AB - Active attacks are studied on noise-free graphical multicast networks. A malicious adversary may enter the network and arbitrarily corrupt transmissions. A very general model is adopted for the scope of attack: a collection of sets of edges is specified, and the adversary may control any one set of edges in this collection. The adversary is assumed to be omniscient but causal, such that the adversary is forced to decide on transmissions before knowing random choices by the honest nodes. Four main results are presented. First, a precise characterization of whether any positive rate can be achieved. Second, a simple erasure upper bound. Third, an achievable bound wherein random hashes are generated and distributed, so that nodes in the network can filter out adversarial corruption. Finally, an example network is presented that has capacity strictly between the general upper and lower bounds.

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

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

U2 - 10.1109/ITW.2014.6970830

DO - 10.1109/ITW.2014.6970830

M3 - Conference contribution

AN - SCOPUS:84929353222

SN - 9781479959990

SP - 247

EP - 251

BT - 2014 IEEE Information Theory Workshop, ITW 2014

PB - Institute of Electrical and Electronics Engineers Inc.

ER -