International Conference on Communications

On the security of transmissions over fading wiretap channels in realistic conditions

Marco Baldi, Linda Senigagliesi, Franco Chiaraluce

Published May 1, 2017• 4 citations

Abstract

Transmissions over the wiretap channel have been studied for a long time from the information theory standpoint. This has allowed to assess the secrecy performance against eavesdropping while ensuring reliable transmission towards the legitimate receiver. However, most previous studies rely on a number of assumptions which are far from practical wireless communications, like infinite length codewords, random coding, discrete channels or continuous channels with Gaussian signaling. In this paper, we show how the level of security at the physical layer can be assessed from the information theoretic standpoint while taking into account the constraints of practical transmissions over realistic wireless wiretap channels, i.e., by considering practical codes with finite length, discrete modulation formats and continuous channels with fading. For this purpose, we consider the notion of mutual information security, which is provably equivalent to semantic security. Our target is to show that classical and already implemented coding and modulation schemes can be used to achieve some level of security at the physical layer, opposed to approaches resorting to completely new designs tailored to secure transmissions. To corroborate this thesis, we consider some coding and modulation schemes compliant with the IEEE 802.16e (WiMax) standard and show how they can be used to achieve some given security level.

DOI: 10.1109/icc.2017.7996662

Related papers

Coding and Signal Processing for Secure Wireless Communication

Li Chia Choo

Wireless communication networks are widely deployed today and the networks are used in many applications which require that the data transmitted be secure. Due to the open nature of wireless systems, it is important to have a fundamental understanding of coding schemes that allow for simultaneously secure and reliable transmission. The information theoretic approach is able to give us this fundamental insight into the nature of the coding schemes required for security. The security issue is approached by focusing on the confidentiality of message transmission and reception at the physical layer. The goal is to design coding and signal processing schemes that provide security, in the information theoretic sense. In so doing, we are able to prove the simultaneously secure and reliable transmission rates for different network building blocks. The multi-receiver broadcast channel is an important network building block, where the rate region for the channel without security constraints is still unknown. In the thesis this channel is investigated with security constraints, and the secure and reliable rates are derived for the proposed coding scheme using a random coding argument. Cooperative relaying is next applied to the wiretap channel, the fundamental physical layer model for the communication security problem, and signal processing techniques are used to show that the secure rate can be improved in situations where the secure rate was small due to the eavesdropper enjoying a more favorable channel condition compared to the legitimate receiver. Finally, structured lattice codes are used in the wiretap channel instead of unstructured random codes, used in the vast majority of the work so far. We show that lattice coding and decoding can achieve the secrecy rate of the Gaussian wiretap channel; this is an important step towards realizing practical, explicit codes for the wiretap channel.

Jul 28, 20120 citations

Wireless Information-Theoretic Security - Part I: Theoretical Aspects

Matthieu R. Bloch, João Barros, Miguel R. D. Rodrigues +1 more

In this two-part paper, we consider the transmission of confidential data over wireless wiretap channels. The first part presents an information-theoretic problem formulation in which two legitimate partners communicate over a quasi-static fading channel and an eavesdropper observes their transmissions through another independent quasi-static fading channel. We define the secrecy capacity in terms of outage probability and provide a complete characterization of the maximum transmission rate at which the eavesdropper is unable to decode any information. In sharp contrast with known results for Gaussian wiretap channels (without feedback), our contribution shows that in the presence of fading information-theoretic security is achievable even when the eavesdropper has a better average signal-to-noise ratio (SNR) than the legitimate receiver - fading thus turns out to be a friend and not a foe. The issue of imperfect channel state information is also addressed. Practical schemes for wireless information-theoretic security are presented in Part II, which in some cases comes close to the secrecy capacity limits given in this paper.

arXiv:cs/0611120Nov 22, 200621 citations

An Overview of Physical Layer Security With Finite-Alphabet Signaling

Sina Rezaei Aghdam, Alireza Nooraiepour, Tolga M. Duman

Providing secure communications over the physical layer with the objective of achieving secrecy without requiring a secret key has been receiving growing attention within the past decade. The vast majority of the existing studies in the area of physical layer security focus exclusively on the scenarios where the channel inputs are Gaussian distributed. However, in practice, the signals employed for transmission are drawn from discrete signal constellations such as phase shift keying and quadrature amplitude modulation. Hence, understanding the impact of the finite-alphabet input constraints and designing secure transmission schemes under this assumption is a mandatory step toward a practical implementation of physical layer security. With this motivation, this paper reviews recent developments on physical layer security with finite-alphabet inputs. We explore transmit signal design algorithms for single-antenna as well as multi-antenna wiretap channels under different assumptions on the channel state information at the transmitter. Moreover, we present a review of the recent results on secure transmission with discrete signaling for various scenarios including multi-carrier transmission systems, broadcast channels with confidential messages, cognitive multiple access and relay networks. Throughout the article, we stress the important behavioral differences of discrete versus Gaussian inputs in the context of the physical layer security. We also present an overview of practical code construction over Gaussian and fading wiretap channels, and discuss some open problems and directions for future research.

