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.

0 Followers
 · 
119 Views
  • [Show abstract] [Hide abstract]
    ABSTRACT: In this paper, we propose opportunistic jammer selection in a wireless security system for increasing the secure degrees of freedom (DoF) between a transmitter and a legitimate receiver (say, Alice and Bob). There is a jammer group consisting of $S$ jammers among which Bob selects $K$ jammers. The selected jammers transmit independent and identically distributed Gaussian signals to hinder the eavesdropper (Eve). Since the channels of Bob and Eve are independent, we can select the jammers whose jamming channels are aligned at Bob, but not at Eve. As a result, Eve cannot obtain any DoF unless it has more than $KN_{j}$ receive antennas, where $N_{j}$ is the number of each jammer's transmit antenna, and hence $KN_{j}$ can be regarded as defensible dimensions against Eve. For the jamming signal alignment at Bob, we propose two opportunistic jammer selection schemes and find the scaling law of the required number of jammers for target secure DoF by a geometrical interpretation of the received signals.
    IEEE Transactions on Signal Processing 02/2014; 62(4):828-839. DOI:10.1109/TSP.2013.2293979 · 3.20 Impact Factor
  • [Show abstract] [Hide abstract]
    ABSTRACT: We study the problem of secure bidirectional relaying in the presence of an “honest but curious” relay. We consider the setting where all links between nodes are additive white Gaussian noise (AWGN) channels, and show that using nested lattice codes, it is possible to obtain strong secrecy. A randomized encoder based on probability mass functions obtained by sampling the Gaussian function is used, and we show that the mutual information between the secret messages and the vector received by the relay is arbitrarily small for large block lengths. We determine sufficient conditions for secure and reliable communication, and find achievable rates. We then extend the results to the case of secure relaying in a multi-hop network with K +1 hops.
    Information Theory Proceedings (ISIT), 2013 IEEE International Symposium on; 01/2013
  • 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

Preview

Download
2 Downloads
Available from