193 research outputs found
Secret Sharing over Fast-Fading MIMO Wiretap Channels
Secret sharing over the fast-fading MIMO wiretap channel is considered. A
source and a destination try to share secret information over a fast-fading
MIMO channel in the presence of a wiretapper who also makes channel
observations that are different from but correlated to those made by the
destination. An interactive authenticated unrestricted public channel is also
available for use by the source and destination in the secret sharing process.
This falls under the "channel-type model with wiretapper" considered by
Ahlswede and Csiszar. A minor extension of their result (to continuous channel
alphabets) is employed to evaluate the key capacity of the fast-fading MIMO
wiretap channel. The effects of spatial dimensionality provided by the use of
multiple antennas at the source, destination, and wiretapper are then
investigated.Comment: Revision submitted to EURASIP Journal on Wireless Communications and
Networking, Special Issue on Wireless Physical Layer Security, Sept. 2009.
v.3: Fixes to proofs. Matthieu Bloch added as co-author for contributions to
proof
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
An Error Probability Approach to MIMO Wiretap Channels
We consider MIMO (Multiple Input Multiple Output) wiretap channels, where a
legitimate transmitter Alice is communicating with a legitimate receiver Bob in
the presence of an eavesdropper Eve, and communication is done via MIMO
channels. We suppose that Alice's strategy is to use a codebook which has a
lattice structure, which then allows her to perform coset encoding. We analyze
Eve's probability of correctly decoding the message Alice meant to Bob, and
from minimizing this probability, we derive a code design criterion for MIMO
lattice wiretap codes. The case of block fading channels is treated similarly,
and fast fading channels are derived as a particular case. The Alamouti code is
carefully studied as an illustration of the analysis provided.Comment: 27 pages, 4 figure
A Survey on Wireless Security: Technical Challenges, Recent Advances and Future Trends
This paper examines the security vulnerabilities and threats imposed by the
inherent open nature of wireless communications and to devise efficient defense
mechanisms for improving the wireless network security. We first summarize the
security requirements of wireless networks, including their authenticity,
confidentiality, integrity and availability issues. Next, a comprehensive
overview of security attacks encountered in wireless networks is presented in
view of the network protocol architecture, where the potential security threats
are discussed at each protocol layer. We also provide a survey of the existing
security protocols and algorithms that are adopted in the existing wireless
network standards, such as the Bluetooth, Wi-Fi, WiMAX, and the long-term
evolution (LTE) systems. Then, we discuss the state-of-the-art in
physical-layer security, which is an emerging technique of securing the open
communications environment against eavesdropping attacks at the physical layer.
We also introduce the family of various jamming attacks and their
counter-measures, including the constant jammer, intermittent jammer, reactive
jammer, adaptive jammer and intelligent jammer. Additionally, we discuss the
integration of physical-layer security into existing authentication and
cryptography mechanisms for further securing wireless networks. Finally, some
technical challenges which remain unresolved at the time of writing are
summarized and the future trends in wireless security are discussed.Comment: 36 pages. Accepted to Appear in Proceedings of the IEEE, 201
A Survey of Physical Layer Security Techniques for 5G Wireless Networks and Challenges Ahead
Physical layer security which safeguards data confidentiality based on the
information-theoretic approaches has received significant research interest
recently. The key idea behind physical layer security is to utilize the
intrinsic randomness of the transmission channel to guarantee the security in
physical layer. The evolution towards 5G wireless communications poses new
challenges for physical layer security research. This paper provides a latest
survey of the physical layer security research on various promising 5G
technologies, including physical layer security coding, massive multiple-input
multiple-output, millimeter wave communications, heterogeneous networks,
non-orthogonal multiple access, full duplex technology, etc. Technical
challenges which remain unresolved at the time of writing are summarized and
the future trends of physical layer security in 5G and beyond are discussed.Comment: To appear in IEEE Journal on Selected Areas in Communication
To Obtain or not to Obtain CSI in the Presence of Hybrid Adversary
We consider the wiretap channel model under the presence of a hybrid, half
duplex adversary that is capable of either jamming or eavesdropping at a given
time. We analyzed the achievable rates under a variety of scenarios involving
different methods for obtaining transmitter CSI. Each method provides a
different grade of information, not only to the transmitter on the main
channel, but also to the adversary on all channels. Our analysis shows that
main CSI is more valuable for the adversary than the jamming CSI in both
delay-limited and ergodic scenarios. Similarly, in certain cases under the
ergodic scenario, interestingly, no CSI may lead to higher achievable secrecy
rates than with CSI.Comment: 8 pages, 3 figure
On the Transmit Beamforming for MIMO Wiretap Channels: Large-System Analysis
With the growth of wireless networks, security has become a fundamental issue
in wireless communications due to the broadcast nature of these networks. In
this work, we consider MIMO wiretap channels in a fast fading environment, for
which the overall performance is characterized by the ergodic MIMO secrecy
rate. Unfortunately, the direct solution to finding ergodic secrecy rates is
prohibitive due to the expectations in the rates expressions in this setting.
To overcome this difficulty, we invoke the large-system assumption, which
allows a deterministic approximation to the ergodic mutual information.
Leveraging results from random matrix theory, we are able to characterize the
achievable ergodic secrecy rates. Based on this characterization, we address
the problem of covariance optimization at the transmitter. Our numerical
results demonstrate a good match between the large-system approximation and the
actual simulated secrecy rates, as well as some interesting features of the
precoder optimization.Comment: Published in Lecture Notes in Computer Science 8317, pp. 90-102,
2014. (Proceedings of International Conference on Information-Theoretic
Security (ICITS), Singapore, November 2013
LDPC coded transmissions over the Gaussian broadcast channel with confidential messages
We design and assess some practical low-density parity-check (LDPC) coded
transmission schemes for the Gaussian broadcast channel with confidential
messages (BCC). This channel model is different from the classical wiretap
channel model as the unauthorized receiver (Eve) must be able to decode some
part of the information. Hence, the reliability and security targets are
different from those of the wiretap channel. In order to design and assess
practical coding schemes, we use the error rate as a metric of the performance
achieved by the authorized receiver (Bob) and the unauthorized receiver (Eve).
We study the system feasibility, and show that two different levels of
protection against noise are required on the public and the secret messages.
This can be achieved in two ways: i) by using LDPC codes with unequal error
protection (UEP) of the transmitted information bits or ii) by using two
classical non-UEP LDPC codes with different rates. We compare these two
approaches and show that, for the considered examples, the solution exploiting
UEP LDPC codes is more efficient than that using non-UEP LDPC codes.Comment: 5 pages, 5 figures, to be presented at IEEE ICT 201
Jamming Games in the MIMO Wiretap Channel With an Active Eavesdropper
This paper investigates reliable and covert transmission strategies in a
multiple-input multiple-output (MIMO) wiretap channel with a transmitter,
receiver and an adversarial wiretapper, each equipped with multiple antennas.
In a departure from existing work, the wiretapper possesses a novel capability
to act either as a passive eavesdropper or as an active jammer, under a
half-duplex constraint. The transmitter therefore faces a choice between
allocating all of its power for data, or broadcasting artificial interference
along with the information signal in an attempt to jam the eavesdropper
(assuming its instantaneous channel state is unknown). To examine the resulting
trade-offs for the legitimate transmitter and the adversary, we model their
interactions as a two-person zero-sum game with the ergodic MIMO secrecy rate
as the payoff function. We first examine conditions for the existence of
pure-strategy Nash equilibria (NE) and the structure of mixed-strategy NE for
the strategic form of the game.We then derive equilibrium strategies for the
extensive form of the game where players move sequentially under scenarios of
perfect and imperfect information. Finally, numerical simulations are presented
to examine the equilibrium outcomes of the various scenarios considered.Comment: 27 pages, 8 figures. To appear, IEEE Transactions on Signal
Processin
- âŠ