510 research outputs found
Semantically Secure Lattice Codes for Compound MIMO Channels
We consider compound multi-input multi-output (MIMO) wiretap channels where
minimal channel state information at the transmitter (CSIT) is assumed. Code
construction is given for the special case of isotropic mutual information,
which serves as a conservative strategy for general cases. Using the flatness
factor for MIMO channels, we propose lattice codes universally achieving the
secrecy capacity of compound MIMO wiretap channels up to a constant gap
(measured in nats) that is equal to the number of transmit antennas. The
proposed approach improves upon existing works on secrecy coding for MIMO
wiretap channels from an error probability perspective, and establishes
information theoretic security (in fact semantic security). We also give an
algebraic construction to reduce the code design complexity, as well as the
decoding complexity of the legitimate receiver. Thanks to the algebraic
structures of number fields and division algebras, our code construction for
compound MIMO wiretap channels can be reduced to that for Gaussian wiretap
channels, up to some additional gap to secrecy capacity.Comment: IEEE Trans. Information Theory, to appea
Secrecy Results for Compound Wiretap Channels
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 Liang et al. and thus establishing a full coding theorem in
this case. We achieve this with a stronger secrecy criterion and the maximum
error probability criterion, and with a decoder that is robust against the
effect of randomisation in the encoding. This relieves us from the need of
decoding the randomisation parameter which is in general not possible within
this model. Moreover we prove a lower bound on the secrecy capacity of the
compound wiretap channel without channel state information and derive a
multi-letter expression for the capacity in this communication scenario.Comment: 25 pages, 1 figure. Accepted for publication in the journal "Problems
of Information Transmission". Some of the results were presented at the ITW
2011 Paraty [arXiv:1103.0135] and published in the conference paper available
at the IEEE Xplor
Capacities of classical compound quantum wiretap and classical quantum compound wiretap channels
We determine the capacity of the classical compound quantum wiretapper
channel with channel state information at the transmitter. Moreover we derive a
lower bound on the capacity of this channel without channel state information
and determine the capacity of the classical quantum compound wiretap channel
with channel state information at the transmitter
Interference Alignment for the Multi-Antenna Compound Wiretap Channel
We study a wiretap channel model where the sender has transmit antennas
and there are two groups consisting of and receivers respectively.
Each receiver has a single antenna. We consider two scenarios. First we
consider the compound wiretap model -- group 1 constitutes the set of
legitimate receivers, all interested in a common message, whereas group 2 is
the set of eavesdroppers. We establish new lower and upper bounds on the secure
degrees of freedom. Our lower bound is based on the recently proposed
\emph{real interference alignment} scheme. The upper bound provides the first
known example which illustrates that the \emph{pairwise upper bound} used in
earlier works is not tight.
The second scenario we study is the compound private broadcast channel. Each
group is interested in a message that must be protected from the other group.
Upper and lower bounds on the degrees of freedom are developed by extending the
results on the compound wiretap channel.Comment: Minor edits. Submitted to IEEE Trans. Inf. Theor
- …