Talking reliably, secretly, and efficiently: A "complete" characterization

Qiaosheng Eric Zhang; Swanand Kadhe; Mayank Bakshi; Sidharth Jaggi; Alex Sprintson

doi:10.1109/ITW.2015.7133143

Talking reliably, secretly, and efficiently: A "complete" characterization

Qiaosheng Eric Zhang
, Swanand Kadhe
, Mayank Bakshi
, Sidharth Jaggi
, Alex Sprintson

School of Mathematics

Research output: Chapter in Book/Report/Conference proceeding › Conference Contribution (Conference Proceeding)

12 Citations (Scopus)

Abstract

We consider reliable and secure communication of information over a multipath network. A transmitter Alice sends messages to the receiver Bob in the presence of a hidden adversary Calvin. The adversary Calvin can both eavesdrop and jam on (possibly non-identical) subsets of transmission links. The goal is to communicate reliably (intended receiver can understand the messages) and secretly (adversary cannot understand the messages). Two kinds of jamming, additive and overwrite, are considered. Additive jamming corresponds to wireless network model while overwrite jamming corresponds to wired network model and storage systems. The multipath network consists of C parallel links. Calvin can both jam and eavesdrop any z_io number of links, can eavesdrop (but not jam) any z_i/o number of links, and can jam (but not eavesdrop) any z_o/i number of links. We present the first "complete" information-theoretic characterization of maximum achievable rate as a function of the number of links that can be jammed and/or eavesdropped for equal and unequal link capacity multipath networks under additive and overwrite jamming in the large alphabet regime. Our achievability and converse proofs require non-trivial combination of information theoretic and coding theoretic ideas and our achievability schemes are computationally efficient. The PHaSE-Saving techniques¹ are used for achievability while a "stochastic" singleton bound is obtained for converse.

Original language	English
Title of host publication	2015 IEEE Information Theory Workshop, ITW 2015
Publisher	Institute of Electrical and Electronics Engineers (IEEE)
ISBN (Electronic)	9781479955268
DOIs	https://doi.org/10.1109/ITW.2015.7133143
Publication status	Published - 24 Jun 2015
Event	2015 IEEE Information Theory Workshop, ITW 2015 - Jerusalem, Israel Duration: 26 Apr 2015 → 1 May 2015

Publication series

Name	2015 IEEE Information Theory Workshop, ITW 2015

Conference

Conference	2015 IEEE Information Theory Workshop, ITW 2015
Country/Territory	Israel
City	Jerusalem
Period	26/04/15 → 1/05/15

Bibliographical note

Publisher Copyright:
© 2015 IEEE.

Access to Document

10.1109/ITW.2015.7133143

Handle.net

Persistent link

Cite this

@inproceedings{401d77677f2142129100aae28298ee32,

title = "Talking reliably, secretly, and efficiently: A {"}complete{"} characterization",

abstract = "We consider reliable and secure communication of information over a multipath network. A transmitter Alice sends messages to the receiver Bob in the presence of a hidden adversary Calvin. The adversary Calvin can both eavesdrop and jam on (possibly non-identical) subsets of transmission links. The goal is to communicate reliably (intended receiver can understand the messages) and secretly (adversary cannot understand the messages). Two kinds of jamming, additive and overwrite, are considered. Additive jamming corresponds to wireless network model while overwrite jamming corresponds to wired network model and storage systems. The multipath network consists of C parallel links. Calvin can both jam and eavesdrop any zio number of links, can eavesdrop (but not jam) any zi/o number of links, and can jam (but not eavesdrop) any zo/i number of links. We present the first {"}complete{"} information-theoretic characterization of maximum achievable rate as a function of the number of links that can be jammed and/or eavesdropped for equal and unequal link capacity multipath networks under additive and overwrite jamming in the large alphabet regime. Our achievability and converse proofs require non-trivial combination of information theoretic and coding theoretic ideas and our achievability schemes are computationally efficient. The PHaSE-Saving techniques1 are used for achievability while a {"}stochastic{"} singleton bound is obtained for converse.",

author = "Zhang, \{Qiaosheng Eric\} and Swanand Kadhe and Mayank Bakshi and Sidharth Jaggi and Alex Sprintson",

note = "Publisher Copyright: {\textcopyright} 2015 IEEE.; 2015 IEEE Information Theory Workshop, ITW 2015 ; Conference date: 26-04-2015 Through 01-05-2015",

year = "2015",

month = jun,

day = "24",

doi = "10.1109/ITW.2015.7133143",

language = "English",

series = "2015 IEEE Information Theory Workshop, ITW 2015",

publisher = "Institute of Electrical and Electronics Engineers (IEEE)",

booktitle = "2015 IEEE Information Theory Workshop, ITW 2015",

address = "United States",

}

