Optimal Secure GDoF of Symmetric Gaussian Wiretap Channel with a Helper

Chen, Jinyuan

doi:10.1109/isit.2019.8849358

Cited by 9 publications

(4 citation statements)

References 40 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…For the symmetric Gaussian WTH channel without common randomness, the secure GDoF is another modified "W" curve (cf. [19]). Without secrecy constraint, the maximal GDoF of the setting is 1.…”

Section: A Removing the Secrecy Constraintsmentioning

confidence: 99%

See 1 more Smart Citation

Adding Common Randomness Can Remove the Secrecy Constraints in Communication Networks

Li,

Chen

2019

Preprint

Self Cite

View full text Add to dashboard Cite

In communication networks secrecy constraints usually incur an extra limit in capacity or generalized degreesof-freedom (GDoF), in the sense that a penalty in capacity or GDoF is incurred due to the secrecy constraints. Over the past decades a significant amount of effort has been made by the researchers to understand the limits of secrecy constraints in communication networks. In this work, we focus on how to remove the secrecy constraints in communication networks, i.e., how to remove the GDoF penalty due to secrecy constraints. We begin with three basic settings: a two-user symmetric Gaussian interference channel with confidential messages, a symmetric Gaussian wiretap channel with a helper, and a two-user symmetric Gaussian multiple access wiretap channel. Interestingly, in this work we show that adding common randomness at the transmitters can totally remove the penalty in GDoF or GDoF region of the three settings considered here. The results reveal that adding common randomness at the transmitters is a powerful way to remove the secrecy constraints in communication networks in terms of GDoF performance. Common randomness can be generated offline. The role of the common randomness is to jam the information signal at the eavesdroppers, without causing too much interference at the legitimate receivers. To accomplish this role, a new method of Markov chain-based interference neutralization is proposed in the achievability schemes utilizing common randomness. From the practical point of view, we hope to use less common randomness to remove secrecy constraints in terms of GDoF performance. With this motivation, for most of the cases we characterize the minimal GDoF of common randomness to remove secrecy constraints, based on our derived converses and achievability.

show abstract

Section: A Removing the Secrecy Constraintsmentioning

confidence: 99%

“…For the case with 0 ≤ α ≤ 1/2, the optimal secure sum GDoF d * (α) = 1 is achievable without adding common randomness (cf. [19]). Therefore, here we will just focus on the case with α > 1/2 and prove that d(α) = 1 is achievable.…”

Section: Achievability For Wiretap Channel With a Helpermentioning

confidence: 99%

Adding Common Randomness Can Remove the Secrecy Constraints in Communication Networks

Li,

Chen

2019

Preprint

Self Cite

View full text Add to dashboard Cite

show abstract

“…In a related line of work, secure communication with a helper acting as a cooperating jammer was studied in [34], [35] (this setting is partialy equivalent to an interference channel). However, no secrecy capacity was established but only the generalized degrees of freedom (GDoF), which characterize the high-SNR scaling of the secrecy capacity and are essentially the multiplexing gain in terms of secrecy rates.…”

mentioning

confidence: 99%

“…However, no secrecy capacity was established but only the generalized degrees of freedom (GDoF), which characterize the high-SNR scaling of the secrecy capacity and are essentially the multiplexing gain in terms of secrecy rates. Unlike [34], [35], the present paper considers no jamming at all; rather, the help comes in a form of rate-limited error-free information about the noise sequence affecting the legitimate Rx, which is available to the Rx and/or Tx.…”

mentioning

confidence: 99%

The Secrecy Capacity of The Gaussian Wiretap Channel with Rate-Limited Help at the Decoder

Loyka

Merhav

2022

2022 IEEE International Symposium on Information Theory (ISIT)

View full text Add to dashboard Cite

The Gaussian wiretap channel with rate-limited help, available at the legitimate receiver (Rx) or/and transmitter (Tx), is studied under various channel configurations (degraded, reversely degraded and nondegraded). In the case of Rx help and all channel configurations, the rate-limited help results in a secrecy capacity boost equal to the help rate irrespective of whether the help is secure or not, so that the secrecy of help does not provide any capacity increase. The secrecy capacity is positive for the reversely-degraded channel (where the no-help secrecy capacity is zero) and no wiretap coding is needed to achieve it. More noise at the legitimate receiver can sometimes result in higher secrecy capacity. The secrecy capacity with Rx help is not increased even if the helper is aware of the message being transmitted. The same secrecy capacity boost also holds if non-secure help is available to the transmitter (encoder), in addition to or instead of the same Rx help, so that, in the case of the joint Tx/Rx help, one help link can be omitted without affecting the capacity. If Rx/Tx help links are independent of each other, then the boost in the secrecy capacity is the sum of help rates and no link can be omitted without a loss in the capacity.Non-singular correlation of the receiver and eavesdropper noises does not affect the secrecy capacity and non-causal help does not bring in any capacity increase over the causal one. I. INTRODUCTION Physical-layer security has emerged as a valuable alternative to cryptography-based techniques [1]-[3], especially over wireless channels and networks, and it also plays an important role in modern industrial standards [4]-[6].

show abstract

How to Break the Limits of Secrecy Constraints in Communication Networks?

Chen

2019

2019 IEEE International Symposium on Information Theory (ISIT)

View full text Add to dashboard Cite

Optimal Secure GDoF of Symmetric Gaussian Wiretap Channel with a Helper

Cited by 9 publications

References 40 publications

Adding Common Randomness Can Remove the Secrecy Constraints in Communication Networks

Adding Common Randomness Can Remove the Secrecy Constraints in Communication Networks

The Secrecy Capacity of The Gaussian Wiretap Channel with Rate-Limited Help at the Decoder

How to Break the Limits of Secrecy Constraints in Communication Networks?

Contact Info

Product

Resources

About