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.

Meeting Name

2015 IEEE International Symposium on Information Theory, ISIT 2015 (2015: Jun. 14-19, Hong Kong)

Department(s)

Computer Science

Keywords and Phrases

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

International Standard Book Number (ISBN)

978-1-4673-7704-1

International Standard Serial Number (ISSN)

2157-8095; 2157-8117

Document Type

Article - Conference proceedings

Document Version

Citation

File Type

text

Language(s)

English

Rights

© 2015 Institute of Electrical and Electronics Engineers (IEEE), All rights reserved.

Publication Date

01 Jun 2015

Link to Full Text

Share

 
COinS