Loading...
Please wait, while we are loading the content...
Providing Secrecy with Lattice Codes (2008)
| Content Provider | CiteSeerX |
|---|---|
| Author | He, Xiang Yener, Aylin |
| Abstract | 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. I. |
| File Format | |
| Journal | Allerton Conf. on Communication, Control, and Computing |
| Language | English |
| Publisher Date | 2008-01-01 |
| Access Restriction | Open |
| Subject Keyword | Lattice Code Gaussian Channel Abstract Recent Result Source Code Lattice Encoders Decoder Multi-hop Line Network Secrecy Rate Random Code Physical Layer Network Code Secrecy Constraint Nonlinear Modulus Operation Gaussian Wiretap Channel Second Case Cooperative Jammer Gaussian Channel Example Untrusted Intermediate Relay Node Non-vanishing Positive Secrecy Rate Cooperative Jamming Good Channel Code Equivocation Rate Achievable Regardless |
| Content Type | Text |
| Resource Type | Article |
