# Wiretap and Gelfand-Pinsker Channels Analogy and Its Applications

@article{Goldfeld2019WiretapAG, title={Wiretap and Gelfand-Pinsker Channels Analogy and Its Applications}, author={Ziv Goldfeld and Haim H. Permuter}, journal={IEEE Transactions on Information Theory}, year={2019}, volume={65}, pages={4979-4996} }

An analogy framework 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 sequence of stealth-wiretap codes is shown to induce a good 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 analogy readily extends to multiuser broadcasting… Expand

#### 2 Citations

A Useful Analogy Between Wiretap and Gelfand - Pinsker Channels

- Computer Science
- 2018 IEEE International Symposium on Information Theory (ISIT)
- 2018

The framework enables exploiting existing results for GPCs to produce converse proofs for their wiretap analogs, and is exploited to characterize the secrecy-capacity regions of the semideterministic WTBC and a class of physically degraded WTBC. Expand

The Secrecy Capacity of Cost-Constrained Wiretap Channels

- Computer Science, Mathematics
- IEEE Transactions on Information Theory
- 2021

This paper first derive the secrecy-capacity formula, proving the direct part via superposition coding, and provides an example of a CC DM-WTC whose secrecy- capacity cannot be achieved using a single auxiliary. Expand

#### References

SHOWING 1-10 OF 70 REFERENCES

Wiretap channels with random states non-causally available at the encoder

- Computer Science, Mathematics
- 2016 IEEE International Conference on the Science of Electrical Engineering (ICSEE)
- 2016

A lower bound on the secrecy-capacity, that improves upon the previously best known result by Chen and Han Vinck, is derived based on a novel superposition coding scheme and reveals that it is at least as good as the achievable formula by Chia and El-Gamal. Expand

Reliability and Secrecy Functions of the Wiretap Channel Under Cost Constraint

- Computer Science, Mathematics
- IEEE Transactions on Information Theory
- 2014

The notion of reliability and secrecy functions are newly introduced as a fundamental tool to analyze and/or design the performance of an efficient wiretap channel system, including binary symmetric wiretap channels, Poisson wiretaps channels, and Gaussian wiretAP channels. Expand

On the duality between state-dependent channels and wiretap channels

- Computer Science, Mathematics
- 2016 IEEE Global Conference on Signal and Information Processing (GlobalSIP)
- 2016

This duality is used to establish the secrecy capacity of certain state-dependent wiretap channels with non-causal channel state information at the transmitter. Expand

Capacity of the State-Dependent Wiretap Channel: Secure Writing on Dirty Paper

- Computer Science, Mathematics
- ArXiv
- 2016

The main idea is to model the SD-WC as a Cognitive Interference Channel (CIC), in which the primary receiver acts as an eavesdropper for the cognitive transmitter's message, and show that the main achievability approaches of CIC meet the capacity under some constraints on the rate of the channel state. Expand

Wiretap Channel With Side Information

- Computer Science, Mathematics
- ArXiv
- 2006

This paper finds the capacity region for (R,d) pairs, and in particular, if d is equal to Hs, the entropy of the data source, then it is implied that reliable transmission at rates up to C s is possible in perfect secrecy. Expand

Semantic-security capacity for wiretap channels of type II

- Computer Science, Mathematics
- 2016 IEEE International Symposium on Information Theory (ISIT)
- 2016

The direct proof shows that rates up to the weak-secrecy capacity of the classic WTC with a DM erasure channel to the eavesdropper are achievable and establishes the capacity of this DM wiretap EC as an upper bound for the WTC II. Expand

The wire-tap channel

- Computer Science
- The Bell System Technical Journal
- 1975

This paper finds the trade-off curve between R and d, assuming essentially perfect (“error-free”) transmission, and implies that there exists a Cs > 0, such that reliable transmission at rates up to Cs is possible in approximately perfect secrecy. Expand

Cooperative Multiple-Access Encoding With States Available at One Transmitter

- Computer Science, Mathematics
- IEEE Transactions on Information Theory
- 2008

The Gel'fand-Pinsker model is generalized to encompass the setup of a memoryless multiple-access channel (MAC), and explicit characterizations of the capacity region with both noncausal and causal state information are found. Expand

Cooperative Multiple-Access Encoding With States Available at One Transmitter

- Mathematics, Computer Science
- IEEE Trans. Inf. Theory
- 2008

The Gel'fand-Pinsker model is generalized to encompass the setup of a memoryless multiple-access channel (MAC), and explicit characterizations of the capacity region with both noncausal and causal state information are found. Expand

One-shot achievability via fidelity

- Mathematics, Computer Science
- 2015 IEEE International Symposium on Information Theory (ISIT)
- 2015

A universal framework for establishing one-shot achievability results for coordination and secrecy problems uses fidelity as a criterion for measuring the closeness of induced distribution with the ideal distribution. Expand