In Physical Layer Network Coding (PLNC), since the two sources access the relay station at a time, the relay station can hardly demodulate each information owing to the mutual interference between two transmitted signals. The PLNC achieves the high secure relay communication based on physical layer security (PLS). The source needs the transmit power control based on the channel state information (CSI) for maintaining the secure mutual interference. The untrusted relay, however, may impersonate the CSI for breaking it. So far, the authors have evaluated the amount of the leaked information to the untrusted relay by the impersonation of CSI but the leaked information is not maximal. For the countermeasure to the impersonation of CSI, the most powerful model of the untrusted relay to maximizing the leaked information is necessary. This paper constructs the optimal impersonation of CSI by a linear programing problem.
In Physical Layer Network Coding (PLNC), since the two sources access the relay station at a time, the relay station can hardly demodulate each information owing to the mutual interference between two transmitted signals. The PLNC achieves the high secure relay communication based on physical layer security (PLS). The source needs the transmit power control based on the channel state information (CSI) for maintaining the secure mutual interference. The untrusted relay, however, may impersonate the CSI for breaking it. So far, the authors have evaluated the amount of the leaked information to the untrusted relay by the impersonation of CSI but the leaked information is not maximal. For the countermeasure to the impersonation of CSI, the most powerful model of the untrusted relay to maximizing the leaked information is necessary. This paper constructs the optimal impersonation of CSI by a linear programing problem.
In Physical Layer Network Coding (PLNC), the two information sources access to the relay station, simultaneously and thus the transmitted signals are combined, together. Since the relay station hardly decodes each information single, the security for avoiding the information leak to the relay station is maintained. Therefore, the PLNC is attracting much attention in terms of physical layer security (PLS). However, the information source needs the transmit power control based on the channel state information (CSI). If the relay station is untrusted, it camouflages the real CSI for stealing the information. This paper considers the camouflaging of CSI is modeled as the liner programming problem in the subject to the statistic of CSI following the model of propagation. We clarify the maximal capacity of tapping by the relay station.
We proposed the physical layer security (PLS) under the untrusted relay in the wireless communication with the physical layer network coding (PLNC). In PLNC, the two information source accesses the relay station, simultaneously and thus it is difficult for the relay station to demodulate each signal due to the masking-effect from the other signal. As a result, the leakage of information to the untrusted relay is avoidable. The transmit power control (TPC) for the balancing between the two received signal powers is powerful. The secure capacity is enlarged but has not been optimized for maximizing the secure capacity. In this paper, the quasi-optimization of TPC for enlarging secure capacity is derived in the wireless communication with the untrusted relay and PLNC.
The Physical Layer Security (PLS) technology has been proved to be an effective way to reduce information leakage in wireless communication networks. This paper discusses the problem of secure transmission for Amplify-and-Forward (AF) cooperative network which contains both an external eavesdropper and some untrusted relays at the same time, where each relay acts as a helper of transmitting information and a potential eavesdropper. We adopt the technology of Cooperative Jamming (CJ), which yields a significant performance in terms of providing a better level of security against eavesdropping and improving the secure transmission performance of the system. First we discuss the security performance of this new system model, give the secrecy rate in theory and derive a tight lower bound of this secrecy rate. Then we propose a relay selection scheme, which avoids using the channel state information (CSI) of external eavesdropper, to transmit information. Afterward, we also discuss the problem of power allocation in order to maximize the secrecy rate.
Relying on physical layer security is an attractive alternative of utilizing cryptographic algorithms at upper layers of protocol stack for secure communications. In this paper, we consider a two-hop wireless relay network in the presence of an eavesdropper. Our scenario of interest spans over a four-node network model including a source, a destination, a trusted relay, and an untrusted eavesdropper in which the relay forwards the source message in a decode-and-forward (DF) fashion. The source and relay are allowed to use some of their available power to transmit jamming signals in order to create interference at the eavesdropper. The relay and destination are assumed to have the knowledge of the jamming signals. An important question is how to allocate the transmission power of the message signal and that of the jamming signal. First, we propose an optimal power allocation solution in which the knowledge of global channel state information (CSI) is required. To facilitate practical system design, two simple yet sub-optimal power allocation solutions are proposed which do not rely on eavesdropper's channels. For the purpose of performance comparisons, power allocation problems for two benchmark schemes without jamming are also analyzed.
In this paper, we investigate the problem of secure communication with covert requirement in untrusted relaying networks. Our considered system model contains one source, one destination, one untrusted relay, and one Willie. The untrusted relay tries to extract the information signal, while the goal of Willie is to detect the presence of the information signal transmitted by the source, in the current time slot. To overcome these two attacks, it is assumed that the destination and the source inject jamming signal to the network in phase I and phase II, respectively. Accordingly, the communication in our proposed system model is accomplished in two phases. In the first phase, when the source transmits its data to the untrusted relay, the destination broadcasts its jamming signal. In the second phase, when the relay retransmits the received signal, the source transmits a jamming signal with one of its antennas. For this system model, we suggest a novel power allocation strategy to maximize the instantaneous secrecy rate subject to satisfying the covert requirements in both of the phases. Since the proposed optimization problem is non-convex, the Successive Convex Approximation (SCA) method is used to change it to a convex optimization problem. Numerical curves are presented to reveal the impact of the untrusted relay's location an number of source antennas on the secrecy performance.
This paper studies robust transmit design for secure AF relay networks with imperfect channel state information (CSI). Two CSI error models, deterministically bounded error model and stochastic error model, are considered. In order to use the power at relays more efficiently, a joint cooperative relaying and jamming scheme is considered, where relays cooperate to forward the source signal and simultaneously they cooperate to send jamming signals to confuse the eavesdroppers. In this joint cooperative relaying and jamming framework, we address the robust joint optimization of the relay weights and the input covariance matrix of jamming signals for secrecy rate maximization (SRM), under both total and individual relay power constraints. Specifically, for the case of deterministically bounded error model, where the CSI error can be specified by an uncertainty set, we maximize the worst-case secrecy rate. While for the case of stochastic error model, where the probability distribution of the CSI error is Gaussian, we maximize the outage constrained secrecy rate. The challenge of these considered SRM-based optimizations lies in their non-convexity. This paper shows that such SRM-based optimization can be solved in a convex fashion and via solving a sequence of semidefinite programs (SDPs). Numerical results are presented to show the efficacy of the proposed scheme.