155 research outputs found
Power Allocation and Time-Domain Artificial Noise Design for Wiretap OFDM with Discrete Inputs
Optimal power allocation for orthogonal frequency division multiplexing
(OFDM) wiretap channels with Gaussian channel inputs has already been studied
in some previous works from an information theoretical viewpoint. However,
these results are not sufficient for practical system design. One reason is
that discrete channel inputs, such as quadrature amplitude modulation (QAM)
signals, instead of Gaussian channel inputs, are deployed in current practical
wireless systems to maintain moderate peak transmission power and receiver
complexity. In this paper, we investigate the power allocation and artificial
noise design for OFDM wiretap channels with discrete channel inputs. We first
prove that the secrecy rate function for discrete channel inputs is nonconcave
with respect to the transmission power. To resolve the corresponding nonconvex
secrecy rate maximization problem, we develop a low-complexity power allocation
algorithm, which yields a duality gap diminishing in the order of
O(1/\sqrt{N}), where N is the number of subcarriers of OFDM. We then show that
independent frequency-domain artificial noise cannot improve the secrecy rate
of single-antenna wiretap channels. Towards this end, we propose a novel
time-domain artificial noise design which exploits temporal degrees of freedom
provided by the cyclic prefix of OFDM systems {to jam the eavesdropper and
boost the secrecy rate even with a single antenna at the transmitter}.
Numerical results are provided to illustrate the performance of the proposed
design schemes.Comment: 12 pages, 7 figures, accepted by IEEE Transactions on Wireless
Communications, Jan. 201
Low-power Secret-key Agreement over OFDM
Information-theoretic secret-key agreement is perhaps the most practically
feasible mechanism that provides unconditional security at the physical layer
to date. In this paper, we consider the problem of secret-key agreement by
sharing randomness at low power over an orthogonal frequency division
multiplexing (OFDM) link, in the presence of an eavesdropper. The low power
assumption greatly simplifies the design of the randomness sharing scheme, even
in a fading channel scenario. We assess the performance of the proposed system
in terms of secrecy key rate and show that a practical approach to key sharing
is obtained by using low-density parity check (LDPC) codes for information
reconciliation. Numerical results confirm the merits of the proposed approach
as a feasible and practical solution. Moreover, the outage formulation allows
to implement secret-key agreement even when only statistical knowledge of the
eavesdropper channel is available.Comment: 9 pages, 4 figures; this is the authors prepared version of the paper
with the same name accepted for HotWiSec 2013, the Second ACM Workshop on Hot
Topics on Wireless Network Security and Privacy, Budapest, Hungary 17-19
April 201
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
Power Allocation in Multiuser Parallel Gaussian Broadcast Channels With Common and Confidential Messages
We consider a broadcast communication over parallel channels, where the transmitter sends K+1 messages: one common message to all users, and K confidential messages to each user, which need to be kept secret from all unintended users. We assume partial channel state information at the transmitter, stemming from noisy channel estimation. Our main goal is to design a power allocation algorithm in order to maximize the weighted sum rate of common and confidential messages under a total power constraint. The resulting problem for joint encoding across channels is formulated as the cascade of two problems, the inner min problem being discrete, and the outer max problem being convex. Thereby, efficient algorithms for this kind of optimization program can be used as solutions to our power allocation problem. For the special case K=2 , we provide an almost closed-form solution, where only two single variables must be optimized, e.g., through dichotomic searches. To reduce computational complexity, we propose three new algorithms, maximizing the weighted sum rate achievable by two suboptimal schemes that perform per-user and per-channel encoding. By numerical results, we assess the performance of all proposed algorithms as a function of different system parameters
- …