Strongly Secure Communications Over the Two-Way Wiretap Channel

We consider the problem of secure communications over the two-way wiretap channel under a strong secrecy criterion. We improve existing results by developing an achievable region based on strategies that exploit both the interference at the eavesdropper's terminal and cooperation between legitimate users. We leverage the notion of channel resolvability for the multiple-access channel to analyze cooperative jamming and we show that the artificial noise created by cooperative jamming induces a source of common randomness that can be used for secret-key agreement. We illustrate the gain provided by this coding technique in the case of the Gaussian two-way wiretap channel, and we show significant improvements for some channel configurations.Comment: 11 pages, 7 figures, submitted to IEEE Transactions on Information Forensics and Security, Special Issue: "Using the Physical Layer for Securing the Next Generation of Communication Systems

Achieving Secrecy Capacity of the Gaussian Wiretap Channel with Polar Lattices

In this work, an explicit wiretap coding scheme based on polar lattices is proposed to achieve the secrecy capacity of the additive white Gaussian noise (AWGN) wiretap channel. Firstly, polar lattices are used to construct secrecy-good lattices for the mod-$\Lambda_s$ Gaussian wiretap channel. Then we propose an explicit shaping scheme to remove this mod-$\Lambda_s$ front end and extend polar lattices to the genuine Gaussian wiretap channel. The shaping technique is based on the lattice Gaussian distribution, which leads to a binary asymmetric channel at each level for the multilevel lattice codes. By employing the asymmetric polar coding technique, we construct an AWGN-good lattice and a secrecy-good lattice with optimal shaping simultaneously. As a result, the encoding complexity for the sender and the decoding complexity for the legitimate receiver are both O(N logN log(logN)). The proposed scheme is proven to be semantically secure.Comment: Submitted to IEEE Trans. Information Theory, revised. This is the authors' own version of the pape

Partial Strong Converse for the Non-Degraded Wiretap Channel

We prove the partial strong converse property for the discrete memoryless \emph{non-degraded} wiretap channel, for which we require the leakage to the eavesdropper to vanish but allow an asymptotic error probability $\epsilon \in [0,1)$ to the legitimate receiver. We show that when the transmission rate is above the secrecy capacity, the probability of correct decoding at the legitimate receiver decays to zero exponentially. Therefore, the maximum transmission rate is the same for $\epsilon \in [0,1)$, and the partial strong converse property holds. Our work is inspired by a recently developed technique based on information spectrum method and Chernoff-Cramer bound for evaluating the exponent of the probability of correct decoding

Information-theoretic Physical Layer Security for Satellite Channels

Shannon introduced the classic model of a cryptosystem in 1949, where Eve has access to an identical copy of the cyphertext that Alice sends to Bob. Shannon defined perfect secrecy to be the case when the mutual information between the plaintext and the cyphertext is zero. Perfect secrecy is motivated by error-free transmission and requires that Bob and Alice share a secret key. Wyner in 1975 and later I.~Csisz\'ar and J.~K\"orner in 1978 modified the Shannon model assuming that the channels are noisy and proved that secrecy can be achieved without sharing a secret key. This model is called wiretap channel model and secrecy capacity is known when Eve's channel is noisier than Bob's channel. In this paper we review the concept of wiretap coding from the satellite channel viewpoint. We also review subsequently introduced stronger secrecy levels which can be numerically quantified and are keyless unconditionally secure under certain assumptions. We introduce the general construction of wiretap coding and analyse its applicability for a typical satellite channel. From our analysis we discuss the potential of keyless information theoretic physical layer security for satellite channels based on wiretap coding. We also identify system design implications for enabling simultaneous operation with additional information theoretic security protocols

Enabling Technologies for 5G and Beyond: Bridging the Gap between Vision and Reality

