Strong Secrecy From Channel Resolvability
TLDR
It is shown that at least for symmetric wiretap channels, random capacity- based constructions fail to achieve the strong secrecy capacity, while channel-resolvability-based constructions achieve it.Abstract:
We analyze physical-layer security based on the premise that the coding mechanism for secrecy over noisy channels is tied to the notion of channel resolvability. Instead of considering capacity-based constructions, which associate to each message a subcode that operates just below the capacity of the eavesdropper's channel, we consider channel-resolvability-based constructions, which associate to each message a subcode that operates just above the resolvability of the eavesdropper's channel. Building upon the work of Csiszar and Hayashi, we provide further evidence that channel resolvability is a powerful and versatile coding mechanism for secrecy by developing results that hold for strong secrecy metrics and arbitrary channels. Specifically, we show that at least for symmetric wiretap channels, random capacity-based constructions fail to achieve the strong secrecy capacity, while channel-resolvability-based constructions achieve it. We then leverage channel resolvability to establish the secrecy-capacity region of arbitrary broadcast channels with confidential messages and a cost constraint for strong secrecy metrics. Finally, we specialize our results to study the secrecy capacity of wireless channels with perfect channel state information (CSI), mixed channels, and compound channels with receiver CSI, as well as the secret-key capacity of source models for secret-key agreement. By tying secrecy to channel resolvability, we obtain achievable rates for strong secrecy metrics with simple proofs.read more
Citations
More filters
Journal ArticleDOI
Classifications and Applications of Physical Layer Security Techniques for Confidentiality: A Comprehensive Survey
TL;DR: A conceptual, generic, and expandable framework for classifying the existing PLS techniques against wireless passive eavesdropping is proposed, and the security techniques that are reviewed are divided into two primary approaches: signal-to-interference-plus-noise ratio- based approach and complexity-based approach.
Journal ArticleDOI
Covert Communication Over Noisy Channels: A Resolvability Perspective
TL;DR: A coding scheme based on the principle of channel resolvability is developed, which proves that if the receiver's channel is better than the warden's channel, it is possible to communicate on the order of √n reliable and covert bits over n channel uses without a secret key.
Journal ArticleDOI
Hiding information in noise: fundamental limits of covert wireless communication
TL;DR: In this paper, the fundamental limits of covert communication systems are discussed, and a vision for the future of such systems as well is provided. But, the limitation of these methods is not discussed.
Journal ArticleDOI
Wireless physical layer security.
TL;DR: This paper provides a review of recent research in the field of physical layer security and an overview of the potential of the physical properties of the radio channel itself to provide communications security.
Journal ArticleDOI
Covert Communication over Noisy Channels: A Resolvability Perspective
TL;DR: In this article, the authors considered the problem of channel resolvability with respect to a warden, who observes the signals through another discrete memoryless channel, and showed that the receiver's channel is better than the warden's channel in a sense that we make precise.
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
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
Channel Coding Rate in the Finite Blocklength Regime
TL;DR: It is shown analytically that the maximal rate achievable with error probability ¿ isclosely approximated by C - ¿(V/n) Q-1(¿) where C is the capacity, V is a characteristic of the channel referred to as channel dispersion, and Q is the complementary Gaussian cumulative distribution function.
Journal ArticleDOI
The Gaussian wire-tap channel
TL;DR: Wyner's results for discrete memoryless wire-tap channels are extended and it is shown that the secrecy capacity Cs is the difference between the capacities of the main and wire.tap channels.
Journal ArticleDOI
Secret key agreement by public discussion from common information
TL;DR: It is shown that such a secret key agreement is possible for a scenario in which all three parties receive the output of a binary symmetric source over independent binary asymmetric channels, even when the enemy's channel is superior to the other two channels.