This paper explores a new secure wireless communication paradigm where the physical layer security technology is applied to counteract both the detection and eavesdropping attacks, such that the critical covertness and secrecy properties of the communication are jointly guaranteed. We first provide theoretical modeling for covertness outage probability (COP), secrecy outage probability (SOP) and transmission probability (TP) to depict the covertness, secrecy and transmission performances of the paradigm. To understand the fundamental security performance under the new paradigm, we then define a new metric - covert secrecy rate (CSR), which characterizes the maximum transmission rate subject to the constraints of COP, SOP and TP. We further conduct detailed theoretical analysis to identify the CSR under various scenarios determined by the detector-eavesdropper relationships and the secure transmission schemes adopted by transmitters. Finally, numerical results are provided to illustrate the achievable performances under the new secure communication paradigm.
This letter studies information-theoretic security without knowing the eavesdropper's channel fading state. We present an alternative secrecy outage formulation to measure the probability that message transmissions fail to achieve perfect secrecy. Using this formulation, we design two transmission schemes that satisfy the given security requirement while achieving good throughput performance.
Secrecy capacity of a multiple-antenna wiretap channel is studied in the low signal-to-noise ratio (SNR) regime. Expressions for the first and second derivatives of the secrecy capacity with respect to SNR at SNR = 0 are derived. Transmission strategies required to achieve these derivatives are identified. In particular, it is shown that it is optimal in the low-SNR regime to transmit in the maximum-eigenvalue eigenspace of H_m* H_m - N_m/N_e H_e* H_e where H_m and H_e denote the channel matrices associated with the legitimate receiver and eavesdropper, respectively, and N_m and N_e are the no…
In this correspondence, we consider an amplify-and-forward relay network in which relayed information is overheard by an eavesdropper. In order to confound the eavesdropper, a wireless-powered jammer is also considered which harvests energy from a multiple-antenna source. We proposed a new secure beamforming scheme in which beamforming vector is a linear combination of the energy beamforming (EB) and information beamforming (IB) vectors. We also present a new closed-form solution for the proposed beamforming vector which is shown to achieve a higher secrecy rate as compared to the trivial EB a…
In this paper, we investigate how constraints on the randomization in the encoding process affect the secrecy rates achievable over wiretap channels. In particular, we characterize the secrecy capacity with a rate-limited local source of randomness and a less capable eavesdropper's channel, which shows that limited rate incurs a secrecy rate penalty but does not preclude secrecy. We also discuss a more practical aspect of rate-limited randomization in the context of cooperative jamming. Finally, we show that secure communication is possible with a non-uniform source for randomness; this sugges…
In this paper, we address the problem of optimal power allocation at the relay in two-hop secure communications. In order to solve the challenging issue of short-distance interception in secure communications, the benefit of large-scale MIMO (LS-MIMO) relaying techniques is exploited to improve the secrecy performance significantly, even in the case without eavesdropper channel state information (CSI). The focus of this paper is on the analysis and design of optimal power allocation for the relay, so as to maximize the secrecy outage capacity. We reveal the condition that the secrecy outage ca…
This paper studies the secrecy rate maximization problem of a secure wireless communication system, in the presence of multiple eavesdroppers. The security of the communication link is enhanced through cooperative jamming, with the help of multiple jammers. First, a feasibility condition is derived to achieve a positive secrecy rate at the destination. Then, we solve the original secrecy rate maximization problem, which is not convex in terms of power allocation at the jammers. To circumvent this non-convexity, the achievable secrecy rate is approximated for a given power allocation at the jam…
In this paper, we address the problem of energy-efficient power allocation for secure communications in an amplify-and-forward (AF) large-scale multiple-input multiple-output (LS-MIMO) relaying system in presence of a passive eavesdropper. The benefits of an AF LS-MIMO relay are exploited to significantly improve the secrecy performance, especially the secrecy energy efficiency (bit per Joule). We first analyze the impact of transmit power at the relay on the secrecy outage capacity, and prove that the secrecy outage capacity is a concave function of transmit power under very practical assumpt…
We investigate beamforming and artificial noise generation at the secondary transmitters to establish secure transmission in large scale spectrum sharing networks,where multiple non-colluding eavesdroppers attempt to intercept the secondary transmission. We develop a comprehensive analytical framework to accurately assess the secrecy performance under the primary users' quality of service constraint. Our aim is to characterize the impact of beamforming and artificial noise generation on this complex large scale network. We first derive exact expressions for the average secrecy rate and the sec…
In this letter, we propose to exploit an intelligent reflecting surface (IRS) to secure multiuser two-way communications. Specifically, two end users simultaneously transmit their signals, where the signal of one user is exploited as information jamming to disrupt the reception of the other user's signal at an eavesdropper. A simple user scheduling scheme is developed to improve the secrecy rate. Analytical results in terms of a lower bound on the average secrecy rate and its scaling laws are derived to evaluate the secrecy performance and obtain valuable design insights. Simulation results ar…
In this paper, we investigate secure communications in uplink transmissions, where there are a base station (BS) with M receive antennas, K mobile users each with a single antenna, and an eavesdropper with N receive antennas. The closed-form expressions of the achievable ergodic secrecy sumrates (ESSR) for a random k users selection scheme in the high and low SNR regimes are presented. It is shown that the scaling behavior of ESSR with respect to the number of served users k can be quite different under different system configurations, determined by the numbers of the BS antennas and that of t…
Theoretical studies on physical layer security often adopt the secrecy outage probability as the performance metric for wireless communications over quasi-static fading channels. The secrecy outage probability has two limitations from a practical point of view: a) it does not give any insight into the eavesdropper's decodability of confidential messages; b) it cannot characterize the amount of information leakage to the eavesdropper when an outage occurs. Motivated by the limitations of the secrecy outage probability, we propose three new secrecy metrics for secure transmissions over quasi-sta…
We propose a secure transmission scheme for a relay wiretap channel, where a source communicates with a destination via a decode-and-forward relay in the presence of spatially random-distributed eavesdroppers. We assume that the source is equipped with multiple antennas, whereas the relay, the destination, and the eavesdroppers are equipped with a single antenna each. In the proposed scheme, in addition to information signals, the source transmits artificial noise signals in order to confuse the eavesdroppers. With the target of maximizing the secrecy throughput of the relay wiretap channel, w…
In this paper we consider the robust secure beamformer design for MISO wiretap channels. Assume that the eavesdroppers' channels are only partially available at the transmitter, we seek to maximize the secrecy rate under the transmit power and secrecy rate outage probability constraint. The outage probability constraint requires that the secrecy rate exceeds certain threshold with high probability. Therefore including such constraint in the design naturally ensures the desired robustness. Unfortunately, the presence of the probabilistic constraints makes the problem non-convex and hence diffic…
This paper studies the frequency/time selective $K$-user Gaussian interference channel with secrecy constraints. Two distinct models, namely the interference channel with confidential messages and the one with an external eavesdropper, are analyzed. The key difference between the two models is the lack of channel state information (CSI) about the external eavesdropper. Using interference alignment along with secrecy pre-coding, it is shown that each user can achieve non-zero secure Degrees of Freedom (DoF) for both cases. More precisely, the proposed coding scheme achieves $\frac{K-2}{2K-2}$ s…
With non-orthogonal multiple access(NOMA), we tackle the maximization of the secrecy rate for the strong user subject to a maximum allowable secrecy outage probability, while guaranteeing a constraint on the transmission rate to the weak user. For the first time, the dependence between the eavesdropper's ability to conduct successive interference cancellation and her channel quality is considered. We determine the optimal power allocation and the redundancy rate, based on which the cost of security in terms of the reduction in the strong user's secrecy rate is examined and the benefits of NOMA…
In many communication channels, secrecy constraints usually incur a penalty in capacity, as well as generalized degrees-of-freedom (GDoF). In this work we show an interesting observation that, adding a helper can totally remove the penalty in sum GDoF, for a two-user symmetric Gaussian interference channel. For the interference channel where each transmitter sends a message to an intended receiver without secrecy constraints, the sum GDoF is a well-known "W" curve, characterized by Etkin-Tse-Wang in 2008. If the secrecy constraints are imposed on this interference channel, where the message of…
In network coding, we discuss the effect of sequential error injection on information leakage. We show that there is no improvement when the operations in the network are linear operations. However, when the operations in the network contains non-linear operations, we find a counterexample to improve Eve's obtained information. Furthermore, we discuss the asymptotic rate in a linear network under the secrecy and robustness conditions as well as under the secrecy condition alone. Finally, we apply our results to network quantum key distribution, which clarifies the type of network that enables …
In this paper, we address the problem of optimal power allocation at the relay in two-hop secure communications under practical conditions. To guarantee secure communication during the long-distance transmission, the massive MIMO (M-MIMO) relaying techniques are explored to significantly enhance wireless security. The focus of this paper is on the analysis and design of optimal power assignment for a decode-and-forward (DF) M-MIMO relay, so as to maximize the secrecy outage capacity and minimize the interception probability, respectively. Our study reveals the condition for a nonnegative the s…
In this paper, the problem of securely computing a function over the binary modulo-2 adder multiple-access wiretap channel is considered. The problem involves a legitimate receiver that wishes to reliably and efficiently compute a function of distributed binary sources while an eavesdropper has to be kept ignorant of them. In order to characterize the corresponding fundamental limit, the notion of secrecy computation-capacity is introduced. Although determining the secrecy computation-capacity is challenging for arbitrary functions, it surprisingly turns out that if the function perfectly matc…
In this paper we consider the secure transmission in fast Rayleigh fading channels with full knowledge of the main channel and only the statistics of the eavesdropper's channel state information at the transmitter. For the multiple-input, single-output, single-antenna eavesdropper systems, we generalize Goel and Negi's celebrated artificial-noise (AN) assisted beamforming, which just selects the directions to transmit AN heuristically. Our scheme may inject AN to the direction of the message, which outperforms Goel and Negi's scheme where AN is only injected in the directions orthogonal to the…
This paper examines the secrecy performance of millimeter-wave (mm-Wave) communications with imperfect hardware and uncertain eavesdropper location. We consider a multiple-antenna source communicating with a single-antenna destination using masked beamforming to transmit the information signals with artificial noise (AN) in the presence of a passive eavesdropper (Eve). For this system, we derive new expressions for the secrecy outage probability (SOP) and secrecy throughput with mm-Wave multipath propagation under slow-fading channel conditions and hardware imperfections. Based on this, optima…
This paper proposes a secure users oriented multiple-input and single-output (MISO) non-orthogonal multiple access (NOMA) downlink transmission scheme, where multiple legitimate users are categorized as quality of service (QoS)-required users (QU) and the security-required users (SU) overheard by a passive eavesdropper. The basic idea is to exploit zero-forcing beamforming (ZFBF) to cancel interference among SUs, and then several QUs are efficiently scheduled based on the obtained beamforming vectors to divide the legitimate users into several user clusters, in such a way that the QUs could sh…
This paper studies the problem of secure communcation over the two-receiver discrete memoryless broadcast channel with one-sided receiver side information and with a passive eavesdropper. We proposed a coding scheme which is based upon the superposition-Marton framework. Secrecy techniques such as the one-time pad, Carleial-Hellman secrecy coding and Wyner serecy coding are applied to ensure individual secrecy. This scheme is shown to be capacity achieving for some cases of the degraded broadcast channel. We also notice that one-sided receiver side information provides the advantage of rate re…
This paper proposes a new design of non-orthogonal multiple access (NOMA) under secrecy considerations. We focus on a NOMA system where a transmitter sends confidential messages to multiple users in the presence of an external eavesdropper. The optimal designs of decoding order, transmission rates, and power allocated to each user are investigated. Considering the practical passive eavesdropping scenario where the instantaneous channel state of the eavesdropper is unknown, we adopt the secrecy outage probability as the secrecy metric. We first consider the problem of minimizing the transmit po…
In this paper, we study the secure transmission in multihop wireless networks with randomize-and-forward (RaF) relaying, in the presence of randomly distributed eavesdroppers. By considering adaptive encoder with on-off transmission (OFT) scheme, we investigate the optimal design of the wiretap code and routing strategies to maximize the secrecy rate while satisfying the secrecy outage probability (SOP) constraint. We derive the exact expressions for the optimal rate parameters of the wiretap code. Then the secure routing problem is solved by revising the classical Bellman-Ford algorithm. Simu…
In this paper, the individual secrecy of two-way wiretap channel is investigated, where two legitimate users' messages are separately guaranteed secure against an external eavesdropper. For one thing, in some communication scenarios, the joint secrecy is impossible to achieve both positive secrecy rates of two users. For another, the individual secrecy satisfies the secrecy demand of many practical communication systems. Thus, firstly, an achievable secrecy rate region is derived for the general two-way wiretap channel with individual secrecy. In a deterministic channel, the region with indivi…
The focus of this paper is an information-theoretic study of retransmission protocols for reliable packet communication under a secrecy constraint. The hybrid automatic retransmission request (HARQ) protocol is revisited for a block-fading wire-tap channel, in which two legitimate users communicate over a block-fading channel in the presence of a passive eavesdropper who intercepts the transmissions through an independent block-fading channel. In this model, the transmitter obtains a 1-bit ACK/NACK feedback from the legitimate receiver via an error-free public channel. Both reliability and con…
In this work a four terminal Gaussian network composed of a source, a destination, an eavesdropper and a jammer relay is studied. The jammer relay does not hear the source transmission. It assists the eavesdropper and aims to decrease the achievable secrecy rates. The source, on the other hand, aims to increase the achievable secrecy rates. Assuming Gaussian strategies at the source and the jammer relay, this problem is formulated as a two-player zero-sum continuous game, where the payoff is the achieved secrecy rate. For this game the Nash Equilibrium is generally achieved with mixed strategi…
This paper shows determining the secrecy capacity of a unicast network with uniform wiretap sets is at least as difficult as the k-unicast problem. In particular, we show that a general k-unicast problem can be reduced to the problem of finding the secrecy capacity of a corresponding single unicast network with uniform link capacities and one arbitrary wiretap link.
Previous work showed that the X network with M transmitters, N receivers has MN/(M+N-1) degrees of freedom. In this work we study the degrees of freedom of the X network with secrecy constraints, i.e. the X network where some/all messages are confidential. We consider the $M \times N$ network where all messages are secured and show that N(M-1)/(M+N-1) degrees of freedom can be achieved. Secondly, we show that if messages from only M-1 transmitters are confidential, then MN/(M+N-1) degrees of freedom can be achieved meaning that there is no loss of degrees of freedom because of secrecy constrai…
In this paper, the performance of a secure massive multiple-input multiple-output (MIMO) system adopting low-resolution digital-to-analog converters (DACs) is analyzed over spatially correlated wireless channels. A tight lower bound for the achievable secrecy rate is derived with artificial noise (AN) transmitted in the null space of the user channels. Using the analytical results, the impact of spatial correlation on the secrecy rate is explicitly evaluated in the presence of low-resolution DACs. The analytical observations reveal that using low-resolution DACs can be beneficial to the secrec…
In wireless data networks, communication is particularly susceptible to eavesdropping due to its broadcast nature. Security and privacy systems have become critical for wireless providers and enterprise networks. This paper considers the problem of secret communication over the Gaussian broadcast channel, where a multi-antenna transmitter sends independent confidential messages to two users with perfect secrecy. That is, each user would like to obtain its own message reliably and confidentially. First, a computable Sato-type outer bound on the secrecy capacity region is provided for a multi-an…
In this paper, the one-sided secrecy of two-way wiretap channel with feedback is investigated, where the confidential messages of one user through multiple transmissions is guaranteed secure against an external eavesdropper. For one thing, one-sided secrecy satisfies the secure demand of many practical scenarios. For another, the secrecy is measured over many blocks since the correlation between eavesdropper's observation and the confidential messages in successive blocks, instead of secrecy measurement of one block in previous works. Thus, firstly, an achievable secrecy rate region is derived…
In this paper, we investigate secure communication over sparse millimeter-wave (mm-Wave) massive multiple-input multiple-output (MIMO) channels by exploiting the spatial sparsity of legitimate user's channel. We propose a secure communication scheme in which information data is precoded onto dominant angle components of the sparse channel through a limited number of radio-frequency (RF) chains, while artificial noise (AN) is broadcast over the remaining nondominant angles interfering only with the eavesdropper with a high probability. It is shown that the channel sparsity plays a fundamental r…
In this paper, we investigate secure transmission in a massive multiple-input multiple-output (MIMO) system adopting low-resolution digital-to-analog converters (DACs). Artificial noise (AN) is deliberately transmitted simultaneously with the confidential signals to degrade the eavesdropper's channel quality. By applying the Bussgang theorem, a DAC quantization model is developed which facilitates the analysis of the asymptotic achievable secrecy rate. Interestingly, for a fixed power allocation factor $ϕ$, low-resolution DACs typically result in a secrecy rate loss, but in certain cases they …
Device-to-device (D2D) communication raises new transmission secrecy protection challenges, since conventional physical layer security approaches, such as multiple antennas and cooperation techniques, are invalid due to its resource/size constraints. The full-duplex (FD) jamming receiver, which radiates jamming signals to confuse eavesdroppers when receiving the desired signal simultaneously, is a promising candidate. Unlike existing endeavors that assume the FD jamming receiver always improves the secrecy performance compared with the half-duplex (HD) receiver, we show that this assumption hi…
We propose a new scheme of wiretap lattice coding that achieves semantic security and strong secrecy over the Gaussian wiretap channel. The key tool in our security proof is the flatness factor which characterizes the convergence of the conditional output distributions corresponding to different messages and leads to an upper bound on the information leakage. We not only introduce the notion of secrecy-good lattices, but also propose the {flatness factor} as a design criterion of such lattices. Both the modulo-lattice Gaussian channel and the genuine Gaussian channel are considered. In the lat…
In pervasive Internet of Things (IoT) applications, the use of short packets is expected to meet the stringent latency requirement in ultra-reliable low-latency communications; however, the incurred security issues and the impact of finite blocklength coding on the physical-layer security have not been well understood. This paper comprehensively investigates the performance of secure short-packet communications in a mission-critical IoT system with an external multi-antenna eavesdropper. An analytical framework is proposed to approximate the average achievable secrecy throughput of the system …
This paper studies the K-user Gaussian interference channel with secrecy constraints. Two distinct network models, namely the interference channel with confidential messages and the one with an external eavesdropper, are analyzed. Using interference alignment along with secrecy pre-coding at each transmitter, it is shown that each user in the network can achieve non-zero secure Degrees of Freedoms (DoFs) in both scenarios. In particular, the proposed coding scheme achieves (K-2)/(2K-2) secure DoFs for each user in the interference channel with confidential messages model, and (K-2)/2K secure D…
In this paper, an intelligent reflecting surface (IRS) assisted spectrum sharing underlay cognitive radio (CR) wiretap channel (WTC) is studied, and we aim at enhancing the secrecy rate of secondary user in this channel subject to total power constraint at secondary transmitter (ST), interference power constraint (IPC) at primary receiver (PR) as well as unit modulus constraint at IRS. Due to extra IPC and eavesdropper (Eve) are considered, all the existing solutions for enhancing secrecy rate of IRS-assisted non-CR WTC as well as enhancing transmission rate in IRS-assisted CR channel without …
This paper presents a number of fundamental properties of full-duplex radio for secure wireless communication under some simple and practical conditions. In particular, we consider the fields of secrecy capacity of a wireless channel between two single-antenna radios (Alice and Bob) against an unknown number of single-antenna eavesdroppers (Eves) from unknown locations, where Alice and Bob have zero knowledge (except a model) of the large-scale-fading channel-state-information of Eves. These properties show how the secrecy capacity is distributed in terms of the location of any Eve, how the op…
We consider a class of Gaussian layered networks where a source communicates with a destination through $L$ intermediate relay layers with $N$ nodes in each layer in the presence of a single eavesdropper which can overhear the transmissions of the nodes in any one layer. The problem of maximum secrecy rate achievable with analog network coding for a unicast communication over such layered wireless relay networks with directed links is considered. A relay node performing analog network coding scales and forwards the signals received at its input. The key contribution of this work is a lemma tha…
We consider a Shannon cipher system for memoryless sources, in which distortion is allowed at the legitimate decoder. The source is compressed using a rate distortion code secured by a shared key, which satisfies a constraint on the compression rate, as well as a constraint on the exponential rate of the excess-distortion probability at the legitimate decoder. Secrecy is measured by the exponential rate of the exiguous-distortion probability at the eavesdropper, rather than by the traditional measure of equivocation. We define the perfect secrecy exponent as the maximal exiguous-distortion exp…
In the wiretap channel setting, one aims to get information-theoretic privacy of communicated data based only on the assumption that the channel from sender to receiver is noisier than the one from sender to adversary. The secrecy capacity is the optimal (highest possible) rate of a secure scheme, and the existence of schemes achieving it has been shown. For thirty years the ultimate and unreached goal has been to achieve this optimal rate with a scheme that is polynomial-time. (This means both encryption and decryption are proven polynomial time algorithms.) This paper finally delivers such a…
In this work, the role of unidirectional limited rate transmitter cooperation is studied in the case of the 2-user Z interference channel (Z-IC) with secrecy constraints at the receivers, on achieving two conflicting goals simultaneously: mitigating interference and ensuring secrecy. First, the problem is studied under the linear deterministic model. The achievable schemes for the deterministic model use a fusion of cooperative precoding and transmission of a jamming signal. The optimality of the proposed scheme is established for the deterministic model for all possible parameter settings usi…
This work for the first time examines the impact of transmitter-side correlation on the artificial-noise-aided secure transmission, based on which a new power allocation strategy for artificial noise (AN) is devised for physical layer security enhancement. Specifically, we design a correlation-based power allocation (CPA) for AN, of which the optimality in terms of achieving the minimum secrecy outage probability is analytically proved in the large system regime with the number of transmit antennas approaching infinity. In order to fully reveal the benefits of the CPA, we derive easy-to-evalua…
Wireless networks with directional antennas, like millimeter wave (mmWave) networks, have enhanced security. For a large-scale mmWave ad hoc network in which eavesdroppers are randomly located, however, eavesdroppers can still intercept the confidential messages, since they may reside in the signal beam. This paper explores the potential of physical layer security in mmWave ad hoc networks. Specifically, we characterize the impact of mmWave channel characteristics, random blockages, and antenna gains on the secrecy performance. For the special case of uniform linear array (ULA), a tractable ap…
In this work, we maximize the secrecy rate of the wireless-powered untrusted relay network by jointly designing power splitting (PS) ratio and relay beamforming with the proposed global optimal algorithm (GOA) and local optimal algorithm (LOA). Different from the literature, artificial noise (AN) sent by the destination not only degrades the channel condition of the eavesdropper to improve the secrecy rate, but also becomes a new source of energy powering the untrusted relay based on PS. Hence, it is of high economic benefits and efficiency to take advantage of AN compared with the literature.…
We investigate the optimality and power allocation algorithm of beam domain transmission for single-cell massive multiple-input multiple-output (MIMO) systems with a multi-antenna passive eavesdropper. Focusing on the secure massive MIMO downlink transmission with only statistical channel state information of legitimate users and the eavesdropper at base station, we introduce a lower bound on the achievable ergodic secrecy sum-rate, from which we derive the condition for eigenvectors of the optimal input covariance matrices. The result shows that beam domain transmission can achieve optimal pe…
The deployment of unmanned aerial vehicle (UAV) for surveillance and monitoring gives rise to the confidential information leakage challenge in both civilian and military environments. The security and covert communication problems for a pair of terrestrial nodes against UAV surveillance are considered in this paper. To overcome the information leakage and increase the transmission reliability, a multi-hop relaying strategy is deployed. We aim to optimize the throughput by carefully designing the parameters of the multi-hop network, including the coding rates, transmit power, and required numb…
Reconfigurable Intelligent Surface (RIS) is one of the promising techniques for 6G wireless communications, and recently has also been shown to be able to improve secure communications. However, there is a "double fading" effect in the reflection link between base station and user, thus passive RIS only achieves a negligible secrecy gain in typical communications scenarios.In this letter, we propose an active RIS-aided multi-antenna physical layer secrecy transmission scheme, where the active RIS can amplify the signal actively. Our aim is to minimize the transmit power subject to the constrai…
In this correspondence, we study the physical layer security in a stochastic unmanned aerial vehicles (UAVs) network from a network-wide perspective, where the locations of UAVs are modeled as a Mat$\acute{\text{e}}$rn hard-core point process (MHCPP) to characterize the minimum safety distance between UAVs, and the locations of users and eavesdroppers are modeled as a Poisson cluster process and a Poisson point process, respectively. UAVs adopt zero-forcing precoding to serve multiple ground users and emit artificial noise to combat eavesdropping. We derive the approximations for the coverage …
Random frequency diverse array (RFDA) based directional modulation (DM) was proposed as a promising technology in secure communications to achieve a precise transmission of confidential messages, and artificial noise (AN) was considered as an important helper in RFDA-DM. Compared with previous works that only focus on the spot of the desired receiver, in this work, we investigate a secrecy region around the desired receiver, that is, a specific range and angle resolution around the desired receiver. Firstly, the minimum number of antennas and the bandwidth needed to achieve a secrecy region ar…
The role of multiple antennas for secure communication is investigated within the framework of Wyner's wiretap channel. We characterize the secrecy capacity in terms of generalized eigenvalues when the sender and eavesdropper have multiple antennas, the intended receiver has a single antenna, and the channel matrices are fixed and known to all the terminals, and show that a beamforming strategy is capacity-achieving. In addition, we show that in the high signal-to-noise (SNR) ratio regime the penalty for not knowing eavesdropper's channel is small--a simple ``secure space-time code'' that can …
The broadcast nature of the wireless medium allows unintended users to eavesdrop the confidential information transmission. In this regard, we investigate the problem of secure communication between a source and a destination via a wireless energy harvesting untrusted node which acts as a helper to relay the information; however, the source and destination nodes wish to keep the information confidential from the relay node. To realize the positive secrecy rate, we use destination-assisted jamming. Being an energy-starved node, the untrusted relay harvests energy from the received radio frequen…
