472 research outputs found
Construction of wiretap codes from ordinary channel codes
From an arbitrary given channel code over a discrete or Gaussian memoryless
channel, we construct a wiretap code with the strong security. Our construction
can achieve the wiretap capacity under mild assumptions. The key tool is the
new privacy amplification theorem bounding the eavesdropped information in
terms of the Gallager function.Comment: 5 pages, no figure, IEEEtran.cls. Submitted to 2010 IEEE ISI
Achieving Secrecy Capacity of the Gaussian Wiretap Channel with Polar Lattices
In this work, an explicit wiretap coding scheme based on polar lattices is
proposed to achieve the secrecy capacity of the additive white Gaussian noise
(AWGN) wiretap channel. Firstly, polar lattices are used to construct
secrecy-good lattices for the mod- Gaussian wiretap channel. Then we
propose an explicit shaping scheme to remove this mod- front end and
extend polar lattices to the genuine Gaussian wiretap channel. The shaping
technique is based on the lattice Gaussian distribution, which leads to a
binary asymmetric channel at each level for the multilevel lattice codes. By
employing the asymmetric polar coding technique, we construct an AWGN-good
lattice and a secrecy-good lattice with optimal shaping simultaneously. As a
result, the encoding complexity for the sender and the decoding complexity for
the legitimate receiver are both O(N logN log(logN)). The proposed scheme is
proven to be semantically secure.Comment: Submitted to IEEE Trans. Information Theory, revised. This is the
authors' own version of the pape
Coding Schemes for Achieving Strong Secrecy at Negligible Cost
We study the problem of achieving strong secrecy over wiretap channels at
negligible cost, in the sense of maintaining the overall communication rate of
the same channel without secrecy constraints. Specifically, we propose and
analyze two source-channel coding architectures, in which secrecy is achieved
by multiplexing public and confidential messages. In both cases, our main
contribution is to show that secrecy can be achieved without compromising
communication rate and by requiring only randomness of asymptotically vanishing
rate. Our first source-channel coding architecture relies on a modified wiretap
channel code, in which randomization is performed using the output of a source
code. In contrast, our second architecture relies on a standard wiretap code
combined with a modified source code termed uniform compression code, in which
a small shared secret seed is used to enhance the uniformity of the source code
output. We carry out a detailed analysis of uniform compression codes and
characterize the optimal size of the shared seed.Comment: 15 pages, two-column, 5 figures, accepted to IEEE Transactions on
Information Theor
Universal Secure Multiplex Network Coding with Dependent and Non-Uniform Messages
We consider the random linear precoder at the source node as a secure network
coding. We prove that it is strongly secure in the sense of Harada and Yamamoto
and universal secure in the sense of Silva and Kschischang, while allowing
arbitrary small but nonzero mutual information to the eavesdropper. Our
security proof allows statistically dependent and non-uniform multiple secret
messages, while all previous constructions of weakly or strongly secure network
coding assumed independent and uniform messages, which are difficult to be
ensured in practice.Comment: 10 pages, 1 figure, IEEEtrans.cls. Online published in IEEE Trans.
Inform. Theor
- …