Information-dispersal games for security in cognitive-radio networks

V. Sriram Siddhardh Nadendla; Yunghsiang S. Han; Pramod Kumar Varshney

doi:10.1109/ISIT.2015.7282726

Information-dispersal games for security in cognitive-radio networks

V. Sriram Siddhardh Nadendla, Yunghsiang S. Han, Pramod Kumar Varshney

Department of Electrical Engineering & Computer Science

Research output: Chapter in Book/Entry/Poem › Conference contribution

2 Scopus citations

Abstract

Rabin's information dispersal algorithm (IDA) simultaneously addresses secrecy and fault-tolerance by encoding a data file and parsing it into unrecognizable data-packets before transmitting or storing them in a network. In this paper, we redesign Rabin's IDA for cognitive-radio networks where the routing paths are available with uncertainty. In addition, we also assume the presence of an attacker in the network which attempts to simultaneously compromise the confidentiality and data-integrity of the source message. Due to the presence of two rational entities with conflicting motives, we model the problem as a zero-sum game between the source and the attacker and investigate the mixed-strategy Nash Equilibrium by decoupling the game into two linear programs which have a primal-dual relationship.

Original language	English (US)
Title of host publication	IEEE International Symposium on Information Theory - Proceedings
Publisher	Institute of Electrical and Electronics Engineers Inc.
Pages	1600-1604
Number of pages	5
Volume	2015-June
ISBN (Print)	9781467377041
DOIs	https://doi.org/10.1109/ISIT.2015.7282726
State	Published - Sep 28 2015
Event	IEEE International Symposium on Information Theory, ISIT 2015 - Hong Kong, Hong Kong Duration: Jun 14 2015 → Jun 19 2015

Other

Other	IEEE International Symposium on Information Theory, ISIT 2015
Country/Territory	Hong Kong
City	Hong Kong
Period	6/14/15 → 6/19/15

Keywords

Byzantine Attacks
Cognitive-Radio Networks
File-Sharing Networks
Information Dispersal Games
Reed-Solomon Codes

ASJC Scopus subject areas

Applied Mathematics
Modeling and Simulation
Theoretical Computer Science
Information Systems

Access to Document

10.1109/ISIT.2015.7282726

Cite this

Information-dispersal games for security in cognitive-radio networks. / Nadendla, V. Sriram Siddhardh; Han, Yunghsiang S.; Varshney, Pramod Kumar.
IEEE International Symposium on Information Theory - Proceedings. Vol. 2015-June Institute of Electrical and Electronics Engineers Inc., 2015. p. 1600-1604 7282726.

Research output: Chapter in Book/Entry/Poem › Conference contribution

Nadendla, VSS, Han, YS & Varshney, PK 2015, Information-dispersal games for security in cognitive-radio networks. in IEEE International Symposium on Information Theory - Proceedings. vol. 2015-June, 7282726, Institute of Electrical and Electronics Engineers Inc., pp. 1600-1604, IEEE International Symposium on Information Theory, ISIT 2015, Hong Kong, Hong Kong, 6/14/15. https://doi.org/10.1109/ISIT.2015.7282726

@inproceedings{db7069ef6ffc4b62b395111c5781f4fe,

title = "Information-dispersal games for security in cognitive-radio networks",

abstract = "Rabin's information dispersal algorithm (IDA) simultaneously addresses secrecy and fault-tolerance by encoding a data file and parsing it into unrecognizable data-packets before transmitting or storing them in a network. In this paper, we redesign Rabin's IDA for cognitive-radio networks where the routing paths are available with uncertainty. In addition, we also assume the presence of an attacker in the network which attempts to simultaneously compromise the confidentiality and data-integrity of the source message. Due to the presence of two rational entities with conflicting motives, we model the problem as a zero-sum game between the source and the attacker and investigate the mixed-strategy Nash Equilibrium by decoupling the game into two linear programs which have a primal-dual relationship.",

keywords = "Byzantine Attacks, Cognitive-Radio Networks, File-Sharing Networks, Information Dispersal Games, Reed-Solomon Codes",

author = "Nadendla, {V. Sriram Siddhardh} and Han, {Yunghsiang S.} and Varshney, {Pramod Kumar}",

year = "2015",

month = sep,

day = "28",

doi = "10.1109/ISIT.2015.7282726",

language = "English (US)",

isbn = "9781467377041",

volume = "2015-June",

pages = "1600--1604",

booktitle = "IEEE International Symposium on Information Theory - Proceedings",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

note = "IEEE International Symposium on Information Theory, ISIT 2015 ; Conference date: 14-06-2015 Through 19-06-2015",

}

TY - GEN

T1 - Information-dispersal games for security in cognitive-radio networks

AU - Nadendla, V. Sriram Siddhardh

AU - Han, Yunghsiang S.

AU - Varshney, Pramod Kumar

PY - 2015/9/28

Y1 - 2015/9/28

N2 - Rabin's information dispersal algorithm (IDA) simultaneously addresses secrecy and fault-tolerance by encoding a data file and parsing it into unrecognizable data-packets before transmitting or storing them in a network. In this paper, we redesign Rabin's IDA for cognitive-radio networks where the routing paths are available with uncertainty. In addition, we also assume the presence of an attacker in the network which attempts to simultaneously compromise the confidentiality and data-integrity of the source message. Due to the presence of two rational entities with conflicting motives, we model the problem as a zero-sum game between the source and the attacker and investigate the mixed-strategy Nash Equilibrium by decoupling the game into two linear programs which have a primal-dual relationship.

AB - Rabin's information dispersal algorithm (IDA) simultaneously addresses secrecy and fault-tolerance by encoding a data file and parsing it into unrecognizable data-packets before transmitting or storing them in a network. In this paper, we redesign Rabin's IDA for cognitive-radio networks where the routing paths are available with uncertainty. In addition, we also assume the presence of an attacker in the network which attempts to simultaneously compromise the confidentiality and data-integrity of the source message. Due to the presence of two rational entities with conflicting motives, we model the problem as a zero-sum game between the source and the attacker and investigate the mixed-strategy Nash Equilibrium by decoupling the game into two linear programs which have a primal-dual relationship.

KW - Byzantine Attacks

KW - Cognitive-Radio Networks

KW - File-Sharing Networks

KW - Information Dispersal Games

KW - Reed-Solomon Codes

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

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

U2 - 10.1109/ISIT.2015.7282726

DO - 10.1109/ISIT.2015.7282726

M3 - Conference contribution

AN - SCOPUS:84969779611

SN - 9781467377041

VL - 2015-June

SP - 1600

EP - 1604

BT - IEEE International Symposium on Information Theory - Proceedings

PB - Institute of Electrical and Electronics Engineers Inc.

T2 - IEEE International Symposium on Information Theory, ISIT 2015

Y2 - 14 June 2015 through 19 June 2015

ER -

Information-dispersal games for security in cognitive-radio networks

Abstract

Other

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this