260 research outputs found
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 Communication over Parallel Relay Channel
We investigate the problem of secure communication over parallel relay
channel in the presence of a passive eavesdropper. We consider a four terminal
relay-eavesdropper channel which consists of multiple relay-eavesdropper
channels as subchannels. For the discrete memoryless model, we establish outer
and inner bounds on the rate-equivocation region. The inner bound allows mode
selection at the relay. For each subchannel, secure transmission is obtained
through one of two coding schemes at the relay: decoding-and-forwarding the
source message or confusing the eavesdropper through noise injection. For the
Gaussian memoryless channel, we establish lower and upper bounds on the perfect
secrecy rate. Furthermore, we study a special case in which the relay does not
hear the source and show that under certain conditions the lower and upper
bounds coincide. The results established for the parallel Gaussian
relay-eavesdropper channel are then applied to study the fading
relay-eavesdropper channel. Analytical results are illustrated through some
numerical examples.Comment: To Appear in IEEE Transactions on Information Forensics and Securit
Multiple Access Channels with Generalized Feedback and Confidential Messages
This paper considers the problem of secret communication over a multiple
access channel with generalized feedback. Two trusted users send independent
confidential messages to an intended receiver, in the presence of a passive
eavesdropper. In this setting, an active cooperation between two trusted users
is enabled through using channel feedback in order to improve the communication
efficiency. Based on rate-splitting and decode-and-forward strategies,
achievable secrecy rate regions are derived for both discrete memoryless and
Gaussian channels. Results show that channel feedback improves the achievable
secrecy rates.Comment: To appear in the Proceedings of the 2007 IEEE Information Theory
Workshop on Frontiers in Coding Theory, Lake Tahoe, CA, September 2-6, 200
On Secure Transmission over Parallel Relay Eavesdropper Channel
We study a four terminal parallel relay-eavesdropper channel which consists
of multiple independent relay-eavesdropper channels as subchannels. For the
discrete memoryless case, we establish inner and outer bounds on the
rate-equivocation region. For each subchannel, secure transmission is obtained
through one of the two coding schemes at the relay: decoding-and-forwarding the
source message or confusing the eavesdropper through noise injection. The inner
bound allows relay mode selection. For the Gaussian model we establish lower
and upper bounds on the perfect secrecy rate. We show that the bounds meet in
some special cases, including when the relay does not hear the source. We
illustrate the analytical results through some numerical examples.Comment: 8 pages, Presented at the Forty-Eighth Annual Allerton Conference on
Communication, Control, and Computing, September 29 - October 1, 2010,
Monticello, IL, US
- …