Abstract
A two-hop channel is considered, in which the source wants to send information to the destination while keeping the information confidential from the relay. A novel lattice chain and compute-and-forward based scheme is proposed in which the destination provides cooperative jamming. Channel state information is used at the source and the destination to scale the encoding lattices for the message and the jamming signal according to the channel gains. We compare the achievable secrecy rate of our scheme with an upper bound and with the achievable secrecy rate of other schemes. It follows that our scheme outperforms all existing schemes except in the low power region.
Original language | English |
---|---|
Title of host publication | 2015 IEEE Information Theory Workshop, ITW 2015 |
Place of Publication | Piscataway, NJ |
Publisher | IEEE |
Number of pages | 5 |
ISBN (Electronic) | 9781479955268 |
DOIs | |
Publication status | Published - 24 Jun 2015 |
Event | 2015 IEEE Information Theory Workshop, ITW 2015 - Jerusalem, Israel Duration: 26 Apr 2015 → 1 May 2015 |
Conference
Conference | 2015 IEEE Information Theory Workshop, ITW 2015 |
---|---|
Country/Territory | Israel |
City | Jerusalem |
Period | 26/04/15 → 1/05/15 |
Keywords
- n/a OA procedure