Wiretap Channel With Two-Sided Channel State Information

Liu, Wei; Chen, Biao

doi:10.1109/acssc.2007.4487347

Cited by 43 publications

(78 citation statements)

References 6 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Since (20) is an increasing function of ρ, the value of ρ obtained from (21) verifies (121) and maximizes (20). This concludes the proof of Proposition 11.…”

Section: Appendix E Proof Of Proposition 11supporting

confidence: 70%

See 1 more Smart Citation

Secret key generation over noisy channels with common randomness

Bassi¹,

Piantanida²,

Shamai³

2016

2016 IEEE International Symposium on Information Theory (ISIT)

View full text Add to dashboard Cite

This paper investigates the problem of secret key generation over a wiretap channel when the terminals observe correlated sources. These sources may or may not be independent of the main channel and the users overhear them before the transmission takes place. A novel achievable scheme for the case of independent sources is proposed, and it is shown to be optimal under certain less noisy conditions. This result improves upon the existing literature where the more stringent condition of degradedness was needed. For the situation where the sources are correlated with the main channel, a second achievable scheme based on joint source-channel coding is introduced, for which special cases of binary and Gaussian channels are studied. Some optimality results are derived, however, these are much less general than for the first setup.

show abstract

“…Since (20) is an increasing function of ρ, the value of ρ obtained from (21) verifies (121) and maximizes (20). This concludes the proof of Proposition 11.…”

Section: Appendix E Proof Of Proposition 11supporting

confidence: 70%

“…Liu and Chen's [20] analysis of the wiretap channel with state. These works employ Gelfand and Pinsker's scheme [21] to correlate the transmitted codeword with the channel state at the same time it saturates the eavesdropper's decoding capabilities.…”

mentioning

confidence: 99%

Secret key generation over noisy channels with common randomness

Bassi¹,

Piantanida²,

Shamai³

2016

2016 IEEE International Symposium on Information Theory (ISIT)

View full text Add to dashboard Cite

show abstract

“…Thus, we conjecture that by case 4 in [5], [7], and when adding the secure rate limited feedback, the resulting bound is …”

Section: Causal State Information Only At the Legitimate Decodermentioning

confidence: 92%

Wiretap channel with causal state information and secure rate-limited feedback

Cohen

2013

2013 51st Annual Allerton Conference on Communication, Control, and Computing (Allerton)

View full text Add to dashboard Cite

Abstract-In this paper, we consider the secrecy capacity of a wiretap channel in the presence of causal state information and secure rate-limited feedback. In this scenario, the causal state information from the channel is available to both the legitimate transmitter and the legitimate receiver. In addition, the legitimate receiver can send secure feedback to the transmitter at a limited rate R f .We derive upper and lower bounds on the secrecy capacity and show that, when the channel to the eavesdropper is degraded, the bounds are tight and the secrecy capacity is completely characterised.The capacity achieving scheme is based on Wyner, Csiszár and Körner wiretap coding and two steps of shared-key generation: one from the state information and one via the noiseless feedback. The upper bound is more involved and requires a non-trivial recursive lemma extending previous results in the literature to include both state and feedback. We conclude the paper by showing that a few interesting known results can be seen as special cases of the above, especially the case where the state information is available only at the decoder, and the suggested scheme achieves the secrecy capacity without a source of randomness at the decoder.

show abstract

“…Formula (10) can be obtained from (11). Hence, according to the definition of secrecy capacity and (11), formula (7) is proved.…”

Section: Discussion Andmentioning

confidence: 99%

“…Dai and Luo improved the results of [8] by providing upper bounds on the secrecy capacity [10]. Liu and Chen got a lower bound on the secrecy capacity of the model where CSI was available noncausally at both the encoder and the decoder [11], and an upper bound was established by [12]. Action-dependent channel models involving secrecy were studied in [13][14][15].…”

Section: Introductionmentioning

confidence: 99%

Wiretap Channel with Rate-Limited Channel State Information

Yin

Pang

Zhi

2015

Mathematical Problems in Engineering

View full text Add to dashboard Cite

We revisit a channel coding problem where the channel state information (CSI) is rate-limited (or coded) and available to the channel encoder. A wiretapper is added into this model, and the confidential message is intended only for the legal receiver and should be kept from being eavesdropped by the wiretapper. Equivocation analysis is provided to evaluate the level of information leakage to the wiretapper. We characterize an achievable rate-equivocation region as well as an outer bound for this security model. To achieve the rate-equivocation triples, we propose an efficient coding scheme, in which the coded CSI serves as the CSI for the channel encoder, based on Gel'fand and Pinsker's coding and Wyner's random coding. Furthermore, an example of Gaussian wiretap channel with rate-limited CSI is presented, of which a lower bound on the secrecy capacity is obtained. By simulation, we find there exists an optimal rate of the coded CSI at which the biggest secrecy transmission rate of the Gaussian case is achieved.

show abstract

Wiretap Channel With Two-Sided Channel State Information

Cited by 43 publications

References 6 publications

Secret key generation over noisy channels with common randomness

Secret key generation over noisy channels with common randomness

Wiretap channel with causal state information and secure rate-limited feedback

Wiretap Channel with Rate-Limited Channel State Information

Contact Info

Product

Resources

About