Wiretap Broadcast Channel Research Articles

STAR-RIS aided Secure Communication for Endogenous Wiretap Broadcast Channels with Two Users

STAR-RIS aided Secure Communication for Endogenous Wiretap Broadcast Channels with Two Users

Two-User Gaussian Broadcast Wiretap Channel With Common Message and Feedback: Revisit

Two-User Gaussian Broadcast Wiretap Channel With Common Message and Feedback: Revisit

Gaussian Multiuser Wiretap Channels in the Presence of a Jammer-Aided Eavesdropper.

This paper considers secure communication in the presence of an eavesdropper and a malicious jammer. The jammer is assumed to be oblivious of the communication signals emitted by the legitimate transmitter(s) but can employ any jamming strategy subject to a given power constraint and shares her jamming signal with the eavesdropper. Four such models are considered: (i) the Gaussian point-to-point wiretap channel; (ii) the Gaussian multiple-access wiretap channel; (iii) the Gaussian broadcast wiretap channel; and (iv) the Gaussian symmetric interference wiretap channel. The use of pre-shared randomness between the legitimate users is not allowed in our models. Inner and outer bounds are derived for these four models. For (i), the secrecy capacity is obtained. For (ii) and (iv) under a degraded setup, the optimal secrecy sum-rate is characterized. Finally, for (iii), ranges of model parameter values for which the inner and outer bounds coincide are identified.

Securing Multi-User Broadcast Wiretap Channels With Finite CSI Feedback

In this work, we investigate the problem of secure broadcasting over block-fading wiretap channels with limited channel knowledge at the transmitter. More particularly, we analyze the effect of having a finite rate feedback on the throughput of multi-user broadcast wiretap channels. We consider that the transmitter is only provided by a $b$-bits feedback of the main channel state information (CSI) sent by each legitimate receiver, at the beginning of each fading block, over error-free public links with limited capacity. Also, we assume that the transmitter is aware of the statistics of the eavesdropper's CSI but not of its channel's realizations. Under these assumptions of CSI uncertainty, we characterize the ergodic secrecy capacity of the system when a common message is broadcasted to all legitimate receivers, the ergodic secrecy sum-capacity when multiple independent messages are transmitted, and the ergodic secrecy capacity region for the broadcast channel with confidential messages (BCCM). In all three scenarios, we show that as long as the transmitter has some knowledge of the main CSI, obtained even through a 1-bit CSI feedback, a non-zero secrecy rate can still be achieved. The impact of having the feedback sent over a binary erasure channel (BEC) is also investigated for the BCCM case. Here again, and even with the possibility of having the feedback bits erased, a positive secrecy rate can still be achieved as long as the erasure event is not a probability-one event. An asymptotic analysis of the obtained results is provided for the high SNR regime, and the scaling law of the system, when the number of legitimate receivers is large, is also presented.

Polar Coding for Confidential Broadcasting.

A polar coding scheme is proposed for the Wiretap Broadcast Channel with two legitimate receivers and one eavesdropper. We consider a model in which the transmitter wishes to send the same private (non-confidential) message and the same confidential message reliably to two different legitimate receivers, and the confidential message must also be (strongly) secured from the eavesdropper. The coding scheme aims to use the optimal rate of randomness and does not make any assumption regarding the symmetry or degradedness of the channel. This paper extends previous work on polar codes for the wiretap channel by proposing a new chaining construction that allows to reliably and securely send the same confidential message to two different receivers. This construction introduces new dependencies between the random variables involved in the coding scheme that need to be considered in the secrecy analysis.

Wiretap and Gelfand-Pinsker Channels Analogy and Its Applications

An analogy framework between wiretap channels (WTCs) and state-dependent point-to-point channels with non-causal encoder channel state information (referred to as Gelfand-Pinker channels (GPCs)) is proposed. A good sequence of stealth-wiretap codes is shown to induce a good sequence of codes for a corresponding GPC. Consequently, the framework enables exploiting existing results for GPCs to produce converse proofs for their wiretap analogs. The analogy readily extends to multiuser broadcasting scenarios, encompassing broadcast channels (BCs) with deterministic components, degradation ordering between users, and BCs with cooperative receivers. Given a wiretap BC (WTBC) with two receivers and one eavesdropper, an analogous Gelfand-Pinsker BC (GPBC) is constructed by converting the eavesdropper's observation sequence into a state sequence with an appropriate product distribution (induced by the stealth-wiretap code for the WTBC), and non-causally revealing the states to the encoder. The transition matrix of the state-dependent GPBC is extracted from WTBC's transition law, with the eavesdropper's output playing the role of the channel state. Past capacity results for the semi-deterministic (SD) GPBC and the physically-degraded (PD) GPBC with an informed receiver are leveraged to furnish analogy-based converse proofs for the analogous WTBC setups. This characterizes the secrecy-capacity regions of the SD-WTBC and the PD-WTBC, in which the stronger receiver also observes the eavesdropper's channel output. These derivations exemplify how the wiretap-GP analogy enables translating results on one problem into advances in the study of the other.

