English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

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

Joint secrecy over the K-Transmitter Multiple Access Channel