It is common knowledge that the fifth generation (5G) of cellular networks will come with drastic transformation in the cellular systems capabilities and will redefine mobile services. 5G (and beyond) systems will be used for human interaction, in addition to person-to-machine and machine-to-machine communications, i.e., every-thing is connected to every-thing. These features will open a whole line of new business opportunities and contribute to the development of the society in many different ways, including developing and building smart cities, enhancing remote health care services, to name a few. However, such services come with an unprecedented growth of mobile traffic, which will lead to heavy challenges and requirements that have not been experienced before. Indeed, the new generations of cellular systems are required to support ultra-low latency services (less than one millisecond), and provide hundred times more data rate and connectivity, all compared to previous generations such as 4G. Moreover, they are expected to be highly secure due to the sensitivity of the transmitted information. Researchers from both academia and industry have been concerting significant efforts to develop new technologies that aim at enabling the new generation of cellular systems (5G and beyond) to realize their potential. Much emphasis has been put on finding new technologies that enhance the radio access network (RAN) capabilities as RAN is considered to be the bottleneck of cellular networks. Striking a balance between performance and cost has been at the center of the efforts that led to the newly developed technologies, which include non-orthogonal multiple access (NOMA), millimeter wave (mmWave) technology, self-organizing network (SON) and massive multiple-input multiple-output (MIMO). Moreover, physical layer security (PLS) has been praised for being a potential candidate for enforcing transmission security when combined with cryptography techniques. Although the main concepts of the aforementioned RAN key enabling technologies have been well defined, there are discrepancies between their intended (i.e., vision) performance and the achieved one. In fact, there is still much to do to bridge the gap between what has been promised by such technologies in terms of performance and what they might be able to achieve in real-life scenarios. This motivates us to identify the main reasons behind the aforementioned gaps and try to find ways to reduce such gaps. We first focus on NOMA where the main drawback of existing solutions is related to their poor performance in terms of spectral efficiency and connectivity. Another major drawback of existing NOMA solutions is that transmission rate per user decreases slightly with the number of users, which is a serious issue since future networks are expected to provide high connectivity. To this end, we develop NOMA solutions that could provide three times the achievable rate of existing solutions while maintaining a constant transmission rate per user regardless of the number of connected users. We then investigate the challenges facing mmWave transmissions. It has been demonstrated that such technology is highly sensitive to blockage, which limits its range of communication. To overcome this obstacle, we develop a beam-codebook based analog beam-steering scheme that achieves near maximum beamforming gain performance. The proposed technique has been tested and verified by real-life measurements performed at Bell Labs. Another line of research pursued in this thesis is investigating challenges pertaining to SON. It is known that radio access network self-planning is the most complex and sensitive task due to its impact on the cost of network deployment, etc., capital expenditure (CAPEX). To tackle this issue, we propose a comprehensive self-planning solution that provides all the planning parameters at once while guaranteeing that the system is optimally planned. The proposed scheme is compared to existing solutions and its superiority is demonstrated. We finally consider the communication secrecy problem and investigated the potential of employing PLS. Most of the existing PLS schemes are based on unrealistic assumptions, most notably is the assumption of having full knowledge about the whereabouts of the eavesdroppers. To solve this problem, we introduce a radically novel nonlinear precoding technique and a coding strategy that together allow to establish secure communication without any knowledge about the eavesdroppers. Moreover, we prove that it is possible to secure communications while achieving near transmitter-receiver channel capacity (the maximum theoretical rate)

Non-Adaptive Coding for Two-Way Wiretap Channel with or without Cost Constraints

This paper studies the secrecy results for the two-way wiretap channel (TW-WC) with an external eavesdropper under a strong secrecy metric. Employing non-adaptive coding, we analyze the information leakage and the decoding error probability, and derive inner bounds on the secrecy capacity regions for the TW-WC under strong joint and individual secrecy constraints. For the TW-WC without cost constraint, both the secrecy and error exponents could be characterized by the conditional R\'enyi mutual information in a concise and compact form. And, some special cases secrecy capacity region and sum-rate capacity results are established, demonstrating that adaption is useless in some cases or the maximum sum-rate that could be achieved by non-adaptive coding. For the TW-WC with cost constraint, we consider the peak cost constraint and extend our secrecy results by using the constant composition codes. Accordingly, we characterize both the secrecy and error exponents by a modification of R\'enyi mutual information, which yields inner bounds on the secrecy capacity regions for the general discrete memoryless TW-WC with cost constraint. Our method works even when a pre-noisy processing is employed based on a conditional distribution in the encoder and can be easily extended to other multi-user communication scenarios

Weak Secrecy in the Multi-Way Untrusted Relay Channel with Compute-and-Forward

We investigate the problem of secure communications in a Gaussian multi-way relay channel applying the compute-and-forward scheme using nested lattice codes. All nodes employ half-duplex operation and can exchange confidential messages only via an untrusted relay. The relay is assumed to be honest but curious, i.e., an eavesdropper that conforms to the system rules and applies the intended relaying scheme. We start with the general case of the single-input multiple-output (SIMO) L-user multi-way relay channel and provide an achievable secrecy rate region under a weak secrecy criterion. We show that the securely achievable sum rate is equivalent to the difference between the computation rate and the multiple access channel (MAC) capacity. Particularly, we show that all nodes must encode their messages such that the common computation rate tuple falls outside the MAC capacity region of the relay. We provide results for the single-input single-output (SISO) and the multiple-input single-input (MISO) L-user multi-way relay channel as well as the two-way relay channel. We discuss these results and show the dependency between channel realization and achievable secrecy rate. We further compare our result to available results in the literature for different schemes and show that the proposed scheme operates close to the compute-and-forward rate without secrecy.Comment: submitted to JSAC Special Issue on Fundamental Approaches to Network Coding in Wireless Communication System