Private Key and Group Key Generation Using Correlated Sources and Wiretap Broadcast Channel in Presence of One-Way Public Communication

Encryption with shared key is one of the methods to ensure secure communication. To meet the requirements of keys, this paper investigates the problem of generating private key (PK) and group key (GK) using correlated sources and discrete memoryless wiretap broadcast channel (DM-WBC), in presence of one-way public communication. In the model considered, one transmitter (Alice) and three receivers (Bob, Carol and Eve) are connected via a DM-WBC, and a one-way communication over a public noiseless channel, initiated by Alice, is available. Alice and Bob wish to share a PK that is concealed from Carol and Eve, and they also want to generate a GK with Carol that needs to keep secret from Eve. Under this model, the key capacity regions of PK and GK are established by designing joint source-channel coding schemes to achieve these regions. In PK-generation, the considered model can be viewed as a one receiver two-eavesdropper model, and Alice and Bob have access to correlated source sequences. In GK-generation, the considered model can be viewed as a two-receiver one eavesdropper model, and the three legitimate parties (Alice, Bob and Carol) all have the source observations. Furthermore, the security performance of the generated keys are analyzed by analyzing key leakage rate of each key.

Optimal Power Allocation for Secrecy Rate Maximization in Broadcast Wiretap Channels

We investigate physical layer security in wireless communication networks, where a transmitter Alice sends a confidential message to an intended user Bob, while coexisting with a normal transmitter DT, a normal receiver DR, and a passive eavesdropper Eve. Compared with the conventional cooperative jamming (CJ) scheme, DT has dual responsibilities. One is to broadcast public information to its service subscriber DR, and the other is to confound the unauthorized eavesdropper Eve to ensure desired secure communication. Considering the secrecy outage restriction of Bob and the quality of service demand of DR, we propose an optimal resource management strategy. Users with different security requirements take hierarchical secure measures. For example, banking transaction needs to adopt high strength security measures, and personal voice communication resorts to low-level security protection strategies. Numerical simulations show that the proposed secure design outperforms the CJ scheme in terms of effective service rate and effective energy efficiency with a little secrecy rate loss, which is suitable for the low-level security real-time communication.

Secure Transmission in MISOME Wiretap Channel With Multiple Assisting Jammers: Maximum Secrecy Rate and Optimal Power Allocation

This paper investigates the secrecy rate maximization problem for the multiple-input-single-output multiple-antenna-eavesdropper (MISOME) wiretap channel with multiple randomly located jammers. The multi-antenna base station (BS) transmits information signals along with artificial noise (AN) to disturb the eavesdropper. Moreover, the friendly jammers are properly selected to assist the legitimate link for better secure transmission with some payoffs. With this system model, we first formulate a Stackelberg game between the BS and the assisting jammers with full channel state information. Stackelberg equilibriums, including optimal fraction of transmit power for AN, optimal transmit power, and asking prices of assisting jammers, are first proved to exist and then analytically derived. A policy iterative algorithm is also proposed to obtain the optimal solutions. We then extend the Stackelberg game to the case of MISOME broadcast wiretap channel with channel distribution information of eavesdropper. Numerical results verify the accuracy of the derived results and the efficiency of the proposed algorithm. The results reveal that the proposed jammer-assisted secure transmission can greatly improve the secrecy performance and meanwhile save more energy for information signals, which is significant for future wireless communication.

Physical Layer Security Based on Interference Alignment in K-User MIMO Y Wiretap Channels

This paper studies the secure degree of freedom (SDOF) of the multiway relay wiretap system $K$ -user MIMO Y wiretap channel, where each legitimate user equipped with $M$ antennas intends to convey independent signals via an intermediate relay with $N$ antennas. There exists an eavesdropper which is equipped with $N_{e}$ antennas close to the legitimate users. In order to eliminate the multiuser interference and keep the system security, interference alignment is mainly utilized in the proposed broadcast wiretap channel (BWC) and multi-access BWC (MBWC), and cooperative jamming is adopted as a supplementary approach in the MBWC model. The general feasibility conditions of the interference alignment are deduced as $M \ge K-1, 2M > N$ and $N \ge (({K(K-1)})/2)$ . In the BWC model, we have deduced the secure degrees of freedom (SDOF) as $K\min \{M,N\}-\min \{N_{e},K(K-1)/2\}$ , which is always a positive value. While in the MBWC model, the SDOF is given by $K\min \{M,N\}$ . Finally, since the relay transmits the synthesized signals of the legal signal and the jamming signal in the MBWC model, we propose a power allocation scheme to maximize the secrecy rate. Simulation results demonstrate that our proposed power allocation scheme can improve secrecy rate under various antenna configurations.

On the Individual Secrecy Capacity Regions of the General, Degraded, and Gaussian Multi-Receiver Wiretap Broadcast Channel

