Abstract:
This paper considers a Gaussian multiple access channel aided by a relay. Specifically, the relay facilitates communication between multiple sources and a destination to ...Show MoreMetadata
Abstract:
This paper considers a Gaussian multiple access channel aided by a relay. Specifically, the relay facilitates communication between multiple sources and a destination to which the sources have no direct link. In this set up, the relay node is considered to be untrusted, i.e., honest but curious, from whom the source messages need to be kept secret. We identify an achievable secrecy rate region utilizing cooperative jamming from the destination, and using compress-and-forward at the relay. Additionally, an outer bound on the secrecy rate region is derived. Numerical results indicate that the outer bound is tight in some cases of interest.
Published in: 2014 IEEE Information Theory Workshop (ITW 2014)
Date of Conference: 02-05 November 2014
Date Added to IEEE Xplore: 04 December 2014
Electronic ISBN:978-1-4799-5999-0
Print ISSN: 1662-9019