arXiv:1802.06401IEEE Communications Surveys & TutorialsNov 8, 201862 citations

Performance of physical layer security under correlated fading wire-tap channel

Jinxiao Zhu

The inherent openness of wireless medium makes information security one of the most important and difficult problems in wireless networks.Physical layer security, which achieves the information-theoretic security by exploiting the differences between the physical properties of signal channels such that a degraded signal at an eavesdropper is always ensured and thus the original data can be hardly recovered regardless of how the signal is processed at the eavesdropper, has been studied as a promising approach to providing a strong form of security.By now, many research works have been devoted to understand the fundamental performance limits of physical layer security under different wire-tap channel models.It is notable that among different wire-tap channel models, the fading channel model has been an important model to efficiently capture the basic time-varying properties of wireless channels.Available works related to physical layer security study of the fading wire-tap channel are mainly based on the assumption that the channel from a transmitter to a legitimate receiver is independent of the one from the transmitter to an eavesdropper.In practice, however, the correlation among channels from a transmitter to different receivers has been frequently observed.Therefore, understanding the performance of physical layer security under the more practical correlated fading channels is of great importance for practical applications of physical layer security in wireless networks.In this thesis, we aim to provide a comprehensive study on the fundamental performance limits of physical layer security under a fading wire-tap channel, where the channel from transmitter to legitimate receiver is correlated with the one from transmitter to eavesdropper.We start the study from the scenario when the transmission power is asymptotically infinite.In particular, we first provide an informationtheoretic formulation of secure transmission over wireless fading channels at one realization of coherence interval in the high transmission power regime and show that the secrecy capacity is limited by the channel gain ratio of the main and eavesdropper channels rather than the transmission power, which is different from the Shannon's capacity that increases with transmission power.We next characterize the asymptotic outage probability and also asymptotic outage secrecy capacity for the correlated fading wire-tap channel as the transmission power goes to infinity.We then analyze the performance of physical layer security under correlated fading wire-tap channel with a limited transmission power, a more complicate scenario compared with the one with asymptotic-infinite power.Specifically, we provide theoretical modeling for the secrecy capacity, transmission outage probability and secrecy outage probability of such systems.In particular, we first derive a simple closedform expression of secrecy capacity based on the typical Marcum Q function.This is achieved by exploring the symmetry property between the main channel and eavesdropper channel such that some complicated integration operations involved in the secrecy capacity analysis can be significantly simplified.We then derive the transmission outage probability and secrecy outage probability to depict the reliability and security performances of the concerned wire-tap channel.Finally, extensive numerical results are provided to illustrate the inherent performance tradeoffs under i I am truly and deeply indebted to so many people that there is no way to acknowledge them all, or even any of them properly.Without their support, help and encouragement, this work would not and could not haven been done.I extend my deepest gratitude to all.

Mar 1, 20140 citations

Information-theoretic Secrecy in Multi-user Channels

Ersen Ekrem

