“School of Mathematics”
Back to Papers HomeBack to Papers of School of Mathematics
| Paper IPM / M / 16734 |
|
||||
| Abstract: | |||||
|
In this paper, we present a one-way relaying scheme in which two wireless nodes create an information flow to each other via a single decode-and-forward (DF) relay. We consider an additional secrecy constraint for protection against an honest but-curious relay. Indeed, while the relay should decode the source message, it should be fully ignorant about the message content. We provide a secure lattice coding strategy based on random difference families (RDF) lattice codes for unidirectional Gaussian relay channels. RDF lattice codes are carved from infinite RDF lattices using a shaping algorithm. Due to the existence of low-overhead encoding and decoding algorithms, these lattice codes can be implemented practically in high dimensions. Our proposed scheme combines a new Rao-Nam like encryption with a new DF relaying scheme for RDF lattice codes. Security analysis of the scheme against chosen-plaintext attacks like differential attack and other recent attacks on the Rao-Nam-like schemes are provided. We show that the proposed scheme resists against all variants of differential cryptanalysis. To the best of our knowledge, the proposed scheme is the first in its type and according to our simulation results, it improves the error performance, efficiency and security at the same time, compared to its counterparts.
Download TeX format |
|||||
| back to top | |||||
