State Amplification Subject to Masking Constraints

• Published in: IEEE transactions on information theory Vol. 62; no. 11; pp. 6233 - 6250
• Main Authors: Koyluoglu, Onur Ozan, Soundararajan, Rajiv, Vishwanath, Sriram
• Format: Journal Article
• Language: English
• Published: New York IEEE 01.11.2016; The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
• Subjects: Amplification; Channels; Coding; Cognitive radio; Communication channels; Data transmission; Degradation; Electronic mail; Encoding; Gaussian; Leakage; Leaking of information; Masking; Normal distribution; Receivers; Security; state amplification; State dependent channels; state masking; Transmitters; Zinc
• ISSN: 0018-9448; 1557-9654
• DOI: 10.1109/TIT.2016.2605120

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.