215 research outputs found
Quantifying Equivocation for Finite Blocklength Wiretap Codes
This paper presents a new technique for providing the analysis and comparison
of wiretap codes in the small blocklength regime over the binary erasure
wiretap channel. A major result is the development of Monte Carlo strategies
for quantifying a code's equivocation, which mirrors techniques used to analyze
normal error correcting codes. For this paper, we limit our analysis to
coset-based wiretap codes, and make several comparisons of different code
families at small and medium blocklengths. Our results indicate that there are
security advantages to using specific codes when using small to medium
blocklengths.Comment: Submitted to ICC 201
Strong Secrecy for Multiple Access Channels
We show strongly secret achievable rate regions for two different wiretap
multiple-access channel coding problems. In the first problem, each encoder has
a private message and both together have a common message to transmit. The
encoders have entropy-limited access to common randomness. If no common
randomness is available, then the achievable region derived here does not allow
for the secret transmission of a common message. The second coding problem
assumes that the encoders do not have a common message nor access to common
randomness. However, they may have a conferencing link over which they may
iteratively exchange rate-limited information. This can be used to form a
common message and common randomness to reduce the second coding problem to the
first one. We give the example of a channel where the achievable region equals
zero without conferencing or common randomness and where conferencing
establishes the possibility of secret message transmission. Both coding
problems describe practically relevant networks which need to be secured
against eavesdropping attacks.Comment: 55 page
Strong Secrecy on a Class of Degraded Broadcast Channels Using Polar Codes
Different polar coding schemes are proposed for the memoryless degraded
broadcast channel under different reliability and secrecy requirements: layered
decoding and/or layered secrecy. In this setting, the transmitter wishes to
send multiple messages to a set of legitimate receivers keeping them masked
from a set of eavesdroppers. The layered decoding structure requires receivers
with better channel quality to reliably decode more messages, while the layered
secrecy structure requires eavesdroppers with worse channel quality to be kept
ignorant of more messages. The implementation of the proposed polar coding
schemes is discussed and their performance is evaluated by simulations for the
symmetric degraded broadcast channel.Comment: 35 pages. Published in "MDPI Entropy". A short version of this paper
had been accepted to the 3rd Workshop on Physical-Layer Methods for Wireless
Security, IEEE CNS 201
Fundamental Limits of Communication with Low Probability of Detection
This paper considers the problem of communication over a discrete memoryless
channel (DMC) or an additive white Gaussian noise (AWGN) channel subject to the
constraint that the probability that an adversary who observes the channel
outputs can detect the communication is low. Specifically, the relative entropy
between the output distributions when a codeword is transmitted and when no
input is provided to the channel must be sufficiently small. For a DMC whose
output distribution induced by the "off" input symbol is not a mixture of the
output distributions induced by other input symbols, it is shown that the
maximum amount of information that can be transmitted under this criterion
scales like the square root of the blocklength. The same is true for the AWGN
channel. Exact expressions for the scaling constant are also derived.Comment: Version to appear in IEEE Transactions on Information Theory; minor
typos in v2 corrected. Part of this work was presented at ISIT 2015 in Hong
Kon
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
- …