107 research outputs found
Cooperative Jamming for Secure Communications in MIMO Relay Networks
Secure communications can be impeded by eavesdroppers in conventional relay
systems. This paper proposes cooperative jamming strategies for two-hop relay
networks where the eavesdropper can wiretap the relay channels in both hops. In
these approaches, the normally inactive nodes in the relay network can be used
as cooperative jamming sources to confuse the eavesdropper. Linear precoding
schemes are investigated for two scenarios where single or multiple data
streams are transmitted via a decode-and-forward (DF) relay, under the
assumption that global channel state information (CSI) is available. For the
case of single data stream transmission, we derive closed-form jamming
beamformers and the corresponding optimal power allocation. Generalized
singular value decomposition (GSVD)-based secure relaying schemes are proposed
for the transmission of multiple data streams. The optimal power allocation is
found for the GSVD relaying scheme via geometric programming. Based on this
result, a GSVD-based cooperative jamming scheme is proposed that shows
significant improvement in terms of secrecy rate compared to the approach
without jamming. Furthermore, the case involving an eavesdropper with unknown
CSI is also investigated in this paper. Simulation results show that the
secrecy rate is dramatically increased when inactive nodes in the relay network
participate in cooperative jamming.Comment: 30 pages, 7 figures, to appear in IEEE Transactions on Signal
Processin
Principles of Physical Layer Security in Multiuser Wireless Networks: A Survey
This paper provides a comprehensive review of the domain of physical layer
security in multiuser wireless networks. The essential premise of
physical-layer security is to enable the exchange of confidential messages over
a wireless medium in the presence of unauthorized eavesdroppers without relying
on higher-layer encryption. This can be achieved primarily in two ways: without
the need for a secret key by intelligently designing transmit coding
strategies, or by exploiting the wireless communication medium to develop
secret keys over public channels. The survey begins with an overview of the
foundations dating back to the pioneering work of Shannon and Wyner on
information-theoretic security. We then describe the evolution of secure
transmission strategies from point-to-point channels to multiple-antenna
systems, followed by generalizations to multiuser broadcast, multiple-access,
interference, and relay networks. Secret-key generation and establishment
protocols based on physical layer mechanisms are subsequently covered.
Approaches for secrecy based on channel coding design are then examined, along
with a description of inter-disciplinary approaches based on game theory and
stochastic geometry. The associated problem of physical-layer message
authentication is also introduced briefly. The survey concludes with
observations on potential research directions in this area.Comment: 23 pages, 10 figures, 303 refs. arXiv admin note: text overlap with
arXiv:1303.1609 by other authors. IEEE Communications Surveys and Tutorials,
201
Secure Beamforming for MIMO Two-Way Communications with an Untrusted Relay
This paper studies the secure beamforming design in a multiple-antenna
three-node system where two source nodes exchange messages with the help of an
untrusted relay node. The relay acts as both an essential signal forwarder and
a potential eavesdropper. Both two-phase and three-phase two-way relay
strategies are considered. Our goal is to jointly optimize the source and relay
beamformers for maximizing the secrecy sum rate of the two-way communications.
We first derive the optimal relay beamformer structures. Then, iterative
algorithms are proposed to find source and relay beamformers jointly based on
alternating optimization. Furthermore, we conduct asymptotic analysis on the
maximum secrecy sum-rate. Our analysis shows that when all transmit powers
approach infinity, the two-phase two-way relay scheme achieves the maximum
secrecy sum rate if the source beamformers are designed such that the received
signals at the relay align in the same direction. This reveals an important
advantage of signal alignment technique in against eavesdropping. It is also
shown that if the source powers approach zero the three-phase scheme performs
the best while the two-phase scheme is even worse than direct transmission.
Simulation results have verified the efficiency of the secure beamforming
algorithms as well as the analytical findings.Comment: 10 figures, Submitted to IEEE Transactions on Signal Processin
Resource Allocation for Secure Gaussian Parallel Relay Channels with Finite-Length Coding and Discrete Constellations
We investigate the transmission of a secret message from Alice to Bob in the
presence of an eavesdropper (Eve) and many of decode-and-forward relay nodes.
Each link comprises a set of parallel channels, modeling for example an
orthogonal frequency division multiplexing transmission. We consider the impact
of discrete constellations and finite-length coding, defining an achievable
secrecy rate under a constraint on the equivocation rate at Eve. Then we
propose a power and channel allocation algorithm that maximizes the achievable
secrecy rate by resorting to two coupled Gale-Shapley algorithms for stable
matching problem. We consider the scenarios of both full and partial channel
state information at Alice. In the latter case, we only guarantee an outage
secrecy rate, i.e., the rate of a message that remains secret with a given
probability. Numerical results are provided for Rayleigh fading channels in
terms of average outage secrecy rate, showing that practical schemes achieve a
performance quite close to that of ideal ones
Secrecy Analysis on Network Coding in Bidirectional Multibeam Satellite Communications
Network coding is an efficient means to improve the spectrum efficiency of satellite communications. However, its resilience to eavesdropping attacks is not well understood. This paper studies the confidentiality issue in a bidirectional satellite network consisting of two mobile users who want to exchange message via a multibeam satellite using the XOR network coding protocol. We aim to maximize the sum secrecy rate by designing the optimal beamforming vector along with optimizing the return and forward link time allocation. The problem is nonconvex, and we find its optimal solution using semidefinite programming together with a 1-D search. For comparison, we also solve the sum secrecy rate maximization problem for a conventional reference scheme without using network coding. Simulation results using realistic system parameters demonstrate that the bidirectional scheme using network coding provides considerably higher secrecy rate compared with that of the conventional schem
- …