Joint secrecy over the K-transmitter multiple access channel

Yanling Chen, O. Ozan Koyluoglu, A. J.Han Vinck

Research output: Chapter in Book/Report/Conference proceedingConference contribution

3 Scopus citations


This paper studies the problem of secure communication over a K-transmitter multiple access channel in the presence of an external eavesdropper, subject to a joint secrecy constraint (i.e., information leakage rate from the collection of K messages to an eavesdropper is made vanishing). As a result, we establish the joint secrecy achievable rate region. To this end, our results build upon two techniques in addition to the standard information-theoretic methods. The first is a generalization of Chia-El Gamal's lemma on entropy bound for a set of codewords given partial information. The second is to utilize a compact representation of a list of sets that, together with properties of mutual information, leads to an efficient Fourier-Motzkin elimination. These two approaches could also be of independent interests in other contexts.

Original languageEnglish (US)
Title of host publication2017 IEEE Information Theory Workshop, ITW 2017
PublisherInstitute of Electrical and Electronics Engineers Inc.
Number of pages5
ISBN (Electronic)9781509030972
StatePublished - Jul 2 2017
Event2017 IEEE Information Theory Workshop, ITW 2017 - Kaohsiung, Taiwan, Province of China
Duration: Nov 6 2017Nov 10 2017

Publication series

NameIEEE International Symposium on Information Theory - Proceedings
ISSN (Print)2157-8095


Other2017 IEEE Information Theory Workshop, ITW 2017
Country/TerritoryTaiwan, Province of China

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Information Systems
  • Modeling and Simulation
  • Applied Mathematics


Dive into the research topics of 'Joint secrecy over the K-transmitter multiple access channel'. Together they form a unique fingerprint.

Cite this