A physical layer network coding based modify-and-forward with opportunistic secure cooperative transmission protocol

This paper investigates a new secure relaying scheme, namely physical layer network coding based modify-and-forward (PMF), in which a relay node linearly combines the decoded data sent by a source node with an encrypted key before conveying the mixed data to a destination node. We first derive the general expression for the generalized secrecy outage probability (GSOP) of the PMF scheme and then use it to analyse the GSOP performance of various relaying and direct transmission strategies. The GSOP performance comparison indicates that these transmission strategies offer different advantages depending on the channel conditions and target secrecy rates, and relaying is not always desirable in terms of secrecy. Subsequently, we develop an opportunistic secure transmission protocol for cooperative wireless relay networks and formulate an optimisation problem to determine secrecy rate thresholds (SRTs) to dynamically select the optimal transmission strategy for achieving the lowest GSOP. The conditions for the existence of the SRTs are derived for various channel scenarios

Physical-Layer Security: Wide-band Communications & Role of Known Interference

Data security is of such paramount importance that security measures have been implemented across all layers of a communication network. One layer at which security has not been fully developed and studied is the physical layer, the lowest layer of the protocol stack. Towards establishing fundamental limits of secure communications at the physical layer, we address in this dissertation two main problems. First, we study secure communication in the wide-band regime, and second we study the role of known interference in secure communication. The concept of channel capacity per unit cost was introduced by Verdu´ in 1990 to study the limits of cost-efficient wide-band communication. It was shown that orthogonal signaling can achieve the channel capacity per unit cost of memoryless stationary channels with a zero-cost input letter. The first part of this dissertation introduces the concept of secrecy capacity per unit cost to study cost-efficient wide- band secrecy communication. For degraded memoryless stationary wiretap channels, it is shown that an orthogonal coding scheme with randomized pulse position and constant pulse shape achieves the secrecy capacity per unit cost with a zero-cost input letter. For general memoryless stationary wiretap channels, the performance of orthogonal codes is studied, and the benefit of further randomizing the pulse shape is demonstrated via a simple example. Furthermore, the problem of secure communication in a MIMO setting is considered, and a single-letter expression for the secrecy capacity per unit cost is obtained for the MIMO wiretap channel. Recently there has been a lot of success in using the deterministic approach to provide approximate characterization of Gaussian network capacity. The second part of this dissertation takes a deterministic view and revisits the problem of wiretap channel with side information. A precise characterization of the secrecy capacity is obtained for a linear deterministic model, which naturally suggests a coding scheme which we show to achieve the secrecy capacity of the degraded Gaussian model (dubbed as “secret writing on dirty paper”) to within half a bit. The success of this approach allowed its application to the problem of “secret key agreement via dirty paper coding”, where also a suggested coding scheme achieves the secret-key capacity to within half a bit

Opportunistic secure transmission for wireless relay networks with modify-and-forward protocol

This paper investigates the security at the physical layer in cooperative wireless networks (CWNs) where the data transmission between nodes can be realised via either direct transmission (DT) or relaying transmission (RT) schemes. Inspired by the concept of physical-layer network coding (PNC), a secure PNC-based modify-and-forward (SPMF) is developed to cope with the imperfect shared knowledge of the message modification between relay and destination in the conventional modify-and-forward (MF). In this paper, we first derive the secrecy outage probability (SOP) of the SPMF scheme, which is shown to be a general expression for deriving the SOP of any MF schemes. By comparing the SOPs of various schemes, the usage of the relay is shown to be not always necessary and even causes a poorer performance depending on target secrecy rate and quality of channel links. To this extent, we then propose an opportunistic secure transmission protocol to minimise the SOP of the CWNs. In particular, an optimisation problem is developed in which secrecy rate thresholds (SRTs) are determined to find an optimal scheme among various DT and RT schemes for achieving the lowest SOP. Furthermore, the conditions for the existence of SRTs are derived with respect to various channel conditions to determine if the relay could be relied on in practice