An achievable rate region for the broadcast wiretap channel with asymmetric side information (original) (raw)

On the achievable rate region of a new Gaussian wiretap channel with side information

2012 IEEE Information Theory Workshop, 2012

A new applicable wiretap channel with separated side information is considered here which consist of a sender, a legitimate receiver and a wiretapper. In the considered scenario, the links from the transmitter to the legitimate receiver and the eavesdropper experience different conditions or channel states. So, the legitimate receiver and the wiretapper listen to the transmitted signal through the channels with different channel states which may have some correlation to each other. It is assumed that the transmitter knows the state of the main channel non-causally and uses this knowledge to encode its message. The state of the wiretap channel is not known anywhere. An achievable equivocation rate region is derived for this model and is compared to the existing works. In some special cases, the results are extended to the Gaussian wiretap channel.

The Two-Way Wiretap Channel: Achievable Regions and Experimental Results

2010

This work considers the two-way wiretap channel in which two legitimate users, Alice and Bob, wish to exchange messages securely in the presence of a passive eavesdropper Eve. In the full-duplex scenario, where each node can transmit and receive simultaneously, we obtain new achievable secrecy rate regions based on the idea of allowing the two users to jointly optimize their channel prefixing distributions and binning codebooks in addition to key sharing.

Research on the Secrecy Achievable Rate Region for the Broadcast channel with eavesdropper

Proceedings of the 1st International Workshop on Cloud Computing and Information Security, 2013

This paper considers the problems of the achievable rate regions on broadcast channel with the eavesdropper. Many articles have given the meaningful results, like the inner bound of this model. However, the specific analysis processes for this model have not been given by previous work. So we focus on the study of the secrecy achievable rate regions on broadcast channel with eavesdropper and get a detailed analysis of the inner bounder.

The Two Way Wiretap Channel: Theory and Practice

Computing Research Repository, 2010

This work considers the two-way wiretap channel in which two legitimate users, Alice and Bob, wish to exchange messages securely in the presence of a passive eavesdropper Eve. In the full-duplex scenario, where each node can transmit and receive simultaneously, we obtain new achievable secrecy rate regions based on the idea of allowing the two users to jointly optimize their channel prefixing distributions and binning codebooks in addition to key sharing.

New Results on Multiple-Input Multiple-Output Broadcast Channels With Confidential Messages

IEEE Transactions on Information Theory, 2000

This paper presents two new results on multipleinput multiple-output (MIMO) Gaussian broadcast channels with confidential messages. First, the problem of the MIMO Gaussian wiretap channel is revisited. A matrix characterization of the capacity-equivocation region is provided, which extends the previous result on the secrecy capacity of the MIMO Gaussian wiretap channel to the general, possibly imperfect secrecy setting. Next, the problem of MIMO Gaussian broadcast channels with two receivers and three independent messages: a common message intended for both receivers, and two confidential messages each intended for one of the receivers but needing to be kept asymptotically perfectly secret from the other, is considered. A precise characterization of the capacity region is provided, generalizing the previous results which considered only two out of three possible messages.

The Secrecy Capacity of the Semi-Deterministic Wiretap Channel with Three State Information

2016

Exploiting the channel state knowledge can play a fundamental role in improving security, hence a wiretap channel model with distinct channel state information is considered. In particular, it is assumed that the channel between the transmitter, the legitimate receiver and the eavesdropper is a function of three different states. One of the states is an unknown state, the second one is known to the legitimate receiver and the third state is non-causally known to the encoder. For this setting, a secrecy rate is shown to be achieved using a coding scheme based on structured binning in conjunction with a time-sharing argument. The secrecy capacity for this model is established for the specific case when the legitimate receiver's observation is a deterministic function of the the channel input and the states.

A coding theorem for secret sharing communication systems with two Gaussian wiretap channels

IEEE Transactions on Information Theory, 1991

A coding theorem is proved for the secret sharing communication system (SSCS) with two Gaussian wiretap channels. This communication system is an extension of both the SSCS with two noiseless channels and the Gaussian wiretap channel (GWC). The admissible region of rates and security levels for the SSCS with two GWC's is described by the capacities and secrecy capacities of two GWC's. Index Terms-Secret sharing communication system, wiretap channel, coding theorem.

Achievable Secrecy Rates in the Multiple Access Wiretap Channel with Deviating Users

—We consider the multiple access wiretap channel (MAC-WTC), where multiple legitimate users wish to have secure communication with a legitimate receiver in the presence of an eavesdropper. The exact secure degrees of freedom (s.d.o.f.) region of this channel is known. Achieving this region requires users to follow a certain protocol altruistically and transmit both message-carrying and cooperative jamming signals in an optimum manner. In this paper, we consider the case when a subset of users deviate from this optimum protocol. We consider two kinds of deviation: when some of the users stop transmitting cooperative jamming signals, and when a user starts sending intentional jamming signals. For the first scenario, we investigate possible responses of the remaining users to counteract such deviation. For the second scenario, we use an extensive-form game formulation for the interactions of the deviating and well-behaving users. We prove that a deviating user can drive the s.d.o.f. to zero; however, the remaining users can exploit its intentional jamming signals as cooperative jamming signals against the eavesdropper and achieve an optimum s.d.o.f.

A Note on the Secrecy Capacity of the Multiple-Antenna Wiretap Channel

IEEE Transactions on Information Theory, 2000

The secrecy capacity of the multiple-antenna wiretap channel under the average total power constraint was recently characterized, independently, by Khisti and Wornell and Oggier and Hassibi using a Sato-like argument and matrix analysis tools. This paper presents an alternative characterization of the secrecy capacity of the multiple-antenna wiretap channel under a more general matrix constraint on the channel input using a channel-enhancement argument. This characterization is by nature information-theoretic and is directly built on the intuition regarding to the optimal transmission strategy in this communication scenario.

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

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

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 R f . We shown that the secrecy capacity is bounded by