Conference Paper

Providing secrecy with lattice codes

Electr. Eng. Dept., Pennsylvania State Univ., University Park, PA
DOI: 10.1109/ALLERTON.2008.4797696 Conference: Communication, Control, and Computing, 2008 46th Annual Allerton Conference on
Source: IEEE Xplore

ABSTRACT 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 date rely on random codes. In this work, we provide a tool to bridge these two areas so that the secrecy rate can be computed when lattice codes are used. In particular, we address the problem of bounding equivocation rates under nonlinear modulus operation that is present in lattice encoders/decoders. The technique is then demonstrated in two Gaussian channel examples: (1) a Gaussian wiretap channel with a cooperative jammer, and (2) a multi-hop line network from a source to a destination with untrusted intermediate relay nodes from whom the information needs to be kept secret. In both cases, lattice codes are used to facilitate cooperative jamming. In the second case, interestingly, we demonstrate that a non-vanishing positive secrecy rate is achievable regardless of the number of hops.

  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: We prove that nested lattice codes can achieve semantic security and strong secrecy over the Gaussian wiretap channel. The key tool in our proof is the flatness factor which characterizes the convergence of the conditional output distributions corresponding to different messages and leads to an upper bound on the information leakage. We not only show the existence of lattice codes that are good for secrecy, but also propose the {flatness factor} as a new design criterion. Both the modulo-lattice Gaussian channel and the genuine Gaussian channel are considered. In the latter case, we propose a new secrecy coding scheme based on the discrete Gaussian distribution over a lattice, which achieves the secrecy capacity to within a half nat under mild conditions. No \textit{a priori} distribution of the message is assumed, and no dither is used in our proposed schemes.
    IEEE Transactions on Information Theory 10/2012; 60(10). DOI:10.1109/TIT.2014.2343226 · 2.65 Impact Factor
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: Bidirectional relaying, where a relay helps two user nodes to exchange messages has been an active area of recent research. In the compute-and-forward strategy for bidirectional relaying, the relay computes a function of the two messages using the naturally-occurring sum of symbols simultaneously transmitted by user nodes in a Gaussian Multiple Access Channel (MAC), and the computed function value is forwarded to the user nodes in an ensuing broadcast phase. In this work, we consider the Gaussian MAC in bidirectional relaying with the messages taking values in a finite Abelian group and the relay computing the sum within the group under an additional secrecy constraint for protection against a honest but curious relay. The secrecy constraint is that, while the relay should decode the group sum, the individual message of each user should be perfectly secure from the relay. We exploit the symbol addition that occurs in a Gaussian MAC to design explicit modulations at the user nodes that achieve independence between the received symbols at the relay and each of the two individual transmitted messages under an average transmit power constraint. We provide a lattice coding strategy for reliable computation of the group sum at the relay with perfect secrecy, and study rate versus average power trade-offs in the large-dimension regime. Our results for secure compute-and-forward are significant because we achieve perfect security with finite average transmit power, and this has been done using a novel approach involving Fourier-analytic tools.
    IEEE Transactions on Information Theory 06/2012; 61(5). DOI:10.1109/TIT.2015.2412114 · 2.65 Impact Factor
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: This paper uses a nested lattice chain to perform lattice coding and decoding for a Gaussian wiretap channel, in which we derive the achievable rates and the equivocation rate. We also show that it is possible to achieve the equivocation rate of the classical Gaussian wiretap channel, and meet the reliability and security criteria using the nested lattice construction.
    Communications Workshops (ICC), 2011 IEEE International Conference on; 07/2011


Available from