Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Entropy

Feeding Back the Output or Sharing the State: Which Is Better for the State-Dependent Wiretap Channel?

Bin Dai, Zheng Ma, Linman Yu

Published Nov 30, 2015• 3 citations
Publisher

Abstract

In this paper, the general wiretap channel with channel state information (CSI) at the transmitter and noiseless feedback is investigated, where the feedback is from the legitimate receiver to the transmitter, and the CSI is available at the transmitter in a causal or noncausal manner. The capacity-equivocation regions are determined for this model in both causal and noncausal cases, and the results are further explained via Gaussian and binary examples. For the Gaussian model, we find that in some particular cases, the noiseless feedback performs better than Chia and El Gamal’s CSI sharing scheme, i.e., the secrecy capacity of this feedback scheme is larger than that of the CSI sharing scheme. For the degraded binary model, we find that the noiseless feedback performs no better than Chia and El Gamal’s CSI sharing scheme. However, if the cross-over probability of the wiretap channel is large enough, we show that the two schemes perform the same.

DOI
10.3390/e17127852

Related papers

Feeding back the output or sharing state, which is better for the state-dependent degraded wiretap channel with noncausal CSI at the transmitter?

Bin Dai, Zheng Ma, Linman Yu

In this paper, we show that a noiseless feedback link from the legitimate receiver to the transmitter increases the maximum achievable secrecy rate of Chen and Han Vinck's model of the degraded wiretap channel with CSI only available at the transmitter. Moreover, we find that in some particular cases, this feedback scheme performs even better than Chia and El Gamal's CSI sharing scheme on improving the maximum achievable secrecy rate of Chen and Han Vinck's model.

International Workshop on Signal Design and its Applications in Communications•Sep 1, 2015•3 citations

Wiretap Channel in the Presence of Action-Dependent States and Noiseless Feedback

Bin Dai, A. J. Han Vinck, Yuan Luo

We investigate the wiretap channel in the presence of action-dependent states and noiseless feedback. Given the message to be communicated, the transmitter chooses an action sequence that affects the formation of the channel states and then generates the channel input sequence based on the state sequence, the message, and the noiseless feedback, where the noiseless feedback is from the output of the main channel to the channel encoder. The main channel and the wiretap channel are two discrete memoryless channels (DMCs), and they are connected with the legitimate receiver and the wiretapper, respectively. The transition probability distribution of the main channel depends on the channel state. Measuring wiretapper’s uncertainty about the message by equivocation, the capacity equivocation regions are provided both for the case where the channel inputs are allowed to depend noncausally on the state sequence and the case where they are restricted to causal dependence. Furthermore, the secrecy capacities for both cases are formulated, which provide the best transmission rate with perfect secrecy. The result is further explained via a binary example.

Journal of Applied Mathematics•Jan 1, 2013•11 citations

Wiretap Channel With Causal State Information and Secure Rate-Limited Feedback

Alejandro Cohen, Asaf Cohen

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 legitimate receiver. In addition, the legitimate receiver can send secure feedback to the transmitter at a limited rate Rf . We shown that the secrecy capacity is bounded. Moreover, when the channel to the legitimate receiver is less noisy than the channel to the eavesdropper, the bound is shown to be tight. The capacity achieving scheme is based on both the Wyner wiretap coding and two steps of shared-key generation: one from the state information and one via the noiseless feedback. Finally, we consider several special cases. When state information is available only at the legitimate receiver, the analysis suggests that unlike previous results involving feedback, it is better to use the feedback to send the state information to the transmitter (when possible), rather than send a random key.

arXiv:1308.6736•Aug 30, 2013•1 citation

The Dirty Paper Wiretap Feedback Channel with or without Action on the State

Bin Dai, Chong Li, Yingbin Liang +2 more

The dirty paper wiretap channel, also referred to as the Gaussian wiretap channel with noncausal state at the transmitter, is revisited. First, we determine the secrecy capacity of the dirty paper wiretap channel with noiseless feedback, where the feedback channel is from the legitimate receiver to the transmitter. Next, we obtain lower and upper bounds on the secrecy capacity of the action-dependent dirty paper wiretap channel with noiseless feedback, and show that these bounds meet for a special case. Unlike the fact that action on the state helps to enhance the capacity of the dirty paper channel with feedback, numerical results of this paper indicate that it may not help to enhance the secrecy capacity of the dirty paper wiretap channel with feedback.

IEEE International Symposium on Information Theory (ISIT)•Jul 1, 2019•3 citations

Impact of Action-Dependent State and Channel Feedback on Gaussian Wiretap Channels

Bin Dai, Chong Li, Yingbin Liang +2 more

