scispace - formally typeset
Proceedings ArticleDOI

The broadcast approach over fading Gaussian wiretap channels

TLDR
A (layered) broadcast approach is studied for fading wiretap channels to employ superposition coding to encode information into a number of layers and use stochastic encoding for each layer to keep the corresponding information secret from an eavesdropper.
Abstract
A (layered) broadcast approach is studied for fading wiretap channels. The basic idea is to employ superposition coding to encode information into a number of layers and use stochastic encoding for each layer to keep the corresponding information secret from an eavesdropper. The legitimate receiver successively decodes information one layer after another by canceling the interference caused by the layers that the receiver has already decoded. The advantage of this approach is that the transmitter does not need to know the channel states to the legitimate receiver and the eavesdropper, but can still securely transmit certain layers of information to the legitimate receiver. The layers that can be securely transmitted are determined by the channel states to the legitimate receiver and the eavesdropper. The Gaussian wiretap channel with fixed channel gains is first studied to illustrate the idea of the broadcast approach. Three cases of block fading wiretap channels with a stringent delay constraint are then studied, in which either the legitimate receiver's channel, the eavesdropper's channel, or both channels are fading. For each case, the secrecy rate that can be achieved by using the broadcast approach is obtained, and the optimal power allocation over the layers (or the conditions on the optimal power allocation) is also derived.

read more

Citations
More filters
Book

Physical-Layer Security: From Information Theory to Security Engineering

TL;DR: In this article, the theoretical foundations, practical implementation, challenges and benefits of a groundbreaking new model for secure communication are presented, using a bottom-up approach from the link level all the way to end-to-end architectures.
Journal ArticleDOI

Lattice Codes for the Wiretap Gaussian Channel: Construction and Analysis

TL;DR: This work considers the Gaussian wiretap channel, where two legitimate players Alice and Bob communicate over an additive white Gaussian noise channel, while Eve is eavesdropping, also through an AWGN channel, and proposes a coding strategy based on lattice coset encoding.
Book ChapterDOI

Lattice Codes for the Wiretap Gaussian Channel: Construction and Analysis

TL;DR: This work considers the Gaussian wiretap channel, where two legitimate players Alice and Bob communicate over an additive white Gaussian noise channel, while Eve is eavesdropping, also through an AWGN channel, and proposes a coding strategy based on lattice coset encoding.
Journal ArticleDOI

A Broadcast Approach for Fading Wiretap Channels

TL;DR: A (layered) broadcast approach is studied for the fading wiretap channel without the channel state information (CSI) at the transmitter and the probabilistic secrecy, which characterizes the probability that a certain secrecy rate of decoded messages is achieved during one block, is introduced.
Journal ArticleDOI

On Energy-Secrecy Trade-Offs for Gaussian Wiretap Channels

TL;DR: This paper investigates physical-layer security-energy trade-offs from an information theoretic perspective and shows that a range of secrecy-energy operating points can be achieved with an appropriate allocation of power resources between private and nonprivate data substreams.
References
More filters
Journal ArticleDOI

Communication theory of secrecy systems

TL;DR: A theory of secrecy systems is developed on a theoretical level and is intended to complement the treatment found in standard works on cryptography.
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

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

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

Broadcast channels

TL;DR: This work introduces the problem of a single source attempting to communicate information simultaneously to several receivers and determines the families of simultaneously achievable transmission rates for many extreme classes of channels to lead to a new approach to the compound channels problem.
Related Papers (5)