Results 1 - 10
of
15
Secrecy rates in the broadcast channel with confidential messages and external eavesdroppers,” submitted to
- IEEE Trans. Wireless Commun
"... ar ..."
(Show Context)
Physical layer security in downlink multi-antenna cellular networks,” submitted to
- IEEE Trans. Commun
"... Abstract—In this paper, we study physical layer security for the downlink of cellular networks, where the confidential messages transmitted to each mobile user can be eavesdropped by both; 1) the other users in the same cell and 2) the users in the other cells. The locations of base stations and mob ..."
Abstract
-
Cited by 1 (1 self)
- Add to MetaCart
(Show Context)
Abstract—In this paper, we study physical layer security for the downlink of cellular networks, where the confidential messages transmitted to each mobile user can be eavesdropped by both; 1) the other users in the same cell and 2) the users in the other cells. The locations of base stations and mobile users are modeled as two independent two-dimensional Poisson point processes. Using the proposed model, we analyze the secrecy rates achievable by regularized channel inversion (RCI) precoding by performing a large-system analysis that combines tools from stochastic geome-try and random matrix theory. We obtain approximations for the probability of secrecy outage and the mean secrecy rate, and char-acterize regimes where RCI precoding achieves a non-zero secrecy rate. We find that unlike isolated cells, if one treats interference as noise, the secrecy rate in a cellular network does not grow monotonically with the transmit power, and the network tends to be in secrecy outage if the transmit power grows unbounded. Furthermore, we show that there is an optimal value for the base station deployment density that maximizes the secrecy rate, and this value is a decreasing function of the transmit power. Index Terms—Physical layer security, cellular networks, stochastic geometry, linear precoding, random matrix theory (RMT). I.
Enhancing Wireless Communication Privacy with Artificial Fading
"... Abstract—This paper addresses the problem of anti-eavesdropping in wireless network physical layer. The main contribution of this paper is twofold. First, we propose a novel concept of artificial fading that is produced by double-beam switching of smart antenna array to intentionally corrupt unwante ..."
Abstract
-
Cited by 1 (1 self)
- Add to MetaCart
(Show Context)
Abstract—This paper addresses the problem of anti-eavesdropping in wireless network physical layer. The main contribution of this paper is twofold. First, we propose a novel concept of artificial fading that is produced by double-beam switching of smart antenna array to intentionally corrupt unwanted wireless communication links. Second, we develop a physical layer anti-eavesdropping scheme to minimize the unnecessary coverage area, and hence, lower the chance of being eavesdropped. Our anti-eavesdropping scheme employs smart antenna with two synthesized radiation patterns, which are optimized to provide good signal quality to the intended receiver, while their overlap apart from the intended direction is minimized. During the transmission, the transmitter period-ically alternates between the two optimized patterns at a high frequency, which produces severe fading to the received signal in undesired directions. Since such signals are corrupted and cannot be decoded, eavesdropping is prevented. Simulation experiments show that our anti-eavesdropping scheme outperforms single pattern beamforming in reducing the unnecessary coverage area exposed to eavesdroppers. I.
Joint scheduling & jamming for data secrecy in wireless networks
- Proc. IEEE WiOpt 2013
, 2013
"... Abstract—The broadcast nature of the wireless medium jeopar-dizes secure transmissions. Cryptographic measures fail to ensure security when eavesdroppers have superior computational capa-bility; however, it can be assured from information theoretic secu-rity approaches. We use physical layer securit ..."
Abstract
-
Cited by 1 (1 self)
- Add to MetaCart
(Show Context)
Abstract—The broadcast nature of the wireless medium jeopar-dizes secure transmissions. Cryptographic measures fail to ensure security when eavesdroppers have superior computational capa-bility; however, it can be assured from information theoretic secu-rity approaches. We use physical layer security to guarantee non-zero secrecy rate in single source, single destination multi-hop networks with eavesdroppers for two cases: when eavesdropper locations and channel gains are known and when their positions are unknown. We propose a two-phase solution which consists of finding activation sets and then obtaining transmit powers subject to SINR constraints for the case when eavesdropper locations are known. We introduce methods to find activation sets and compare their performance. Necessary but reasonable approximations are made in power minimization formulations for tractability reasons. For scenarios with no eavesdropper location information, we suggest vulnerability region (the area having zero secrecy rate) minimization over the network. Our results show that in the absence of location information average number of eavesdroppers who have access to data is reduced. I.
Transactions on Wireless Communications 1 Limited Rate Feedback Scheme for Resource Allocation in Secure Relay-Assisted OFDMA Networks
"... Abstract—In this paper, we consider the problem of resource allocation for secure communications in decode-and-forward (DF) relay-assisted Orthogonal Frequency-Division Multiple Ac-cess (OFDMA) networks. In our setting, users want to securely communicate to the base station (BS) with the help of a s ..."
Abstract
- Add to MetaCart
(Show Context)
Abstract—In this paper, we consider the problem of resource allocation for secure communications in decode-and-forward (DF) relay-assisted Orthogonal Frequency-Division Multiple Ac-cess (OFDMA) networks. In our setting, users want to securely communicate to the base station (BS) with the help of a set of relay stations (RSs) in the presence of multiple eavesdroppers. We assume that all channel state information (CSI) of the legitimate links and only the channel distribution information (CDI) of the eavesdropper links are available. We formulate our problem as an optimization problem whose objective is to maximize the sum secrecy rate of the system subject to individual transmit power constraint for each user and RS. As a first work which considers limited feedback schemes for secure communications in cooperative OFDMA networks, we consider the limited-rate feedback case where in addition to transmit power and subcarrier assignments, channel quantization should be performed and boundary regions of channels should be computed. We further consider the noisy feedback channel. We solve our problem using the dual Lagrange approach and propose an iterative algorithm whose convergence is analyzed. Using simulations, we evaluate the performance of the proposed scheme in numerous situations. Index Terms – Physical (PHY) layer security, limited feedback, eavesdropper, decode-and-forward (DF) relay. I.
Buffer-Aided Relaying for Two-Hop Secure Communication
"... Abstract—We consider using a buffer-aided relay to enhance security for two-hop half-duplex relay networks with an external eavesdropper. We propose a link selection scheme that adapts reception and transmission time slots based on channel quality, while considering both the two-hop transmission eff ..."
Abstract
- Add to MetaCart
(Show Context)
Abstract—We consider using a buffer-aided relay to enhance security for two-hop half-duplex relay networks with an external eavesdropper. We propose a link selection scheme that adapts reception and transmission time slots based on channel quality, while considering both the two-hop transmission efficiency and security. Closed-form expressions for the secrecy throughput and the secrecy outage probability (SOP) are derived, and the selection parameters are optimized to maximize the secrecy throughput or minimize the SOP. We then analyze two sub-optimal link selection schemes that in general only require a line search to solve the optimization problem, and we show that, under certain conditions, these approaches also admit closed-form solutions. All schemes are discussed in the context of two different scenarios where the relay either knows or does not know the channel to the legiti-mate receiver. In the former case, the relay adopts adaptive-rate transmission, whereas for the latter, it uses fixed-rate transmis-sion. Numerical results show that buffer-aided relaying provides a significant improvement in security compared with conventional unbuffered relaying. Furthermore, the performance of the sub-optimal schemes is shown to approach the optimal one for certain ranges of signal-to-noise-ratio (SNR) or SOP constraints. Index Terms—Buffered relay, wiretap channel, physical layer security, outage probability, relay networks. I.
Universal Hashing for Information Theoretic Security
, 2015
"... The information theoretic approach to security entails harnessing the correlated randomness available in nature to establish security. It uses tools from information theory and coding and yields provable security, even against an adversary with unbounded computational power. However, the feasibility ..."
Abstract
- Add to MetaCart
The information theoretic approach to security entails harnessing the correlated randomness available in nature to establish security. It uses tools from information theory and coding and yields provable security, even against an adversary with unbounded computational power. However, the feasibility of this approach in practice depends on the development of efficiently implementable schemes. In this article, we review a special class of practical schemes for information theoretic security that are based on 2-universal hash families. Specific cases of secret key agreement and wiretap coding are considered, and general themes are identified. The scheme presented for wiretap coding is modular and can be implemented easily by including an extra pre-processing layer over the existing transmission codes.
Analysis of Keyless Massive MIMO-based Cryptosystem Security
"... Abstract. A cryptosystem for wireless communications, recently pro-posed by T. Dean and A. Goldsmith, is considered. That system can be regarded as a second revolution in cryptography because the confiden-tiality of the messages transmitted over a wireless massive MIMO-based channel is provided by t ..."
Abstract
- Add to MetaCart
(Show Context)
Abstract. A cryptosystem for wireless communications, recently pro-posed by T. Dean and A. Goldsmith, is considered. That system can be regarded as a second revolution in cryptography because the confiden-tiality of the messages transmitted over a wireless massive MIMO-based channel is provided by the difference in the space locations of legal and illegal users and it does not require any secret key distribution. How-ever our investigation shows that there is a chance of eavesdropping the cipher texts by using a suboptimal algorithm. Therefore we investigate some additional conditions for channel matrices and additive noises in order to provide a desired security. A combination of wiretap channel coding with a MIMO-based cryptosystem is also considered.
Index Terms
"... In this paper, we study physical layer security for the downlink of cellular networks, where the confidential messages transmitted to each mobile user can be eavesdropped by both (i) the other users in the same cell and (ii) the users in the other cells. The locations of base stations and mobile use ..."
Abstract
- Add to MetaCart
(Show Context)
In this paper, we study physical layer security for the downlink of cellular networks, where the confidential messages transmitted to each mobile user can be eavesdropped by both (i) the other users in the same cell and (ii) the users in the other cells. The locations of base stations and mobile users are modeled as two independent two-dimensional Poisson point processes. Using the proposed model, we analyze the secrecy rates achievable by regularized channel inversion (RCI) precoding by performing a large-system analysis that combines tools from stochastic geometry and random matrix theory. We obtain approximations for the probability of secrecy outage and the mean secrecy rate, and characterize regimes where RCI precoding achieves a non-zero secrecy rate. We find that unlike isolated cells, the secrecy rate in a cellular network does not grow monotonically with the transmit power, and the network tends to be in secrecy outage if the transmit power grows unbounded. Furthermore, we show that there is an optimal value for the base station deployment density that maximizes the secrecy rate, and this value is a decreasing function of the signal-to-noise ratio.