We investigate the state-dependent Gaussian wiretap channel with noncausal channel state information at the transmitter (GWTC-N-CSIT), and explore whether three strategies (i.e., taking action on the state, legitimate receiver's channel output feedback, and combining the former two strategies together) help to enhance the secrecy capacity of the GWTC-N-CSIT. To be specific, we first determine the secrecy capacity of the GWTC-N-CSIT with noiseless feedback. Next, we derive lower and upper bounds on the secrecy capacity of the GWTC-N-CSIT with action-dependent state. Finally, we derive lower and upper bounds on the secrecy capacity of the GWTC-N-CSIT with both action-dependent state and noiseless feedback, and show that these bounds meet for a special case. Numerical results of this paper indicate that all three strategies enhance the secrecy capacity of the GWTC-N-CSIT. The study of this paper offers new options for enhancing the secrecy rates of the state-dependent wiretap channel models.

IEEE Transactions on Information Theory•Jan 21, 2020•27 citations

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

Alejandro Cohen, Asaf Cohen

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 legitimate receiver. In addition, the legitimate receiver can send secure feedback to the transmitter at a limited rate Rf. We shown that the secrecy capacity is bounded by Cs ≥ max {p(u|v) p(x|u,v)max min{I(U;Y|v) - I(U;Z|V) + H(V|Z) + Rf, I(U;Y|V)},p(u)p(x|u,v)max min{H(V|Z,U) + Rf, I(U;Y|V)}}. Moreover, when the channel to the legitimate receiver is less noisy than the channel to the eavesdropper, the bound is shown to be tight. The capacity achieving scheme is based on both the Wyner wiretap coding and two steps of shared-key generation: one from the state information and one via the noiseless feedback. Finally, we consider several special cases. When state information is available only at the legitimate receiver, the analysis suggests that unlike previous results involving feedback, it is better to use the feedback to send the state information to the transmitter (when possible), rather than send a random key.

Allerton Conference on Communication, Control, and Computing•Oct 1, 2013•1 citation
In this paper, the general wiretap channel with channel state information (CSI) at the transmitter and noiseless feedback is investigated, where the feedback is from the legitimate receiver to the transmitter, and the CSI is available at the transmitter in a causal or noncausal manner. The capacity-equivocation regions are determined for this model in both causal and noncausal cases, and the results are further explained via Gaussian and binary examples. For the Gaussian model, we find that in some particular cases, the noiseless feedback performs better than Chia and El Gamal’s CSI sharing scheme, i.e., the secrecy capacity of this feedback scheme is larger than that of the CSI sharing scheme. For the degraded binary model, we find that the noiseless feedback performs no better than Chia and El Gamal’s CSI sharing scheme. However, if the cross-over probability of the wiretap channel is large enough, we show that the two schemes perform the same.
We investigate the wiretap channel in the presence of action-dependent states and noiseless feedback. Given the message to be communicated, the transmitter chooses an action sequence that affects the formation of the channel states and then generates the channel input sequence based on the state sequence, the message, and the noiseless feedback, where the noiseless feedback is from the output of the main channel to the channel encoder. The main channel and the wiretap channel are two discrete memoryless channels (DMCs), and they are connected with the legitimate receiver and the wiretapper, respectively. The transition probability distribution of the main channel depends on the channel state. Measuring wiretapper’s uncertainty about the message by equivocation, the capacity equivocation regions are provided both for the case where the channel inputs are allowed to depend noncausally on the state sequence and the case where they are restricted to causal dependence. Furthermore, the secrecy capacities for both cases are formulated, which provide the best transmission rate with perfect secrecy. The result is further explained via a binary example.
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 legitimate receiver. In addition, the legitimate receiver can send secure feedback to the transmitter at a limited rate Rf . We shown that the secrecy capacity is bounded. Moreover, when the channel to the legitimate receiver is less noisy than the channel to the eavesdropper, the bound is shown to be tight. The capacity achieving scheme is based on both the Wyner wiretap coding and two steps of shared-key generation: one from the state information and one via the noiseless feedback. Finally, we consider several special cases. When state information is available only at the legitimate receiver, the analysis suggests that unlike previous results involving feedback, it is better to use the feedback to send the state information to the transmitter (when possible), rather than send a random key.
The dirty paper wiretap channel, also referred to as the Gaussian wiretap channel with noncausal state at the transmitter, is revisited. First, we determine the secrecy capacity of the dirty paper wiretap channel with noiseless feedback, where the feedback channel is from the legitimate receiver to the transmitter. Next, we obtain lower and upper bounds on the secrecy capacity of the action-dependent dirty paper wiretap channel with noiseless feedback, and show that these bounds meet for a special case. Unlike the fact that action on the state helps to enhance the capacity of the dirty paper channel with feedback, numerical results of this paper indicate that it may not help to enhance the secrecy capacity of the dirty paper wiretap channel with feedback.
We investigate the state-dependent Gaussian wiretap channel with noncausal channel state information at the transmitter (GWTC-N-CSIT), and explore whether three strategies (i.e., taking action on the state, legitimate receiver's channel output feedback, and combining the former two strategies together) help to enhance the secrecy capacity of the GWTC-N-CSIT. To be specific, we first determine the secrecy capacity of the GWTC-N-CSIT with noiseless feedback. Next, we derive lower and upper bounds on the secrecy capacity of the GWTC-N-CSIT with action-dependent state. Finally, we derive lower and upper bounds on the secrecy capacity of the GWTC-N-CSIT with both action-dependent state and noiseless feedback, and show that these bounds meet for a special case. Numerical results of this paper indicate that all three strategies enhance the secrecy capacity of the GWTC-N-CSIT. The study of this paper offers new options for enhancing the secrecy rates of the state-dependent wiretap channel models.
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 legitimate receiver. In addition, the legitimate receiver can send secure feedback to the transmitter at a limited rate Rf. We shown that the secrecy capacity is bounded by Cs ≥ max {p(u|v) p(x|u,v)max min{I(U;Y|v) - I(U;Z|V) + H(V|Z) + Rf, I(U;Y|V)},p(u)p(x|u,v)max min{H(V|Z,U) + Rf, I(U;Y|V)}}. Moreover, when the channel to the legitimate receiver is less noisy than the channel to the eavesdropper, the bound is shown to be tight. The capacity achieving scheme is based on both the Wyner wiretap coding and two steps of shared-key generation: one from the state information and one via the noiseless feedback. Finally, we consider several special cases. When state information is available only at the legitimate receiver, the analysis suggests that unlike previous results involving feedback, it is better to use the feedback to send the state information to the transmitter (when possible), rather than send a random key.