Inherent openness of the wireless medium imposes stronger challenges on the security of wireless communications. Information-theoretic security addresses these challenges at the physical layer by using tools from wireless communication theory, signal processing and information theory. In information-theoretic security, physical layer communication is intelligently designed to exploit the characteristics of the wireless medium, such as fading, interference, cooperation, and multi-dimensional signaling, in order to provide or improve security. In this dissertation, we study the security of several fundamental wireless network configurations from an information-theoretic perspective. First, we study the Gaussian multiple-input multiple-output (MIMO) wiretap channel. In this channel, the transmitter sends a common message to both the legitimate user and the eavesdropper. In addition to the common message, a private message is sent only to the legitimate user, which needs to be kept hidden as much as possible from the eavesdropper. We obtain the entire capacity-equivocation region for this channel model. In particular, we show the sufficiency of jointly Gaussian auxiliary random variables and channel input to evaluate the existing single-letter description of the capacity-equivocation region due to Csiszar-Korner. Next, we study the secure broadcasting problem, where a transmitter wants to have secure communication with multiple legitimate users in the presence of an external eavesdropper. We study several special cases of the secure broadcasting problem. First, we consider the degraded multi-receiver wiretap channel, and establish its secrecy capacity region. Second, we consider the parallel less noisy multi-receiver wiretap channel, and obtain its common message secrecy capacity and sum secrecy capacity. Third, we consider the parallel degraded multi-receiver wiretap channel for the two-user and two-sub-channel case, and obtain its entire secrecy capacity region. Finally, we consider a parallel channel model with two sub-channels, where the transmitter can use only one of the subchannels at any time, and characterize its secrecy capacity region. Then, we study the two-user Gaussian MIMO broadcast channel with common and confidential messages. In this channel model, the transmitter sends a common message to both users, and a confidential message to each user which needs to be kept perfectly secret from the other user. We obtain the entire capacity region of this channel. We also explore the connections between this channel model and its non-confidential counterpart, i.e., the Gaussian MIMO broadcast channel with common and private message. Next, we consider the Gaussian MIMO multi-receiver wiretap channel and obtain its secrecy capacity region for the most general case. We first show that even for the single-input single-output (SISO) case, existing converse techniques fall short of proving the secrecy capacity region, to emphasize the need for a new proof technique, which we develop by using the relationships between the Fisher information and the differential entropy. Using this new proof technique, we obtain the secrecy capacity region of the degraded MIMO channel. We then establish the secrecy capacity region of the general MIMO channel by using the channel enhancement technique in conjunction with the capacity result we obtained for the degraded MIMO channel. For the general MIMO channel, we show that dirty-paper coding (DPC) combined with stochastic encoding attains the entire secrecy capacity region. Then, we study the multi-receiver wiretap channel for a more general scenario, where, in addition to confidential messages, the transmitter sends public messages to the legitimate users, on which there are no secrecy constraints. First, we consider the degraded discrete memoryless channel, and obtain inner and outer bounds for the capacity region. These inner and outer bounds match for certain cases, providing the capacity region. Second, we obtain an inner bound for the general discrete memoryless channel by using Marton's inner bound. Third, we consider the degraded Gaussian MIMO channel, and show that jointly Gaussian auxiliary random variables and channel input are sufficient to exhaust the inner and outer bounds. Finally, we provide an inner bound for the capacity region of the general Gaussian MIMO channel. Next, we focus on the multiple access wiretap (MAC-WT) channel whose capacity region is unknown. We consider a special class of MAC-WT channels which we call the weak eavesdropper class, where each user's link to the legitimate receiver is stronger than its link to the eavesdropper. For this class of channels, we develop an outer bound for the secrecy capacity region, which partially matches the achievable region in an n-letter form. We evaluate a looser version of our outer bound for the Gaussian case, and show that our outer bound is within 0.5 bits/channel use of the achievable rates along the individual secrecy rates for all weak eavesdropper Gaussian MAC-WT. Then, we investigate the effects of user cooperation on the secrecy of broadcast channels by considering the cooperative relay broadcast channel (CRBC). We propose an achievable scheme that combines Marton's coding scheme for broadcast channels and Cover and El Gamal's compress-and-forward (CAF) scheme for relay channels. For the Gaussian CRBC, we show that both users can have positive secrecy rates, which is not possible for scalar Gaussian broadcast channels without cooperation. We further investigate the effects of user cooperation on secrecy by considering the multiple access channel with generalized feedback (MAC-GF), which can be viewed as the MAC-dual of the CRBC. We propose a CAF-based achievable secrecy rate region for the MAC-GF. Specializing our results to a Gaussian MAC-GF, we present numerical results which demonstrate that cooperation can improve secrecy for the MAC-GF. Next, we study the two-user one-eavesdropper discrete memoryless compound wiretap channel, and provide the best known lower bound for the secrecy capacity of this compound channel. We evaluate this achievable secrecy rate for the Gaussian MIMO case by using DPC. We show that this achievable secrecy rate achieves at least half of the secrecy capacity of this Gaussian MIMO compound wiretap channel, and also attains the secrecy capacity when the eavesdropper is degraded with respect to one of the two users. Then, we study the degraded compound multi-receiver wiretap channel (DCMRWC), which, in addition to a group of eavesdroppers, has two groups of users, namely the stronger group and the weaker group. We study two different communication scenarios for this channel. In the first scenario, there is only one eavesdropper, and the transmitter sends a confidential message to each group of legitimate users while keeping both messages secret from the eavesdropper. In the second scenario, we study the DCMRWC with layered messages without any restriction on the number of eavesdroppers. For both scenarios, we obtain the secrecy capacity region for the discrete memoryless channel, the parallel channel, and the Gaussian parallel channel. For the Gaussian MIMO channel, we obtain the secrecy capacity region when there is only one user in the second group. Next, we study the two-user fading broadcast channel and obtain its ergodic secrecy capacity region. We show that, thanks to fading, both users can have simultaneous secure communication with the transmitter, although this is not possible in the scalar non-fading Gaussian broadcast channel where only one user can have secure communication. This simultaneous secrecy of both users is achieved by an opportunistic communication scheme, in which, at each time instant, the transmitter communicates with the user having a better channel gain. Then, we study the secure lossy transmission of a vector Gaussian source to a legitimate user in the presence of an eavesdropper, where both the legitimate user and the eavesdropper have vector Gaussian side information. We obtain an outer bound for the rate, equivocation and distortion region. Moreover, we obtain the maximum equivocation at the eavesdropper when there is no constraint on the transmission rate. By using this maximum equivocation result, we show two facts. First, for this problem, in general, Wyner-Ziv scheme is suboptimal, although, it is optimal in the absence of an eavesdropper. And, second, even when there is no transmission rate constraint, an uncoded transmission scheme is suboptimal; the presence of an eavesdropper necessitates the use of a coded scheme to attain the maximum equivocation. Finally, we revisit the secure lossy source coding problem. In all works on this problem, either the equivocation of the source at the eavesdropper or the equivocation of the legitimate user's reconstruction of the source at the eavesdropper is used to measure secrecy. We first propose the relative equivocation of the source at the eavesdropper with respect to the legitimate user as a new secrecy measure. We argue that this new secrecy measure is the one that corresponds to the natural generalization of the equivocation in a wiretap channel to the context of secure lossy source coding. Under this new secrecy measure, we provide a single-letter description of the rate, relative equivocation and distortion region, as well as its specializations to degraded and reversely degraded cases. We investigate the relationships between the optimal scheme that attains this region and the Wyner-Ziv scheme.

