Related papers: Almost universal codes for fading wiretap channels
This paper considers delay-limited communication over quasi-static fading channels under a long-term power constraint. A sequence of length-$n$ delay-limited codes for a quasi-static fading channel is said to be capacity-achieving if the…
We consider lattice coding for the Gaussian wiretap channel, where the challenge is to ensure reliable communication between two authorized parties while preventing an eavesdropper from learning the transmitted messages. Recently, a measure…
This paper is concerned with the general multiple access wiretap channel and the existence of codes that accomplish reliability and strong secrecy. Information leakage to the eavesdropper is assessed by the variational distance metric,…
Recent results have shown that lattice codes can be used to construct good channel codes, source codes and physical layer network codes for Gaussian channels. On the other hand, for Gaussian channels with secrecy constraints, efforts to…
In this paper, the probability of Eve the Eavesdropper's correct decision is considered both in the Gaussian and Rayleigh fading wiretap channels when using lattice codes for the transmission. First, it is proved that the secrecy function…
In Part I of this two-part paper on confidential communication over wireless channels, we studied the fundamental security limits of quasi-static fading channels from the point of view of outage secrecy capacity with perfect and imperfect…
Wyner's wiretap channel is extended to parallel broadcast channels and fading channels with multiple receivers. In the first part of the paper, we consider the setup of parallel broadcast channels with one sender, multiple intended…
Reliable communication imposes an upper limit on the achievable rate, namely the Shannon capacity. Wyner's wiretap coding, which ensures a security constraint also, in addition to reliability, results in decrease of the achievable rate. To…
The broadcast channel with confidential messages is a well studied scenario from the theoretical standpoint, but there is still lack of practical schemes able to achieve some fixed level of reliability and security over such a channel. In…
We put forth new models for universal channel coding. Unlike standard codes which are designed for a specific type of channel, our most general universal code makes communication resilient on every channel, provided the noise level is below…
The secrecy capacity problems over the general arbitrarily varying wiretap channel (AVWC), with respect to the maximal decoding error probability and strong secrecy criterion, are considered, where the channel state sequence may be known or…
In this paper, new probability bounds are derived for algebraic lattice codes. This is done by using the Dedekind zeta functions of the algebraic number fields involved in the lattice constructions. In particular, it is shown how to upper…
An alternative or supplementary approach named as physical layer security has been proposed to afford an extra security layer on top of the conventional cryptography technique. In this paper, an overview of secrecy performance…
We determine the secrecy capacities under common randomness assisted coding of arbitrarily varying classical-quantum wiretap channels.Furthermore, we determine the secrecy capacity of a mixed channel model which is compound from the sender…
Wyner's work on wiretap channels and the recent works on information theoretic security are based on random codes. Achieving information theoretical security with practical coding schemes is of definite interest. In this note, the attempt…
This paper introduces the family of lattice-like packings, which generalizes lattices, consisting of packings possessing periodicity and geometric uniformity. The subfamily of formally unimodular (lattice-like) packings is further…
We show that for a legitimate communication under multipath quasi-static fading with a reduced number of scatterers, it is possible to achieve perfect secrecy even in the presence of a passive eavesdropper for which no channel state…
Lattices possess elegant mathematical properties which have been previously used in the literature to show that structured codes can be efficient in a variety of communication scenarios, including coding for the additive white Gaussian…
In this work, we investigate the problem of secure broadcasting over block-fading wiretap channels with limited channel knowledge at the transmitter. More particularly, we analyze the effect of having a finite rate feedback on the…
We derive a lower bound on the secrecy capacity of the compound wiretap channel with channel state information at the transmitter which matches the general upper bound on the secrecy capacity of general compound wiretap channels given by…