217 research outputs found
Exact Random Coding Secrecy Exponents for the Wiretap Channel
We analyze the exact exponential decay rate of the expected amount of
information leaked to the wiretapper in Wyner's wiretap channel setting using
wiretap channel codes constructed from both i.i.d. and constant-composition
random codes. Our analysis for those sampled from i.i.d. random coding ensemble
shows that the previously-known achievable secrecy exponent using this ensemble
is indeed the exact exponent for an average code in the ensemble. Furthermore,
our analysis on wiretap channel codes constructed from the ensemble of
constant-composition random codes leads to an exponent which, in addition to
being the exact exponent for an average code, is larger than the achievable
secrecy exponent that has been established so far in the literature for this
ensemble (which in turn was known to be smaller than that achievable by wiretap
channel codes sampled from i.i.d. random coding ensemble). We show examples
where the exact secrecy exponent for the wiretap channel codes constructed from
random constant-composition codes is larger than that of those constructed from
i.i.d. random codes and examples where the exact secrecy exponent for the
wiretap channel codes constructed from i.i.d. random codes is larger than that
of those constructed from constant-composition random codes. We, hence,
conclude that, unlike the error correction problem, there is no general
ordering between the two random coding ensembles in terms of their secrecy
exponent.Comment: 23 pages, 5 figures, submitted to IEEE Transactions on Information
Theor
MAC Resolvability: First And Second Order Results
Building upon previous work on the relation between secrecy and channel
resolvability, we revisit a secrecy proof for the multiple-access channel from
the perspective of resolvability. We then refine the approach in order to
obtain some novel results on the second-order achievable rates.Comment: Slightly extended version of the paper accepted at the 4th Workshop
on Physical-Layer Methods for Wireless Security during IEEE CNS 2017. v2:
Fixed typos and extended literature section in accordance with reviewers'
recommendation
Resolvability on Continuous Alphabets
We characterize the resolvability region for a large class of point-to-point
channels with continuous alphabets. In our direct result, we prove not only the
existence of good resolvability codebooks, but adapt an approach based on the
Chernoff-Hoeffding bound to the continuous case showing that the probability of
drawing an unsuitable codebook is doubly exponentially small. For the converse
part, we show that our previous elementary result carries over to the
continuous case easily under some mild continuity assumption.Comment: v2: Corrected inaccuracies in proof of direct part. Statement of
Theorem 3 slightly adapted; other results unchanged v3: Extended version of
camera ready version submitted to ISIT 201
A Stronger Soft-Covering Lemma and Applications
Wyner's soft-covering lemma is a valuable tool for achievability proofs of
information theoretic security, resolvability, channel synthesis, and source
coding. The result herein sharpens the claim of soft-covering by moving away
from an expected value analysis. Instead, a random codebook is shown to achieve
the soft-covering phenomenon with high probability. The probability of failure
is doubly-exponentially small in the block-length, enabling more powerful
applications through the union bound.Comment: IEEE CNS 2015, 2nd Workshop on Physical-layer Methods for Wireless
Security, 4 page
Strongly Secure Communications Over the Two-Way Wiretap Channel
We consider the problem of secure communications over the two-way wiretap
channel under a strong secrecy criterion. We improve existing results by
developing an achievable region based on strategies that exploit both the
interference at the eavesdropper's terminal and cooperation between legitimate
users. We leverage the notion of channel resolvability for the multiple-access
channel to analyze cooperative jamming and we show that the artificial noise
created by cooperative jamming induces a source of common randomness that can
be used for secret-key agreement. We illustrate the gain provided by this
coding technique in the case of the Gaussian two-way wiretap channel, and we
show significant improvements for some channel configurations.Comment: 11 pages, 7 figures, submitted to IEEE Transactions on Information
Forensics and Security, Special Issue: "Using the Physical Layer for Securing
the Next Generation of Communication Systems
- …