On the eavesdropper's correct decision in Gaussian and fading wiretap channels using lattice codes

Type: Article

Publication Date: 2011-10-01

Citations: 10

DOI: https://doi.org/10.1109/itw.2011.6089380

Download PDF

Abstract

In this paper, the probability of Eve the Eavesdropper's correct decision is considered both in the Gaussian and Rayleigh fading wiretap channels when using lattice codes for the transmission. First, it is proved that the secrecy function determining Eve's performance attains its maximum at y = 1 on all known extremal even unimodular lattices. This is a special case of a conjecture by Belfiore and Solé. Further, a very simple method to verify or disprove the conjecture on any given unimodular lattice is given. Second, preliminary analysis on the behavior of Eve's probability of correct decision in the fast fading wiretap channel is provided. More specifically, we compute the truncated inverse norm power sum factors in Eve's probability expression. The analysis reveals a performance-secrecy-complexity tradeoff: relaxing on the legitimate user's performance can significantly increase the security of transmission. The confusion experienced by the eavesdropper may be further increased by using skewed lattices, but at the cost of increased complexity.

Locations

  • arXiv (Cornell University) - View - PDF

Similar Works

Action Title Year Authors
+ On the Eavesdropper's Correct Decision in Gaussian and Fading Wiretap Channels Using Lattice Codes 2011 Anne-Maria Ernvall-Hytönen
Camilla Hollanti
+ On the Eavesdropper's Correct Decision in Gaussian and Fading Wiretap Channels Using Lattice Codes 2011 Anne-Maria Ernvall-Hytönen
Camilla Hollanti
+ Almost universal codes for MIMO wiretap channels 2016 Laura Luzzi
Roope Vehkalahti
Cong Ling
+ PDF Chat Lattice Codes for the Wiretap Gaussian Channel: Construction and Analysis 2015 Frédérique Oggier
Patrick Solé
Jean-Claude Belfiore
+ PDF Chat Almost Universal Codes for MIMO Wiretap Channels 2018 Laura Luzzi
Roope Vehkalahti
Cong Ling
+ A Classification of Unimodular Lattice Wiretap Codes in Small Dimensions 2012 Fuchun Lin
Frédérique Oggier
+ PDF Chat A Classification of Unimodular Lattice Wiretap Codes in Small Dimensions 2013 Fuchun Lin
Frédérique Oggier
+ PDF Chat Secrecy gain: A wiretap lattice code design 2010 Jean-Claude Belfiore
Frédérique Oggier
+ PDF Chat Secrecy gain: A wiretap lattice code design 2010 Jean-Claude Belfiore
Frédérique Oggier
+ Secrecy Gain: a Wiretap Lattice Code Design 2010 Jean-Claude Belfiore
Frédérique Oggier
+ The Secrecy Gain of Formally Unimodular Lattices on the Gaussian Wiretap Channel 2021 Maiara F. Bollauf
Hsuan-Yin Lin
Øyvind Ytrehus
+ The Secrecy Gain of Formally Unimodular Lattices on the Gaussian Wiretap Channel. 2021 Maiara F. Bollauf
Hsuan-Yin Lin
Øyvind Ytrehus
+ Information Bounds and Flatness Factor Approximation for Fading Wiretap MIMO Channels 2016 Amaro Barreal
Alex Karrila
David Karpuk
Camilla Hollanti
+ Information Bounds and Flatness Factor Approximation for Fading Wiretap MIMO Channels 2016 Amaro Barreal
Alex Karrila
Asano David
Hollanti Camilla
+ PDF Chat Information bounds and flatness factor approximation for fading wiretap MIMO channels 2016 Amaro Barreal
Alex Karrila
David Karpuk
Camilla Hollanti
+ On Analytical and Geometric Lattice Design Criteria for Wiretap Coset Codes. 2016 Alex Karrila
David Karpuk
Camilla Hollanti
+ Polar Lattices for Strong Secrecy Over the Mod-$Λ$ Gaussian Wiretap Channel 2014 Yanfei Yan
Линг Лиу
Cong Ling
+ PDF Chat Lattice Codes for the Gaussian Wiretap Channel 2011 Jean-Claude Belfiore
Frédérique Oggier
Patrick Solé
+ PDF Chat An Error Probability Approach to MIMO Wiretap Channels 2013 J.-C. Belfiore
Frédérique Oggier
+ PDF Chat Semantically Secure Lattice Codes for the Gaussian Wiretap Channel 2014 Cong Ling
Laura Luzzi
Jean-Claude Belfiore
Damien Stehlé