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

Journal of Applied Mathematics

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

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

Published Jan 1, 2013• 11 citations
Publisher

Abstract

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.

DOI
10.1155/2013/423619

Related papers

Wiretap Channel with Action-Dependent Channel State Information

Bin Dai, A. J. Han Vinck, Yuan Luo +1 more

In this paper, we investigate the model of wiretap channel with action-dependent channel state information. 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 and the message. 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. Moreover, the transition probability distribution of the main channel depends on the channel state. Measuring wiretapper’s uncertainty about the message by equivocation, inner and outer bounds on the capacity-equivocation region are provided both for the case where the channel inputs are allowed to depend non-causally on the state sequence and the case where they are restricted to causal dependence. Furthermore, the secrecy capacities for both cases are bounded, which provide the best transmission rate with perfect secrecy. The result is further explained via a binary example.

Entropy•Jan 28, 2013•14 citations

Wiretap Channel with Action-Dependent States and Rate-Limited Feedback

Xinxing Yin, Xiao Chen, Zhi Xue

We introduce the wiretap channel with action-dependent states and rate-limited feedback. In the new model, the state sequence is dependent on the action sequence which is selected according to the message, and a secure rate-limited feedback link is shared between the transmitter and the receiver. We obtain the capacity-equivocation region and secrecy capacity of such a channel both for the case where the channel inputs depend noncausally on the state sequence and the case where they are restricted to causal dependence. We construct the capacity-achieving coding schemes utilizing Wyner's random binning, Gel'fand and Pinsker’s coding technique, and rate splitting. Furthermore, we compare our results with the existing approaches without feedback, with noiseless feedback, and without action-dependent states. The simulation results show that the secrecy capacity of our model is bigger than that of the first two existed approaches. Besides, it is also shown that, by taking actions to affect the channel states, we guarantee the data integrity of the message transmitted in the two-stage communication systems although the tolerable overhead of transmission time is brought.

Mathematical Problems in Engineering•Jan 1, 2013•3 citations

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

Bin Dai, Zheng Ma, Linman Yu

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.

Entropy•Nov 30, 2015•3 citations

Wiretap Channel with Information Embedding on Actions

Xinxing Yin, Zhi Xue

Information embedding on actions is a new channel model in which a specific decoder is used to observe the actions taken by the encoder and retrieve part of the message intended for the receiver. We revisit this model and consider a different scenario where a secrecy constraint is imposed. By adding a wiretapper in the model, we aim to send the confidential message to the receiver and keep it secret from the wiretapper as much as possible. We characterize the inner and outer bounds on the capacity-equivocation region of such a channel with noncausal (and causal) channel state information. Furthermore, the lower and upper bounds on the sum secrecy capacity are also obtained. Besides, by eliminating the specific decoder, we get a new outer bound on the capacity-equivocation region of the wiretap channel with action-dependent states and prove it is tighter than the existing outer bound. A binary example is presented to illustrate the tradeoff between the sum secrecy rate and the information embedding rate under the secrecy constraint. We find that the secrecy constraint and the communication requirements of information embedding have a negative impact on improving the secrecy transmission rate of the given communication link.

Entropy•Apr 14, 2014•4 citations

The role of feedback in channels with information embedding on actions

Xinxing Yin, Xiao Chen, Pengze Guo +1 more

The noiseless feedback is introduced in channels with information embedding on actions. Two channel models are considered. One is wiretap channel with information embedding on actions and noiseless feedback (WT-IEANF), the other is degraded broadcast channel with noncausal action-dependent states and noiseless feedback (DBC-NADSNF). For the WT-IEANF, we characterize both inner and outer bounds on the capacity-equivocation region. For the DBC-NADSNF, an inner bound on the capacity-equivocation region is obtained, and a proper coding scheme is constructed, in which the noiseless feedback plays the role of a shared secret key between the transmitter and legal receiver. We find that the feedback does help increase the secure information transmission rates of the two models, but, at the same time, it enables the illegal receiver to get another chance to eavesdrop the private message. Besides, when secrecy constraint condition is removed, it is found that feedback is not useful for enhancing the capacity of the channel with information embedding on actions.

IEEE/CIC International Conference on Communications in China (ICCC)•Oct 1, 2014•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
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 investigate the model of wiretap channel with action-dependent channel state information. 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 and the message. 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. Moreover, the transition probability distribution of the main channel depends on the channel state. Measuring wiretapper’s uncertainty about the message by equivocation, inner and outer bounds on the capacity-equivocation region are provided both for the case where the channel inputs are allowed to depend non-causally on the state sequence and the case where they are restricted to causal dependence. Furthermore, the secrecy capacities for both cases are bounded, which provide the best transmission rate with perfect secrecy. The result is further explained via a binary example.
We introduce the wiretap channel with action-dependent states and rate-limited feedback. In the new model, the state sequence is dependent on the action sequence which is selected according to the message, and a secure rate-limited feedback link is shared between the transmitter and the receiver. We obtain the capacity-equivocation region and secrecy capacity of such a channel both for the case where the channel inputs depend noncausally on the state sequence and the case where they are restricted to causal dependence. We construct the capacity-achieving coding schemes utilizing Wyner's random binning, Gel'fand and Pinsker’s coding technique, and rate splitting. Furthermore, we compare our results with the existing approaches without feedback, with noiseless feedback, and without action-dependent states. The simulation results show that the secrecy capacity of our model is bigger than that of the first two existed approaches. Besides, it is also shown that, by taking actions to affect the channel states, we guarantee the data integrity of the message transmitted in the two-stage communication systems although the tolerable overhead of transmission time is brought.
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.
Information embedding on actions is a new channel model in which a specific decoder is used to observe the actions taken by the encoder and retrieve part of the message intended for the receiver. We revisit this model and consider a different scenario where a secrecy constraint is imposed. By adding a wiretapper in the model, we aim to send the confidential message to the receiver and keep it secret from the wiretapper as much as possible. We characterize the inner and outer bounds on the capacity-equivocation region of such a channel with noncausal (and causal) channel state information. Furthermore, the lower and upper bounds on the sum secrecy capacity are also obtained. Besides, by eliminating the specific decoder, we get a new outer bound on the capacity-equivocation region of the wiretap channel with action-dependent states and prove it is tighter than the existing outer bound. A binary example is presented to illustrate the tradeoff between the sum secrecy rate and the information embedding rate under the secrecy constraint. We find that the secrecy constraint and the communication requirements of information embedding have a negative impact on improving the secrecy transmission rate of the given communication link.
The noiseless feedback is introduced in channels with information embedding on actions. Two channel models are considered. One is wiretap channel with information embedding on actions and noiseless feedback (WT-IEANF), the other is degraded broadcast channel with noncausal action-dependent states and noiseless feedback (DBC-NADSNF). For the WT-IEANF, we characterize both inner and outer bounds on the capacity-equivocation region. For the DBC-NADSNF, an inner bound on the capacity-equivocation region is obtained, and a proper coding scheme is constructed, in which the noiseless feedback plays the role of a shared secret key between the transmitter and legal receiver. We find that the feedback does help increase the secure information transmission rates of the two models, but, at the same time, it enables the illegal receiver to get another chance to eavesdrop the private message. Besides, when secrecy constraint condition is removed, it is found that feedback is not useful for enhancing the capacity of the channel with information embedding on actions.
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.