English
Related papers

Related papers: Almost universal codes for MIMO wiretap channels

200 papers

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

We consider compound multi-input multi-output (MIMO) wiretap channels where minimal channel state information at the transmitter (CSIT) is assumed. Code construction is given for the special case of isotropic mutual information, which…

Information Theory · Computer Science 2019-10-09 Antonio Campello , Cong Ling , Jean-Claude Belfiore

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

We consider MIMO (Multiple Input Multiple Output) wiretap channels, where a legitimate transmitter Alice is communicating with a legitimate receiver Bob in the presence of an eavesdropper Eve, and communication is done via MIMO channels. We…

Information Theory · Computer Science 2013-01-10 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

This work addresses the question of achieving capacity with lattice codes in multi-antenna block fading channels when the number of fading blocks tends to infinity. A design criterion based on the normalized minimum determinant is proposed…

Information Theory · Computer Science 2015-07-28 Laura Luzzi , Roope Vehkalahti

We consider wiretap channels with uncertainty on the eavesdropper channel under (i) noisy blockwise type II, (ii) compound, or (iii) arbitrarily varying models. We present explicit wiretap codes that can handle these models in a unified…

Information Theory · Computer Science 2022-11-03 Remi A. Chou

In this work, a class of information theoretic secrecy problems is addressed where the eavesdropper channel states are completely unknown to the legitimate parties. In particular, MIMO wiretap channel models are considered where the channel…

Information Theory · Computer Science 2010-07-28 Xiang He , Aylin Yener

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

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 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é

The wiretap channel is a well-studied problem in the physical layer security literature. Although it is proven that the decoding error probability and information leakage can be made arbitrarily small in the asymptotic regime, further…

Information Theory · Computer Science 2025-03-19 Daniel Seifert , Onur Günlü , Rafael F. Schaefer

Suppose Alice wishes to send messages to Bob through a communication channel C_1, but her transmissions also reach an eavesdropper Eve through another channel C_2. The goal is to design a coding scheme that makes it possible for Alice to…

Information Theory · Computer Science 2011-10-05 Hessam Mahdavifar , Alexander Vardy

Suppose Alice wishes to send messages to Bob through a communication channel C_1, but her transmissions also reach an eavesdropper Eve through another channel C_2. The goal is to design a coding scheme that makes it possible for Alice to…

Information Theory · Computer Science 2015-03-13 Hessam Mahdavifar , Alexander Vardy

The capacity of the Gaussian wiretap channel model is analyzed when there are multiple antennas at the sender, intended receiver and eavesdropper. The associated channel matrices are fixed and known to all the terminals. A computable…

Information Theory · Computer Science 2016-11-15 Ashish Khisti , Gregory Wornell

Achieving security against adversaries with unlimited computational power is of great interest in a communication scenario. Since polar codes are capacity achieving codes with low encoding-decoding complexity and they can approach perfect…

Information Theory · Computer Science 2018-01-23 Amirsina Torfi , Sobhan Soleymani , Siamak Aram , Vahid Tabataba Vakili

We propose a coding scheme that achieves the capacity of the compound MIMO channel with algebraic lattices. Our lattice construction exploits the multiplicative structure of number fields and their group of units to absorb ill-conditioned…

Information Theory · Computer Science 2017-01-11 Antonio Campello , Cong Ling , Jean-Claude Belfiore

This paper addresses point-to-point communication over block-fading channels with independent fading blocks. When both channel state information at the transmitter (CSIT) and receiver (CSIR) are available, most achievable schemes use…

Information Theory · Computer Science 2018-08-28 Ahmed Hindy , Aria Nosratinia

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

An alternative or supplementary approach named as physical layer security has been proposed to afford an extra security layer on top of the conventional cryptography technique. In this paper, an overview of secrecy performance…

Information Theory · Computer Science 2020-12-15 Long Kong , Yun Ai , Lei Lei , Georges Kaddoum , Symeon Chatzinotas , Björn Ottersten
‹ Prev 1 2 3 10 Next ›