Wiretap and Gelfand-Pinsker Channels Analogy and its Applications

12/29/2017
by   Ziv Goldfeld, et al.
0

A framework of analogy between wiretap channels (WTCs) and state-dependent point-to-point channels with non-causal encoder channel state information (referred to as Gelfand-Pinker channels (GPCs)) is proposed. A good (reliable and secure) sequence of wiretap codes is shown to induce a good (reliable) sequence of codes for a corresponding GPC. Consequently, the framework enables exploiting existing results for GPCs to produce converse proofs for their wiretap analogs. The fundamental limits of communication of analogous wiretap and GP models are characterized by the same rate bounds; the optimization domains may differ. The analogy readily extends to multiuser broadcasting scenarios, encompassing broadcast channels (BCs) with deterministic components, degradation ordering between users, and BCs with cooperative receivers. Given a wiretap BC (WTBC) with two receivers and one eavesdropper, an analogous Gelfand-Pinsker BC (GPBC) is constructed by converting the eavesdropper's observations to a state sequence with an appropriate product distribution, and non-causally revealing the states to the encoder. The transition matrix of the (state-dependent) GPBC is the appropriate conditional marginal of the WTBC's transition law, with the eavesdropper's output playing the role of the channel state. Past capacity results for the semi-deterministic (SD) GPBC and the physically-degraded (PD) GPBC with an informed receiver are leveraged to furnish analogy-based converse proofs for the analogous WTBC setups. This characterizes the secrecy-capacity regions of the SD-WTBC, which was an open problem until this work, as well as the PD-WTBC where the stronger receiver also observes the eavesdropper's channel output. These new derivations exemplify the strength of the wiretap-GP analogy as a research tool through which results on one problem directly translate into advances in the study of the other.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
02/15/2021

Undoing Causal Effects of a Causal Broadcast Channel with Cooperating Receivers using Entanglement Resources

We analyse a communication scenario over a particular causal broadcast c...
research
12/03/2017

Arbitrarily Varying Wiretap Channel with State Sequence Known or Unknown at the Receiver

The secrecy capacity problems over the general arbitrarily varying wiret...
research
07/15/2021

The Feedback Capacity of Noisy Output is the STate (NOST) Channels

We consider finite-state channels (FSCs) where the channel state is stoc...
research
12/11/2017

On Stochastic Orders and Fast Fading Multiuser Channels with Statistical CSIT

In this paper, we investigate the ergodic capacity of fast fading Gaussi...
research
04/18/2020

Securing Multi-User Broadcast Wiretap Channels with Finite CSI Feedback

In this work, we investigate the problem of secure broadcasting over blo...
research
07/10/2018

Parallel Gaussian Channels Corrupted by Independent States With a State-Cognitive Helper

We consider a state-dependent parallel Gaussian channel with independent...
research
12/17/2018

State Leakage and Coordination of Actions: Core of the Receiver's Knowledge

We revisit the problems of state masking and state amplification through...

Please sign up or login with your details

Forgot password? Click here to reset