Computer Science – Information Theory
Scientific paper
2009-10-14
Computer Science
Information Theory
Presented at the Forty-Seventh Annual Allerton Conference on Communication, Control, and Computing, 2009
Scientific paper
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 Renyi 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 Renyi 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.
He Xiang
Yener Aylin
No associations
LandOfFree
Interference Channels with Strong Secrecy does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Interference Channels with Strong Secrecy, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Interference Channels with Strong Secrecy will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-18500