A First Course in Information Theory (Information Technology: Transmission, Processing and Storage)
A First Course in Information Theory (Information Technology: Transmission, Processing and Storage)
MIMO Gaussian broadcast channels with confidential messages
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 4
The Gaussian many-to-one interference channel with confidential messages
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 3
Secure communication with a Byzantine relay
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 3
GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
Generalized privacy amplification
IEEE Transactions on Information Theory - Part 2
Achieving 1/2 log (1+SNR) on the AWGN channel with lattice encoding and decoding
IEEE Transactions on Information Theory
Capacity With Causal and Noncausal Side Information: A Unified View
IEEE Transactions on Information Theory
IEEE Transactions on Information Theory
IEEE Transactions on Information Theory
Hi-index | 0.00 |
It is known that given the real sum of two independent uniformly distributed lattice points from the same nested lattice codebook, the eavesdropper can obtain at most 1 bit of information per channel regarding the value of one of the lattice points. In this work, we study the effect of this 1 bit information on the equivocation expressed in three commonly used information theoretic measures, i.e., the Shannon entropy, the Rényi entropy and the min entropy. We then demonstrate its applications in an interference channel with a confidential message. In our previous work, we showed that nested lattice codes can outperform Gaussian codes for this channel when the achieved rate is measured with the weak secrecy notion. Here, with the Rényi entropy and the min entropy measure, we prove that the same secure degree of freedom is achievable with the strong secrecy notion as well. A major benefit of the new coding scheme is that the strong secrecy is generated from a single lattice point instead of a sequence of lattice points. Hence the mutual information between the confidential message and the observation of the eavesdropper decreases much faster with the number of channel uses than previously known strong secrecy coding methods for nested lattice codes.