In this paper, secure communication over a broadcast channel with multiple legitimate receivers and an external eavesdropper is investigated. Two different secrecy measures are considered. The first criterion is a conservative one known as joint secrecy, where the mutual leakage of all confidential messages must be small. The second criterion is a less conservative constraint known as individual secrecy, where the individual leakage of each confidential message must be small. At first, we consider the degraded multi-receiver wiretap broadcast channel and manage to establish the individual secrecy capacity region. Our encoding scheme applies a careful combination of the standard techniques of wiretap random coding and Shannon's one time pad encoding, where the confidential messages of the weak receivers are used as secret keys for the stronger ones. The validity of this technique is due to the properties of the degraded broadcast channel and the secrecy requirements of the individual secrecy criterion. Our result indicates that the individual secrecy capacity region is in fact larger than the joint one established in earlier literature. The established capacity region is then used to derive the individual secrecy capacity regions of the Gaussian single-input single-output and degraded Gaussian multiple-input multiple-output multi-receiver wiretap broadcast channels. Furthermore, we present an achievable rate region for the general two-receiver wiretap broadcast channel under both the joint and the individual secrecy criterion. Comparing these two rate regions suggests that even for the general case, the individual secrecy criterion might be able to provide a larger rate region compared with the joint one.

Secrecy Capacity Region of Some Classes of Wiretap Broadcast Channels

This work investigates the secrecy capacity of the Wiretap Broadcast Channel (WBC) with an external eavesdropper where a source wishes to communicate two private messages over a Broadcast Channel (BC) while keeping them secret from the eavesdropper. We derive a non-trivial outer bound on the secrecy capacity region of this channel which, in absence of security constraints, reduces to the best known outer bound to the capacity of the standard BC. An inner bound is also derived which follows the behavior of both the best known inner bound for the BC and the Wiretap Channel. These bounds are shown to be tight for the deterministic BC with a general eavesdropper, the semi-deterministic BC with a more-noisy eavesdropper and the Wiretap BC where users exhibit a less-noisiness order between them. Finally, by rewriting our outer bound to encompass the characteristics of parallel channels, we also derive the secrecy capacity region of the product of two inversely less-noisy BCs with a more-noisy eavesdropper. We illustrate our results by studying the impact of security constraints on the capacity of the WBC with binary erasure (BEC) and binary symmetric (BSC) components.

MIMO Wiretap Channels With Unknown and Varying Eavesdropper Channel States

In this paper, a class of information theoretic secrecy problems is addressed where the eavesdropper channel state is completely unknown to the legitimate parties. In particular, a Gaussian MIMO wiretap channel is considered, where the eavesdropper channel state can vary from one channel use to the next, and the overall channel state sequence is known only to the eavesdropper. When the eavesdropper has fewer antennas than the transmitter and its intended receiver, a positive secrecy rate in the sense of strong secrecy is proved to be achievable and shown to match with the converse in secure degrees of freedom. This yields the conclusion that secure communication is possible regardless of the location or channel states of the eavesdropper. Additionally, it is observed that, the present setting renders the secrecy capacity problems for some multiterminal wiretap-type channels more tractable as compared to the case with full or partial knowledge of eavesdropper channel states. To demonstrate this observation, secure degrees of freedom regions are derived for the Gaussian MIMO multiple access (MAC) wiretap channel and the two-user Gaussian MIMO broadcast (BC) wiretap channel, where the transmitter(s) and intended receiver(s) have the same number of antennas.

Achievability Proof via Output Statistics of Random Binning

This paper introduces a new and ubiquitous framework for establishing achievability results in network information theory problems. The framework uses random binning arguments and is based on a duality between channel and source coding problems. Furthermore, the framework uses pmf approximation arguments instead of counting and typicality. This allows for proving coordination and strong secrecy problems, where certain statistical conditions on the distribution of random variables need to be satisfied. These statistical conditions include independence between messages and eavesdropper’s observations in secrecy problems and closeness to a certain distribution (usually, i.i.d. distribution) in coordination problems. One important feature of the framework is to enable one to add an eavesdropper and obtain a result on the secrecy rates for free. We make a case for generality of the framework by studying examples in a variety of settings including channel coding, lossy source coding, joint source-channel coding, coordination, strong secrecy, feedback, and relaying. In particular, by investigating the framework for the lossy source coding problem over broadcast channel, it is shown that the new framework provides a simple alternative scheme to the hybrid coding scheme. In addition, new results on secrecy rate region (under strong secrecy criterion) of wiretap broadcast channel and wiretap relay channel are derived. In a set of accompanied papers, we have shown the usefulness of the framework to establish achievability results for coordination problems, including interactive channel simulation, coordination via relay and channel simulation via another channel.

On Ergodic Secrecy Rate for MISO Wiretap Broadcast Channels with Opportunistic Scheduling

In this letter, we study on-off opportunistic beamforming for the multiuser downlink channel with a passive eavesdropper. Two opportunistic scheduling schemes exploiting multiuser diversity are investigated which require limited feedback of the effective signal-to-noise ratio (SNR) from the legitimate users. For the two scheduling schemes, we derive new closed-form expressions for the ergodic secrecy rate with on-off beamforming over Rayleigh fading channels. Numerical results are provided to verify our analytical results and illustrate the impact of multiuser diversity on the secrecy performance.