English
Related papers

Related papers: On the Secrecy Gain of Formally Unimodular Constru…

200 papers

Recently, a design criterion depending on a lattice's volume and theta series, called the secrecy gain, was proposed to quantify the secrecy-goodness of the applied lattice code for the Gaussian wiretap channel. To address the secrecy gain…

Information Theory · Computer Science 2024-02-14 Maiara F. Bollauf , Hsuan-Yin Lin , Øyvind Ytrehus

We consider lattice coding for the Gaussian wiretap channel, where the challenge is to ensure reliable communication between two authorized parties while preventing an eavesdropper from learning the transmitted messages. Recently, a measure…

Information Theory · Computer Science 2021-11-03 Maiara F. Bollauf , Hsuan-Yin Lin , Øyvind Ytrehus

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

This paper introduces the family of lattice-like packings, which generalizes lattices, consisting of packings possessing periodicity and geometric uniformity. The subfamily of formally unimodular (lattice-like) packings is further…

Information Theory · Computer Science 2023-09-29 Maiara F. Bollauf , Hsuan-Yin Lin , Øyvind Ytrehus

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

In a recent paper, the authors introduced a lattice invariant called "Secrecy Gain" which measures the confusion experienced by a passive eavesdropper on the Gaussian Wiretap Channel. We study, here, the behavior of this invariant for…

Information Theory · Computer Science 2010-07-06 Jean-Claude Belfiore , Patrick Sole

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é

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

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

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

We show that on an $n=24m+8k$-dimensional even unimodular lattice, if the shortest vector length is $\geq 2m$, then as the number of vectors of length $2m$ decreases, the secrecy gain increases. We will also prove a similar result on…

Cryptography and Security · Computer Science 2012-09-18 Anne-Maria Ernvall-Hytönen

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

We consider a variation of Construction A of lattices from linear codes based on two classes of number fields, totally real and CM Galois number fields. We propose a generic construction with explicit generator and Gram matrices, then focus…

Information Theory · Computer Science 2016-04-07 Xiaolu Hou , Frédérique Oggier

Recent results have shown that structured codes can be used to construct good channel codes, source codes and physical layer network codes for Gaussian channels. For Gaussian channels with secrecy constraints, however, efforts to date rely…

Information Theory · Computer Science 2009-07-31 Xiang He , Aylin Yener

In this work we study the reliability and secrecy performance achievable by practical LDPC codes over the Gaussian wiretap channel. While several works have already addressed this problem in asymptotic conditions, i.e., under the hypothesis…

Information Theory · Computer Science 2016-11-18 Marco Baldi , Giacomo Ricciutelli , Nicola Maturo , Franco Chiaraluce

From an arbitrary given channel code over a discrete or Gaussian memoryless channel, we construct a wiretap code with the strong security. Our construction can achieve the wiretap capacity under mild assumptions. The key tool is the new…

Information Theory · Computer Science 2010-10-06 Masahito Hayashi , Ryutaroh Matsumoto

This paper shows that structured transmission schemes are a good choice for secret communication over interference networks with an eavesdropper. Structured transmission is shown to exploit channel asymmetries and thus perform better than…

Information Theory · Computer Science 2009-05-14 Shweta Agrawal , Sriram Vishwanath

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
‹ Prev 1 2 3 10 Next ›