Journal ArticleDOI
Wireless Information-Theoretic Security
TLDR
A practical secure communication protocol is developed, which uses a four-step procedure to ensure wireless information-theoretic security and is shown that the protocol is effective in secure key renewal-even in the presence of imperfect channel state information.Abstract:
This paper considers the transmission of confidential data over wireless channels. Based on an information-theoretic formulation of the problem, in which two legitimates partners communicate over a quasi-static fading channel and an eavesdropper observes their transmissions through a second independent quasi-static fading channel, the important role of fading is characterized in terms of average secure communication rates and outage probability. Based on the insights from this analysis, a practical secure communication protocol is developed, which uses a four-step procedure to ensure wireless information-theoretic security: (i) common randomness via opportunistic transmission, (ii) message reconciliation, (iii) common key generation via privacy amplification, and (iv) message protection with a secret key. A reconciliation procedure based on multilevel coding and optimized low-density parity-check (LDPC) codes is introduced, which allows to achieve communication rates close to the fundamental security limits in several relevant instances. Finally, a set of metrics for assessing average secure key generation rates is established, and it is shown that the protocol is effective in secure key renewal-even in the presence of imperfect channel state information.read more
Citations
More filters
Journal ArticleDOI
Secure Transmission With Multiple Antennas—Part II: The MIMOME Wiretap Channel
Ashish Khisti,Gregory W. Wornell +1 more
TL;DR: The role of multiple antennas for secure communication is investigated within the framework of Wyner's wiretap channel, and a masked beamforming scheme that radiates power isotropically in all directions attains near-optimal performance in the high SNR regime.
Journal ArticleDOI
Improving Wireless Physical Layer Security via Cooperating Relays
TL;DR: Novel system designs are proposed, consisting of the determination of relay weights and the allocation of transmit power, that maximize the achievable secrecy rate subject to a transmit power constraint, or minimize the transmit powersubject to a secrecy rate constraint.
Journal ArticleDOI
Principles of Physical Layer Security in Multiuser Wireless Networks: A Survey
TL;DR: A comprehensive review of the domain of physical layer security in multiuser wireless networks, with an overview of the foundations dating back to the pioneering work of Shannon and Wyner on information-theoretic security and observations on potential research directions in this area.
Journal ArticleDOI
On the Secrecy Capacity of Fading Channels
TL;DR: The positive impact of fading on the secrecy capacity is revealed and the critical role of rate adaptation, based on the main channel CSI, in facilitating secure communications over slow fading channels is established.
Journal ArticleDOI
Secure Communication Over Fading Channels
TL;DR: In this article, the secrecy capacity region of the fading broadcast channel with confidential messages (BCC) was investigated, where a source node has common information for two receivers (receivers 1 and 2), and has confidential information intended only for receiver 1.
References
More filters
Journal ArticleDOI
The wire-tap channel
TL;DR: This paper finds the trade-off curve between R and d, assuming essentially perfect (“error-free”) transmission, and implies that there exists a Cs > 0, such that reliable transmission at rates up to Cs is possible in approximately perfect secrecy.
Journal ArticleDOI
Noiseless coding of correlated information sources
David Slepian,Jack K. Wolf +1 more
TL;DR: The minimum number of bits per character R_X and R_Y needed to encode these sequences so that they can be faithfully reproduced under a variety of assumptions regarding the encoders and decoders is determined.
Journal ArticleDOI
Broadcast channels with confidential messages
Imre Csiszár,János Körner +1 more
TL;DR: Given two discrete memoryless channels (DMC's) with a common input, a single-letter characterization is given of the achievable triples where R_{e} is the equivocation rate and the related source-channel matching problem is settled.
Journal ArticleDOI
Design of capacity-approaching irregular low-density parity-check codes
TL;DR: This work designs low-density parity-check codes that perform at rates extremely close to the Shannon capacity and proves a stability condition which implies an upper bound on the fraction of errors that a belief-propagation decoder can correct when applied to a code induced from a bipartite graph with a given degree distribution.