Compute-and-forward can buy secrecy cheap
2015 (English)In: IEEE International Symposium on Information Theory - Proceedings, Institute of Electrical and Electronics Engineers (IEEE), 2015, 2475-2479 p.Conference paper (Refereed)
We consider a Gaussian multiple access channel with K transmitters, a (intended) receiver and an external eavesdropper. The transmitters wish to reliably communicate with the receiver while concealing their messages from the eavesdropper. This scenario has been investigated in prior works using two different coding techniques; the random i.i.d. Gaussian coding and the signal alignment coding. Although, the latter offers promising results in a very high SNR regime, extending these results to the finite SNR regime is a challenging task. In this paper, we propose a new lattice alignment scheme based on the compute-and-forward framework which works at any finite SNR. We show that our achievable secure sum rate scales with log(SNR) and hence, in most SNR regimes, our scheme outperforms the random coding scheme in which the secure sum rate does not grow with power. Furthermore, we show that our result matches the prior work in the infinite SNR regime. Additionally, we analyze our result numerically.
Place, publisher, year, edition, pages
Institute of Electrical and Electronics Engineers (IEEE), 2015. 2475-2479 p.
Codes (symbols), Communication channels (information theory), Information theory, Transmitters, Coding techniques, Compute and forwards, Finite-snr, Gaussian multiple-access channels, Gaussians, High SNR, Random coding, Sum-rate, Signal to noise ratio
Electrical Engineering, Electronic Engineering, Information Engineering
IdentifiersURN: urn:nbn:se:kth:diva-196167DOI: 10.1109/ISIT.2015.7282901ISI: 000380904702106ScopusID: 2-s2.0-84969793708ISBN: 9781467377041OAI: oai:DiVA.org:kth-196167DiVA: diva2:1046803
IEEE International Symposium on Information Theory, ISIT 2015, 14 June 2015 through 19 June 2015
QC 201611152016-11-152016-11-142016-11-29Bibliographically approved