Zhang, QE, Kadhe, S, Bakshi, M, Jaggi, S & Sprintson, A 2015, Talking reliably, secretly, and efficiently: A "complete" characterization. in 2015 IEEE Information Theory Workshop, ITW 2015., 7133143, 2015 IEEE Information Theory Workshop, ITW 2015, Institute of Electrical and Electronics Engineers (IEEE), 2015 IEEE Information Theory Workshop, ITW 2015, Jerusalem, Israel, 26/04/15. https://doi.org/10.1109/ITW.2015.7133143

Talking reliably, secretly, and efficiently: A "complete" characterization. / Zhang, Qiaosheng Eric; Kadhe, Swanand; Bakshi, Mayank et al.
2015 IEEE Information Theory Workshop, ITW 2015. Institute of Electrical and Electronics Engineers (IEEE), 2015. 7133143 (2015 IEEE Information Theory Workshop, ITW 2015).

Research output: Chapter in Book/Report/Conference proceeding › Conference Contribution (Conference Proceeding)

TY - GEN

T1 - Talking reliably, secretly, and efficiently

T2 - 2015 IEEE Information Theory Workshop, ITW 2015

AU - Zhang, Qiaosheng Eric

AU - Kadhe, Swanand

AU - Bakshi, Mayank

AU - Jaggi, Sidharth

AU - Sprintson, Alex

PY - 2015/6/24

Y1 - 2015/6/24

N2 - We consider reliable and secure communication of information over a multipath network. A transmitter Alice sends messages to the receiver Bob in the presence of a hidden adversary Calvin. The adversary Calvin can both eavesdrop and jam on (possibly non-identical) subsets of transmission links. The goal is to communicate reliably (intended receiver can understand the messages) and secretly (adversary cannot understand the messages). Two kinds of jamming, additive and overwrite, are considered. Additive jamming corresponds to wireless network model while overwrite jamming corresponds to wired network model and storage systems. The multipath network consists of C parallel links. Calvin can both jam and eavesdrop any zio number of links, can eavesdrop (but not jam) any zi/o number of links, and can jam (but not eavesdrop) any zo/i number of links. We present the first "complete" information-theoretic characterization of maximum achievable rate as a function of the number of links that can be jammed and/or eavesdropped for equal and unequal link capacity multipath networks under additive and overwrite jamming in the large alphabet regime. Our achievability and converse proofs require non-trivial combination of information theoretic and coding theoretic ideas and our achievability schemes are computationally efficient. The PHaSE-Saving techniques1 are used for achievability while a "stochastic" singleton bound is obtained for converse.

AB - We consider reliable and secure communication of information over a multipath network. A transmitter Alice sends messages to the receiver Bob in the presence of a hidden adversary Calvin. The adversary Calvin can both eavesdrop and jam on (possibly non-identical) subsets of transmission links. The goal is to communicate reliably (intended receiver can understand the messages) and secretly (adversary cannot understand the messages). Two kinds of jamming, additive and overwrite, are considered. Additive jamming corresponds to wireless network model while overwrite jamming corresponds to wired network model and storage systems. The multipath network consists of C parallel links. Calvin can both jam and eavesdrop any zio number of links, can eavesdrop (but not jam) any zi/o number of links, and can jam (but not eavesdrop) any zo/i number of links. We present the first "complete" information-theoretic characterization of maximum achievable rate as a function of the number of links that can be jammed and/or eavesdropped for equal and unequal link capacity multipath networks under additive and overwrite jamming in the large alphabet regime. Our achievability and converse proofs require non-trivial combination of information theoretic and coding theoretic ideas and our achievability schemes are computationally efficient. The PHaSE-Saving techniques1 are used for achievability while a "stochastic" singleton bound is obtained for converse.

UR - https://www.scopus.com/pages/publications/84938938405

U2 - 10.1109/ITW.2015.7133143

DO - 10.1109/ITW.2015.7133143

M3 - Conference Contribution (Conference Proceeding)

AN - SCOPUS:84938938405

T3 - 2015 IEEE Information Theory Workshop, ITW 2015

BT - 2015 IEEE Information Theory Workshop, ITW 2015

PB - Institute of Electrical and Electronics Engineers (IEEE)

Y2 - 26 April 2015 through 1 May 2015

ER -

Talking reliably, secretly, and efficiently: A "complete" characterization

Abstract

Publication series

Conference

Bibliographical note

Access to Document

Handle.net

Other files and links

Fingerprint

Cite this