State Amplification Subject to Masking Constraints

Onur Ozan Koyluoglu, Rajiv Soundararajan, Sriram Vishwanath

Research output: Contribution to journalArticle

3 Citations (Scopus)

Abstract

This paper considers a state dependent broadcast channel with one transmitter, Alice, and two receivers, Bob and Eve. The problem is to effectively convey ('amplify') the channel state sequence to Bob while 'masking' it from Eve. The extent to which the state sequence cannot be masked from Eve is referred to as leakage. This can be viewed as a secrecy problem, where we desire that the channel state itself be minimally leaked to Eve while being communicated to Bob. This paper is aimed at characterizing the tradeoff region between amplification and leakage rates for such a system. An achievable coding scheme is presented, wherein the transmitter transmits a partial state information over the channel to facilitate the amplification process. For the case when Bob observes a stronger signal than Eve, the achievable coding scheme is enhanced with secure refinement. Outer bounds on the tradeoff region are also derived, and used in characterizing some special case results. In particular, the optimal amplification-leakage rate difference, called as differential amplification capacity, is characterized for the reversely degraded discrete memoryless channel, the degraded binary, and the degraded Gaussian channels. In addition, for the degraded Gaussian model, the extremal corner points of the tradeoff region are characterized, and the gap between the outer bound and achievable rate-regions is shown to be less than half a bit for a wide set of channel parameters.

Original languageEnglish (US)
Article number7558108
Pages (from-to)6233-6250
Number of pages18
JournalIEEE Transactions on Information Theory
Volume62
Issue number11
DOIs
StatePublished - Nov 1 2016

Fingerprint

Amplification
coding
Transmitters
secrecy
broadcast
recipient

Keywords

  • security
  • state amplification
  • State dependent channels
  • state masking

ASJC Scopus subject areas

  • Information Systems
  • Computer Science Applications
  • Library and Information Sciences

Cite this

State Amplification Subject to Masking Constraints. / Koyluoglu, Onur Ozan; Soundararajan, Rajiv; Vishwanath, Sriram.

In: IEEE Transactions on Information Theory, Vol. 62, No. 11, 7558108, 01.11.2016, p. 6233-6250.

Research output: Contribution to journalArticle

Koyluoglu, Onur Ozan ; Soundararajan, Rajiv ; Vishwanath, Sriram. / State Amplification Subject to Masking Constraints. In: IEEE Transactions on Information Theory. 2016 ; Vol. 62, No. 11. pp. 6233-6250.
@article{758580fb634c4f4bb27b0505d3c0031e,
title = "State Amplification Subject to Masking Constraints",
abstract = "This paper considers a state dependent broadcast channel with one transmitter, Alice, and two receivers, Bob and Eve. The problem is to effectively convey ('amplify') the channel state sequence to Bob while 'masking' it from Eve. The extent to which the state sequence cannot be masked from Eve is referred to as leakage. This can be viewed as a secrecy problem, where we desire that the channel state itself be minimally leaked to Eve while being communicated to Bob. This paper is aimed at characterizing the tradeoff region between amplification and leakage rates for such a system. An achievable coding scheme is presented, wherein the transmitter transmits a partial state information over the channel to facilitate the amplification process. For the case when Bob observes a stronger signal than Eve, the achievable coding scheme is enhanced with secure refinement. Outer bounds on the tradeoff region are also derived, and used in characterizing some special case results. In particular, the optimal amplification-leakage rate difference, called as differential amplification capacity, is characterized for the reversely degraded discrete memoryless channel, the degraded binary, and the degraded Gaussian channels. In addition, for the degraded Gaussian model, the extremal corner points of the tradeoff region are characterized, and the gap between the outer bound and achievable rate-regions is shown to be less than half a bit for a wide set of channel parameters.",
keywords = "security, state amplification, State dependent channels, state masking",
author = "Koyluoglu, {Onur Ozan} and Rajiv Soundararajan and Sriram Vishwanath",
year = "2016",
month = "11",
day = "1",
doi = "10.1109/TIT.2016.2605120",
language = "English (US)",
volume = "62",
pages = "6233--6250",
journal = "IEEE Transactions on Information Theory",
issn = "0018-9448",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
number = "11",

}

TY - JOUR

T1 - State Amplification Subject to Masking Constraints

AU - Koyluoglu, Onur Ozan

AU - Soundararajan, Rajiv

AU - Vishwanath, Sriram

PY - 2016/11/1

Y1 - 2016/11/1

N2 - This paper considers a state dependent broadcast channel with one transmitter, Alice, and two receivers, Bob and Eve. The problem is to effectively convey ('amplify') the channel state sequence to Bob while 'masking' it from Eve. The extent to which the state sequence cannot be masked from Eve is referred to as leakage. This can be viewed as a secrecy problem, where we desire that the channel state itself be minimally leaked to Eve while being communicated to Bob. This paper is aimed at characterizing the tradeoff region between amplification and leakage rates for such a system. An achievable coding scheme is presented, wherein the transmitter transmits a partial state information over the channel to facilitate the amplification process. For the case when Bob observes a stronger signal than Eve, the achievable coding scheme is enhanced with secure refinement. Outer bounds on the tradeoff region are also derived, and used in characterizing some special case results. In particular, the optimal amplification-leakage rate difference, called as differential amplification capacity, is characterized for the reversely degraded discrete memoryless channel, the degraded binary, and the degraded Gaussian channels. In addition, for the degraded Gaussian model, the extremal corner points of the tradeoff region are characterized, and the gap between the outer bound and achievable rate-regions is shown to be less than half a bit for a wide set of channel parameters.

AB - This paper considers a state dependent broadcast channel with one transmitter, Alice, and two receivers, Bob and Eve. The problem is to effectively convey ('amplify') the channel state sequence to Bob while 'masking' it from Eve. The extent to which the state sequence cannot be masked from Eve is referred to as leakage. This can be viewed as a secrecy problem, where we desire that the channel state itself be minimally leaked to Eve while being communicated to Bob. This paper is aimed at characterizing the tradeoff region between amplification and leakage rates for such a system. An achievable coding scheme is presented, wherein the transmitter transmits a partial state information over the channel to facilitate the amplification process. For the case when Bob observes a stronger signal than Eve, the achievable coding scheme is enhanced with secure refinement. Outer bounds on the tradeoff region are also derived, and used in characterizing some special case results. In particular, the optimal amplification-leakage rate difference, called as differential amplification capacity, is characterized for the reversely degraded discrete memoryless channel, the degraded binary, and the degraded Gaussian channels. In addition, for the degraded Gaussian model, the extremal corner points of the tradeoff region are characterized, and the gap between the outer bound and achievable rate-regions is shown to be less than half a bit for a wide set of channel parameters.

KW - security

KW - state amplification

KW - State dependent channels

KW - state masking

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

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

U2 - 10.1109/TIT.2016.2605120

DO - 10.1109/TIT.2016.2605120

M3 - Article

AN - SCOPUS:85027322143

VL - 62

SP - 6233

EP - 6250

JO - IEEE Transactions on Information Theory

JF - IEEE Transactions on Information Theory

SN - 0018-9448

IS - 11

M1 - 7558108

ER -