Pairwise key agreement over a generalized multiple access channel: Capacity bounds and game-theoretic analysis
2013 (English)In: Proceedings of the Tenth International Symposium on Wireless Communication Systems (ISWCS 2013), IEEE Computer Society, 2013, 219-223 p.Conference paper (Refereed)
A pairwise key agreement between three users is considered in which each pair of the users wishes to agree on a secret key hidden from the remaining user. The three users communicate through a noisy channel where two users transmit the channel inputs and all the three users receive noisy outputs from the channel. In this setup, inner and outer bounds of the secret key capacity region are derived as well as a special case where the two bounds match. Furthermore, an achievable secret key rate region is derived for AWGN channels. In this Gaussian setup, we investigate the interaction between the two transmitting users from a game-theoretic perspective and we analyze the Nash equilibrium of the non-cooperative game considering two strategies for the transmitting users: power control and cooperative jamming. Finally we illustrate our results through numerical simulations.
Place, publisher, year, edition, pages
IEEE Computer Society, 2013. 219-223 p.
, Proceedings of the International Symposium on Wireless Communication Systems, ISSN 2154-0217
Communication channels (information theory), Communication systems, Capacity bound, Channel inputs, Cooperative jamming, Game-theoretic perspectives, Multiple access channels, Nash equilibria, Noncooperative game, Secret key capacities, Game theory
IdentifiersURN: urn:nbn:se:kth:diva-150982ScopusID: 2-s2.0-84903199052ISBN: 978-380073529-7OAI: oai:DiVA.org:kth-150982DiVA: diva2:746401
10th IEEE International Symposium on Wireless Communication Systems 2013, ISWCS 2013, 27 August 2013 through 30 August 2013, Ilmenau, Germany
QC 201409122014-09-122014-09-122014-09-12Bibliographically approved