Secure GDoF of the Z-channel with Finite Precision CSIT: How Robust are Structured Codes?

Under the assumption of perfect channel state information at the transmitters (CSIT), it is known that structured codes offer significant advantages for secure communication in an interference network, e.g., structured jamming signals based on lattice codes may allow a receiver to decode the sum of the jamming signal and the signal being jammed, even though they cannot be separately resolved due to secrecy constraints, subtract the aggregate jammed signal, and then proceed to decode desired codewords at lower power levels. To what extent are such benefits of structured codes fundamentally limited by uncertainty in CSIT? To answer this question, we explore what is perhaps the simplest setting where the question presents itself -- a Z interference channel with secure communication. Using sum-set inequalities based on Aligned Images bounds we prove that the GDoF benefits of structured codes are lost completely under finite precision CSIT. The secure GDoF region of the Z interference channel is obtained as a byproduct of the analysis.Comment: 34 pages, 10 figure

Multi-layer Interference Alignment and GDoF of the K-User Asymmetric Interference Channel

In wireless networks, link strengths are often affected by some topological factors such as propagation path loss, shadowing and inter-cell interference. Thus, different users in the network might experience different link strengths. In this work we consider a K-user asymmetric interference channel, where the channel gains of the links connected to Receiver k are scaled with P^{\alpha_k /2}}, k=1,2,...,K, for 0< \alpha_1 \leq \alpha_2 \leq \cdots \leq \alpha_K \leq 1. For this setting, we show that the optimal sum generalized degrees-of-freedom (GDoF) is characterized as dsum = (\sum_{k=1}^K \alpha_k + \alpha_K -\alpha_{K-1})/2, which matches the existing result dsum= K/2 when \alpha_1 = \alpha_2 = ... = \alpha_K =1. The achievability is based on multi-layer interference alignment, where different interference alignment sub-schemes are designed in different layers associated with specific power levels, and successive decoding is applied at the receivers. While the converse for the symmetric case only requires bounding the sum degrees-of-freedom (DoF) for selected two users, the converse for this asymmetric case involves bounding the weighted sum GDoF for selected J+2 users, with corresponding weights (2^{J}, 2^{J-1}, ... , 2^{2}, 2^{1}), a geometric sequence with common ratio 2, for the first J users and with corresponding weights (1, 1) for the last two users, for J \in {1,2, ... , \lceil\log (K/2)\rceil }

Lecture Notes on Network Information Theory

These lecture notes have been converted to a book titled Network Information Theory published recently by Cambridge University Press. This book provides a significantly expanded exposition of the material in the lecture notes as well as problems and bibliographic notes at the end of each chapter. The authors are currently preparing a set of slides based on the book that will be posted in the second half of 2012. More information about the book can be found at http://www.cambridge.org/9781107008731/. The previous (and obsolete) version of the lecture notes can be found at http://arxiv.org/abs/1001.3404v4/

Optimal Pilots for Anti-Eavesdropping Channel Estimation

Anti-eavesdropping channel estimation (ANECE) is a method that uses specially designed pilot signals to allow two or more full-duplex radio devices each with one or more antennas to estimate their channel state information (CSI) consistently and at the same time prevent eavesdropper (Eve) with any number of antennas from obtaining its CSI consistently. This paper presents optimal designs of the pilots for ANECE based on two criteria. The first is the mean squared error (MSE) of channel estimation for the users, and the second is the mutual information (MI) between the pilot-driven signals observed by the users. Closed-form optimal pilots are shown under the sum-MSE and sum-MI criteria subject to a symmetric and isotropic condition. Algorithms for computing the optimal pilots are shown for general cases. Fairness issues for three or more users are discussed. The performances of different designs are compared

Security and reliability analysis of a two-way half-duplex wireless relaying network using partial relay selection and hybrid TPSR energy harvesting at relay nodes

In recent years, physical layer security has been considered as an effective method to enhance the information security beside the cryptographic techniques that are used in upper layers. In this paper, we provide the security analysis for a two-way relay network, where the two sources can only communicate through the intermediate relay nodes. In particular, we consider the scenario that there is an eavesdropper in the vicinity of one source node. Both reliability and security aspects are taken into consideration in our work. To enhance the reliability of communication, the intermediate relays are supplied with the energy harvested from the sources radio frequency (RF) signals using hybrid time-switching and power splitting (TPSR) protocol. Also, we apply the relay selection technique to select the best relay for the information exchange between two sources. Regarding security, the secrecy of information is improved with the help of friendly jammers nearby the eavesdropper. We provide the in-dept reliability and security analysis in terms of the closed-form expressions of the outage probability (OP) at the source nodes, the intercept probability (IP) at the eavesdropper, the secrecy outage probability (SOP), and the average secrecy capacity (ASC) of the system. Finally, the Monte Carlo simulations are also conducted to verify the correctness of our analysis and the effectiveness of the proposed scheme. Numerical results confirms that with the appropriate and feasible choices of involved parameters, both outage OP and IP can be kept at small values to guarantee the reliable and secure communication of the system.Web of Science818718118716

Achievable secrecy enchancement through joint encryption and privacy amplification

In this dissertation we try to achieve secrecy enhancement in communications by resorting to both cryptographic and information theoretic secrecy tools and metrics. Our objective is to unify tools and measures from cryptography community with techniques and metrics from information theory community that are utilized to provide privacy and confidentiality in communication systems. For this purpose we adopt encryption techniques accompanied with privacy amplification tools in order to achieve secrecy goals that are determined based on information theoretic and cryptographic metrics. Every secrecy scheme relies on a certain advantage for legitimate users over adversaries viewed as an asymmetry in the system to deliver the required security for data transmission. In all of the proposed schemes in this dissertation, we resort to either inherently existing asymmetry in the system or proactively created advantage for legitimate users over a passive eavesdropper to further enhance secrecy of the communications. This advantage is manipulated by means of privacy amplification and encryption tools to achieve secrecy goals for the system evaluated based on information theoretic and cryptographic metrics. In our first work discussed in Chapter 2 and the third work explained in Chapter 4, we rely on a proactively established advantage for legitimate users based on eavesdropper’s lack of knowledge about a shared source of data. Unlike these works that assume an errorfree physical channel, in the second work discussed in Chapter 3 correlated erasure wiretap channel model is considered. This work relies on a passive and internally existing advantage for legitimate users that is built upon statistical and partial independence of eavesdropper’s channel errors from the errors in the main channel. We arrive at this secrecy advantage for legitimate users by exploitation of an authenticated but insecure feedback channel. From the perspective of the utilized tools, the first work discussed in Chapter 2 considers a specific scenario where secrecy enhancement of a particular block cipher called Data Encryption standard (DES) operating in cipher feedback mode (CFB) is studied. This secrecy enhancement is achieved by means of deliberate noise injection and wiretap channel encoding as a technique for privacy amplification against a resource constrained eavesdropper. Compared to the first work, the third work considers a more general framework in terms of both metrics and secrecy tools. This work studies secrecy enhancement of a general cipher based on universal hashing as a privacy amplification technique against an unbounded adversary. In this work, we have achieved the goal of exponential secrecy where information leakage to adversary, that is assessed in terms of mutual information as an information theoretic measure and Eve’s distinguishability as a cryptographic metric, decays at an exponential rate. In the second work generally encrypted data frames are transmitted through Automatic Repeat reQuest (ARQ) protocol to generate a common random source between legitimate users that later on is transformed into information theoretically secure keys for encryption by means of privacy amplification based on universal hashing. Towards the end, future works as an extension of the accomplished research in this dissertation are outlined. Proofs of major theorems and lemmas are presented in the Appendix