Jan 1, 20120 citations

Communicating over wireless channels with information-theoretic secrecy

Xiaojun Tang

Wireless systems are susceptible to eavesdropping as an unwelcome result of the broadcast nature of the wireless medium. Fortunately, the wireless medium also provides endowments including the temporal dispersion, the capability of signal superposition and other properties, to facilitate defending against eavesdropping. The focus of the thesis is to provide schemes for utilizing these properties at the physical layer and their performance analysis from an information-theoretic secrecy perspective. The work is based on Wyner's results on the wire-tap channel, in which the transmission between two legitimate users (Alice and Bob) is eavesdropped upon by Eve. The secrecy level is measured by the equivocation rate at Eve. The system performance is measured by the secrecy capacity. This is the maximum rate at which a message can be sent from Alice to Bob, while constraining the equivocation rate at Eve equal to the communication rate, and thus ensuring that Eve cannot deduce any useful information asymptotically. First, the scenario where a secret message needs to be delivered to the intended receiver within a given delay constraint and without the knowledge of the channel state information (CSI) at the transmitter is considered. In particular, hybrid automatic retransmission request (HARQ) protocols are revisited for a block-fading wire-tap channel via a joint consideration of channel coding, secrecy coding, and retransmission protocols. Two secure HARQ protocols: a repetition time diversity (RTD) scheme with maximal-ratio combining, and an incremental redundancy (INR) scheme based on ratecompatible Wyner secrecy codes are analyzed via an outage-based formulation. The throughput of RTD and INR protocols under probabilistic outage requirements is derived. Asymptotic analysis and numerical computations are given to demonstrate both the benefits of HARQ protocols and the tradeoff between reliability and confidentiality in delay-constrained communications. Second, the effects of interference on information-theoretic secret communication is considered. More specifically, the wiretap channel with a helping interferer (WT-HI) is proposed and studied. Here, an interferer, which does not know the confidential message, helps in ensuring the secrecy of the message by sending independent signals. Achievable secrecy rates and upper bounds on the secrecy capacity are given for both discrete memoryless and Gaussian channels. Interference has conventionally been regarded as a harmful phenomenon that leads to decreasing the rate and the reliability performance of wireless systems. In this work, it is shown that interference can be exploited to assist wireless secrecy. Lastly, the problem of secret key generation over fading channels, in which there exists an additional authenticated, public and error-free feedback channel from Bob to Alice, is considered. A key generation scheme consisting of a communication phase and a key-generation phase is presented. The communication phase is based on layered broadcast coding, which adapts the decoded rate at Bob to the actual channel state without requiring CSI available at Alice. The key-generation phase is based on the messages decoded by Bob after the communication phase and the public feedback. The achievable secrecy key rate and the optimal power distribution over coded layers for maximizing the secrecy key rate are characterized. Theoretical and numerical results show that the broadcast approach outperforms the single-level-coding based approach significantly, and hence demonstrate the role of introducing self-interference in facilitating secret-key generation over slowly fading channels when transmit CSI is not available.

Jan 1, 20100 citations