English
Related papers

Related papers: Lattice Code Design for the Rayleigh Fading Wireta…

200 papers

We propose the notion of secrecy gain as a code design criterion for wiretap lattice codes to be used over an additive white Gaussian noise channel. Our analysis relies on the error probabilites of both the legitimate user and the…

Information Theory · Computer Science 2010-07-09 Jean-Claude Belfiore , Frédérique Oggier

The design of lattice coset codes for wiretap channels is considered. Bounds on the eavesdropper's correct decoding probability and information leakage are first revisited. From these bounds, it is explicit that both the information leakage…

Information Theory · Computer Science 2020-07-31 Mohamed Taoufiq Damir , Alex Karrila , Laia Amorós , Oliver Gnilke , David Karpuk , Camilla Hollanti

We consider the Gaussian wiretap channel, where two legitimate players Alice and Bob communicate over an additive white Gaussian noise (AWGN) channel, while Eve is eavesdropping, also through an AWGN channel. We propose a coding strategy…

Information Theory · Computer Science 2016-11-15 Frédérique Oggier , Patrick Solé , Jean-Claude Belfiore

We consider lattice coset-coded transmissions over a wiretap channel with additive white Gaussian noise (AWGN). Examining a function that can be interpreted as either the legitimate receiver's error probability or the eavesdropper's correct…

Information Theory · Computer Science 2014-11-24 Alex Karrila , Camilla Hollanti

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…

Information Theory · Computer Science 2017-12-27 Ling Liu , Yanfei Yan , Cong Ling

The concept of well-rounded lattices has recently found important applications in the setting of a fading single-input single-output (SISO) wiretap channel. It has been shown that, under this setup, the property of being well-rounded is…

Information Theory · Computer Science 2016-09-27 Oliver W. Gnilke , Amaro Barreal , Alex Karrila , Ha Thanh Nguyen Tran , David A. Karpuk , Camilla Hollanti

For many wiretap channel models asymptotically optimal coding schemes are known, but less effort has been put into actual realizations of wiretap codes for practical parameters. Bounds on the mutual information and error probability when…

Information Theory · Computer Science 2016-11-02 Oliver Wilhelm Gnilke , Ha Thanh Nguyen Tran , Alex Karrila , Camilla Hollanti

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…

Cryptography and Security · Computer Science 2012-02-28 Anne-Maria Ernvall-Hytönen , Camilla Hollanti

We show that the correct decoding probability of an eavesdropper and error probability of a legitimate receiver in a Rayleigh fading wiretap channel with lattice coset coding are both upper bounded by the theta function in the $\ell^1$-norm…

Number Theory · Mathematics 2024-05-08 Niklas Miller

Lattice coding over a Gaussian wiretap channel, where an eavesdropper listens to transmissions between a transmitter and a legitimate receiver, is considered. A new lattice invariant called the secrecy gain is used as a code design…

Number Theory · Mathematics 2012-01-19 Fuchun Lin , Frédérique Oggier

We propose a new scheme of wiretap lattice coding that achieves semantic security and strong secrecy over the Gaussian wiretap channel. The key tool in our security proof is the flatness factor which characterizes the convergence of the…

Information Theory · Computer Science 2016-11-18 Cong Ling , Laura Luzzi , Jean-Claude Belfiore , Damien Stehlé

Polar lattices, which are constructed from polar codes, are provably good for the additive white Gaussian noise (AWGN) channel. In this work, we propose a new polar lattice construction that achieves the secrecy capacity under the strong…

Information Theory · Computer Science 2014-01-27 Yanfei Yan , Ling Liu , Cong Ling

In this article, the design of secure lattice coset codes for general wireless channels with fading and Gaussian noise is studied. Recalling the eavesdropper's probability and information bounds, a variant of the latter is given from which…

Information Theory · Computer Science 2016-08-02 Amaro Barreal , Alex Karrila , David Karpuk , Camilla Hollanti

Recent results have shown that lattice codes can be used to construct good channel codes, source codes and physical layer network codes for Gaussian channels. On the other hand, for Gaussian channels with secrecy constraints, efforts to…

Information Theory · Computer Science 2009-05-19 Xiang He , Aylin Yener

The paper studies a class of three user Gaussian interference channels. A new layered lattice coding scheme is introduced as a transmission strategy. The use of lattice codes allows for an "alignment" of the interference observed at each…

Information Theory · Computer Science 2008-09-26 Sriram Sridharan , Amin Jafarian , Sriram Vishwanath , Syed A. Jafar , Shlomo Shamai

Lattices possess elegant mathematical properties which have been previously used in the literature to show that structured codes can be efficient in a variety of communication scenarios, including coding for the additive white Gaussian…

Information Theory · Computer Science 2017-12-19 Lakshmi Natarajan , Yi Hong , Emanuele Viterbo

We consider a fading wiretap channel model where the transmitter has only statistical channel state information, and the legitimate receiver and eavesdropper have perfect channel state information. We propose a sequence of non-random…

Information Theory · Computer Science 2016-11-18 Laura Luzzi , Cong Ling , Roope Vehkalahti

A recent line of work on lattice codes for Gaussian wiretap channels introduced a new lattice invariant called secrecy gain as a code design criterion which captures the confusion that lattice coding produces at an eavesdropper. Following…

Number Theory · Mathematics 2013-04-17 Fuchun Lin , Frédérique Oggier , Patrick Solé

Lattice codes are known to achieve capacity in the Gaussian point-to-point channel, achieving the same rates as independent, identically distributed (i.i.d.) random Gaussian codebooks. Lattice codes are also known to outperform random codes…

Information Theory · Computer Science 2012-10-23 Yiwei Song , Natasha Devroye

Despite several works on secrecy coding for fading and MIMO wiretap channels from an error probability perspective, the construction of information-theoretically secure codes over such channels remains an open problem. In this paper, we…

Information Theory · Computer Science 2018-06-27 Laura Luzzi , Roope Vehkalahti , Cong Ling
‹ Prev 1 2 3 10 Next ›