Artificial-noise jamming improves physical-layer security by degrading an eavesdropper's channel, but the injected noise also interferes with the legitimate receiver. We introduce a correlated-jamming protocol based on classical and quantum correlations that suppresses this self-interference while preserving the jamming penalty experienced by the eavesdropper. Bob broadcasts one mode of a correlated two-mode source and retains the second as a local reference. Eve, who has no access to the retained mode, receives the full thermal jamming field, whereas Bob uses an optimized joint measurement to cancel its correlated fluctuations. The residual self-jamming noise is governed by the conditional variance of the transmitted jamming quadrature given the retained reference. Any classically correlated source is bounded by the vacuum-noise floor and therefore restores Bob, at best, to his unjammed receiver noise. An entangled two-mode squeezed source surpasses this limit and produces sub-vacuum residual noise, with the maximum quantum advantage set by the transmissivity of the jamming path back to Bob. In the bright-source regime, this advantage becomes a fixed reduction in Bob's noise floor, independent of the signal and jamming powers. Within a bounded-collection wiretap model, correlated jamming preserves positive secrecy even when Eve has a stronger direct channel than Bob and remains effective against collective measurements on Eve's Gaussian output states. The protocol supports bright classical message transmission and requires no end-to-end quantum channel. Possible applications include shot-noise-limited optical communication, cryogenic microwave networks, and covert or power-constrained secure links.
Artificial-noise jamming improves physical-layer security by degrading an eavesdropper's channel, but the injected noise also interferes with the legitimate receiver. We introduce a correlated-jamming protocol based on classical and quantum correlations that suppresses this self-interference while preserving the jamming penalty experienced by the eavesdropper. Bob broadcasts one mode of a correlated two-mode source and retains the second as a local reference. Eve, who has no access to the retained mode, receives the full thermal jamming field, whereas Bob uses an optimized joint measurement to cancel its correlated fluctuations. The residual self-jamming noise is governed by the conditional variance of the transmitted jamming quadrature given the retained reference. Any classically correlated source is bounded by the vacuum-noise floor and therefore restores Bob, at best, to his unjammed receiver noise. An entangled two-mode squeezed source surpasses this limit and produces sub-vacuum residual noise, with the maximum quantum advantage set by the transmissivity of the jamming path back to Bob. In the bright-source regime, this advantage becomes a fixed reduction in Bob's noise floor, independent of the signal and jamming powers. Within a bounded-collection wiretap model, correlated jamming preserves positive secrecy even when Eve has a stronger direct channel than Bob and remains effective against collective measurements on Eve's Gaussian output states. The protocol supports bright classical message transmission and requires no end-to-end quantum channel. Possible applications include shot-noise-limited optical communication, cryogenic microwave networks, and covert or power-constrained secure links.
This paper investigates cooperative security in wireless networks, where a source (Alice) intends to transmit a confidential message to a legitimate destination (Bob), with the help of a cooperative jammer (Charlie), coexisting with multiple passive eavesdroppers (Eves). In particular, by assuming knowledge of Bob's perfect channel state information (CSI) but only Eves’ statistical CSIs, secrecy beamforming with artificial noise (AN) is utilized for secure transmission, and cooperative jamming (CJ) is explored to further enhance secrecy. We first derive an accurate closed-form expression for the secrecy outage probability (SOP), and establish the condition under which positive secrecy rate is achievable. Then, we provide a secure transmit design for maximizing the SOP constrained secrecy rate. Moreover, based on a strict mathematical analysis, we characterize the impact of the main channel quality and the number of Eves on transmit design and secrecy performance. Specifically, optimal power allocation ratio between the information-bearing signal and the AN signal increases as the main channel quality improves, and decreases with the number of Eves. Numerical results confirm that our design achieves performance improvement in terms of both secrecy rate and secure energy efficiency, as compared to the approach without CJ.
Cooperative jamming approach has been commonly used in the field of physical layer security to achieve a good secrecy rate of wireless networks. In this approach, the Gaussian noise signal sent by a friendly jammer can disrupt the reception of the eavesdropper, however, it may also interfere with the legitimate receiver. In this paper, we propose a novel approach, namely, information jamming, to go beyond the secrecy rate achieved by the traditional cooperative jamming approach in a multiple-input single-output (MISO) wiretap channel. We propose that a multi-antenna friendly jammer transmits the source message rather than Gaussian noise signal for simultaneously enhancing the signal strength at the legitimate receiver and canceling the received signal at the eavesdropper. In particular, we aim to maximize the achievable secrecy rate by optimizing the information jammer's beamforming vector. Though the optimization problem is non-convex, we successfully solve it optimally via a two-stage based numerical approach. To gain more useful analytical results, we also propose two suboptimal jamming schemes with low computation, by targeting at improving the legitimate reception and avoiding the eavesdropping, respectively. Finally, numerical results show that the proposed information jamming approach significantly helps go beyond the secrecy rate of the existing cooperative jamming approach, especially when the transmit power of the jammer is large enough.
This paper considers a Gaussian multi-input multi-output (MIMO) wiretap channel with a legitimate transmitter, a legitimate receiver (Bob), an eavesdropper (Eve), and a cooperative jammer. All nodes may be equipped with multiple antennas. Traditionally, the jammer transmits Gaussian noise (GN) to enhance the security. However, using this approach, the jamming signal interferes not only with Eve but also with Bob. In this paper, besides the GN strategy, we assume that the jammer can also choose to use the encoded jammer (EJ) strategy, i.e., instead of GN, it transmits a codeword from an appropriate codebook. In certain conditions, the EJ scheme enables Bob to decode the jamming codeword and thus cancel the interference, while Eve remains unable to do so even if it knows all the codebooks. We first derive an inner bound on the system’s secrecy rate under the strong secrecy metric, and then consider the maximization this bound through precoder design in a computationally efficient manner. In the single-input multi-output (SIMO) case, we prove that although non-convex, the power control problems can be optimally solved for both GN and EJ schemes. In the MIMO case, we propose to solve the problems using the matrix simultaneous diagonalization (SD) technique, which requires quite a low computational complexity. Simulation results show that by introducing a cooperative jammer with coding capability, and allowing it to switch between the GN and EJ schemes, a dramatic increase in the secrecy rate can be achieved. In addition, the proposed algorithms can significantly outperform the current state of the art benchmarks in terms of both secrecy rate and computation time.
In this paper, we consider physical layer security in wireless communication networks in which a source (Alice) intends to send a confidential message to a legitimate destination (Bob) with the help of a cooperative jammer (CJ), in the presence of a passive eavesdropper (Eve). Assuming that only statistical channel state information (CSI) of Eve is available, artificial-noise (AN) assisted beamforming and cooperative jamming are designed. The goal is to maximize the secrecy rate, subject to a constraint on secrecy outage probability. Numerical results validate the effectiveness of our scheme. Moreover, a higher secure energy efficiency (EE) can be achieved as compared with other schemes without a cooperative jammer.
This work studies an energy-efficient jamming scheme for enhancing physical layer security in visible light communication (VLC). We consider a VLC system where multiple LED luminaries are deployed together with a legitimate user (i.e., Bob) and passive eavesdroppers (i.e., Eves). In such a scenario, the closest LED luminary to Bob serves as the transmitter while the rest of the luminaries act as jammers transmitting artificial noise (AN) to possibly degrade the quality of Eves' channels. A joint design of precoder and AN is then investigated to maximize the energy efficiency (EE) of the communication channel to Bob while ensuring a certain amount of AN power to confuse Eves. To solve the design problem, we make use of a combination of the Dinkelbach and convex-concave procedure (CCCP), which guarantees to converge to a local optimum.
Traditional approaches for providing confidentiality of wirelessly transmitted signals are often based on cryptographic techniques. While these techniques ensure that messages are encrypted and secured against eavesdropping, they are not sufficient to protect important transmission attributes at the physical (PHY) layer. Specifically, several elds in the headers of PHY and medium access control (MAC) frames are typically sent unencrypted to maintain proper protocol functionality (e.g., sender/receiver identification). As a result, they leak side-channel information (SCI), including payload size, frequency and phase oset, modulation and coding scheme, identities of communication nodes, frame type, transmission rate, etc. These SCI can be exploited by an adversary to launch various passive (eavesdropping) and active (jamming) attacks. To complement cryptographic techniques used at upper layers and prevent the leakage of SCI at the PHY/MAC layers, PHY-layer security techniques have been introduced. These techniques exploit the characteristics of the wireless channel along with multiple-input multiple-output (MIMO) technologies, in which multiple transmitting and receiving antennas are utilized to prevent information leakage to eavesdroppers and/or avoid jamming attacks. In particular, if the signal-to-interference-plus-noise ratio (SINR) at an adversary is lower than the one at a legitimate receiver, secure communication can be achieved through the so-called wiretap coding. MIMO systems enable the transmitter and/or the receiver to generate artificial noise, called friendly jamming (FJ), so as to reduce the SINR at the adversary without impacting the SINR at the legitimate receiver. In this dissertation, we focus on exploring the security threats to next-generation wireless systems. We develop MIMO-based PHY-layer security methods to achieve reliable and secret communications in these systems. First, we consider a broadcast channel, in which a multi-antenna transmitter (Alice) sends K confidential information signals to K legitimate receivers (Bobs) in the presence of L eavesdropping devices (Eves). Alice uses MIMO precoding to generate the information signals along with her own Tx-based friendly jamming (TxFJ). Interference at each Bob is removed via a technique called MIMO zero-forcing. This TxFJ, however, leaves an eavesdropping \vulnerability region" in the proximity of each Bob, which can be exploited by a nearby Eve. Specically, because of the high correlation in the channel state information (CSI) at a Bob and nearby Eves, the TxFJ becomes less effective in preventing eavesdropping at these Eves. We address this problem by augmenting TxFJ with receiver-based friendly jamming (RxFJ), generated by each Bob. Specifically, we allow each Bob to use self-interference suppression (SIS) techniques to transmit a friendly jamming signal while simultaneously receiving an information signal over the same channel. These SIS techniques exploit circulators to attenuate the self-interference power of RxFJ at Bobs and utilize analog/digital cancellation methods to clean out any remaining residual self-interference. Considering the resulting broadcast channel, we rst study a two-user scenario and develop a secrecy encoding scheme for constructing the signals intended to two Bobs. We characterize the corresponding achievable secrecy sum-rate and formulate an optimization problem to maximize this metric. We then extend our approach to K-user scenarios and study a power minimization problem. Particularly, in our analysis we minimize the powers allocated to information and friendly jamming signals (both TxFJ and RxFJ) while guaranteeing individual secrecy rates for various Bobs. The problem is solved for the cases when the eavesdropper's CSI (ECSI) is known or unknown (but with a known distribution). Simulations show the effectiveness of the proposed solutions. Furthermore, we discuss how to schedule transmissions when the rate requirements need to be satised on average rather than instantaneously. In low and high power regime, a scheduling algorithm that serves only the strongest receivers is shown to outperform the one that schedules all receivers. Next, we consider a single-cell massive MIMO system in which a base station (BS) with a large number of antennas transmits simultaneously to several single antenna users. The BS acquires the CSI for various receivers using uplink pilot transmissions. We demonstrate the vulnerability of the CSI estimation process to a pilot-contamination (PC) attack that aims at minimizing the sum-rate of downlink transmissions by contaminating uplink pilots. We rst study PC attacks for two downlink power allocation strategies under the assumption that the attacker knows the locations of the BS and its users. Later on, we relax this assumption and consider the case when such knowledge is probabilistic. The formulated problems are solved using stochastic optimization, Lagrangian minimization, and game-theoretic methods. A closed-form solution for a special case of the problem is obtained. Furthermore, we analyze the \achievable individual secrecy rates" under PC attacks, and provide an upper-bound on these rates. We also study this scenario without a priori knowledge of user locations at the attacker by introducing chance constraints. Another attack model is considered, where the attacker generates jamming signals in both the CSI estimation and data transmission phases by exploiting inband full-duplex techniques. Our results indicate that such attacks can degrade the throughput of a massive MIMO system by more than 50%, and reduce fairness among users significantly.