Secure signaling games for Gaussian multiple access wiretap channels

A Gaussian multiple access wire-tap channel with confidential messages is studied, where multiple users attempt to transmit private messages to a legitimate receiver in the presence of an eavesdropper. While prior work focused on the case where the users were cooperative, we assume that each user is selfish and and so are modeled as playing a non-cooperative game. We assume all users send a superposition of two Gaussian codebooks: one for their confidential messages and one for 'filling' the evesdropper's channel. For such a scheme, we give a characterization of the achievable rate region defined by Tekin and Yener using polymatroid properties. We then use this to find the Nash equilibrium region for this non-cooperative game. Furthermore, we give algorithms for finding the best and worst Nash equilibria for a given channel.