Secrecy Capacity Regions for Multiuser Communication Channels

This direction is merged into another direction: stochastic encoding. Its last version stays readable and citable here.

Version 1 of 117 papers20 conceptsfrozen 2026-10-04

In traditional cryptography, security relies on the computational difficulty of mathematical problems. Information-theoretic security, however, asks a more fundamental question: can we design communication systems where an eavesdropper gains zero information, regardless of their computing power?

The goal is to identify the secrecy capacity region—the set of all possible transmission rates for multiple users that can be achieved with perfect security. Across various network topologies, researchers are working to bridge the gap between what we know is possible (inner bounds) and what we know is theoretically impossible (outer bounds).

The Geometry of Secure Communication

To understand this research, imagine a multi-dimensional space where each axis represents the transmission rate of a different user. A "rate region" is a volume in this space. If a point is inside the region, those speeds are achievable; if it is outside, the laws of physics and information theory forbid it.

In a simple broadcast channel, a single transmitter sends messages to multiple legitimate receivers while an eavesdropper listens in. Yan Zhu and colleagues in Research on the Secrecy Achievable Rate Region for the Broadcast channel with eavesdropper define the "inner bound" of this region using techniques like rate splitting and Gelfand-Pinsker coding. These methods allow the transmitter to "pre-code" signals so they align perfectly for the intended receiver while appearing as useless noise to the eavesdropper.

Cooperation as a Shield

One of the most powerful tools for expanding the secrecy region is encoder cooperation. In a Multiple Access Channel (MAC), where multiple transmitters send data to one receiver, the transmitters can act as "helpers" for one another.

Abdellatif Zaidi, Zohaib Hassan Awan, and Luc Vandendorpe demonstrate in Multiaccess Channel with Partially Cooperating Encoders and Security Constraints that even a limited-capacity link between transmitters can drastically increase security. This cooperation allows for two distinct strategies:

  1. Relaying: One transmitter helps forward the other's secret message.
  2. Artificial Noise: One transmitter injects "jamming" signals that specifically target the eavesdropper's reception without interfering with the legitimate receiver.

Similarly, the paper Strong Secrecy for Multiple Access Channels shows that "conferencing" between encoders allows them to generate common randomness. This shared randomness acts as a foundation for strong secrecy, a rigorous standard where the total amount of leaked information (not just the rate of leakage) is kept near zero.

Leveraging Environmental Randomness

Security doesn't always have to be "built-in" via keys; it can be extracted from the environment. In On Strong Secrecy for Multiple Access Channels with States and Causal CSI, Tobias J. Oechtering and Mikael Skoglund explore channels where the state (e.g., signal interference or weather) changes dynamically.

By using Causal Channel State Information (CSI), transmitters can treat the fluctuating state of the channel as a source of secret keys. If the legitimate parties know the channel state but the eavesdropper does not, that physical advantage can be converted directly into a higher secure transmission rate.

The Problem of the Persistent Gap

The central challenge across this field is that our "inner bounds" (what we can prove is achievable) and "outer bounds" (the absolute limits) rarely meet.

In Secure and Private Distributed Source Coding with Private Keys and Decoder Side Information, Onur Günlü and Rafael F. Schaefer highlight this gap in the context of sensor networks. When sensors must compress data while protecting both the raw readings (secrecy) and the underlying source (privacy), the mathematical complexity of the multi-terminal interaction makes it difficult to find the "exact" capacity.

To simplify these proofs, Amin Gohari and colleagues in Secure channel simulation utilize the Output Statistics of Random Binning (OSRB) framework. OSRB provides a unified way to analyze how "bins" of data can be randomized to hide information from an eavesdropper. However, even with these advanced tools, the field remains focused on a singular unresolved question: how do we prove that a specific secure rate is not just achievable, but the absolute maximum possible? Until the inner and outer bounds coincide, the true secrecy capacity of the multiuser channel remains an open frontier.

Papers in this version

History & citationVersion 1 · 2026-10-04

Merged into another direction · Permanent link

View frozen version 1

Cite this direction

Latest version (a living page):

@misc{lacuna_secrecy_capacity_regions_for_multiuser_c_47a4deb7,
  title = {Secrecy Capacity Regions for Multiuser Communication Channels},
  author = {{Lacuna}},
  howpublished = {Lacuna research direction},
  year = {2026},
  url = {https://lacuna.tiptreesystems.com/direction/secrecy-capacity-regions-for-multiuser-communication-channels/rdr_47a4deb74b78402cb9a4f335c0e12682},
  note = {Latest version of a living research direction; cite a version for a fixed text. Accessed 2026-11-20},
}

This exact version (version 1, frozen text):

@misc{lacuna_secrecy_capacity_regions_for_multiuser_c_47a4deb7_v1,
  title = {Secrecy Capacity Regions for Multiuser Communication Channels},
  author = {{Lacuna}},
  howpublished = {Lacuna research direction},
  year = {2026},
  url = {https://lacuna.tiptreesystems.com/direction/secrecy-capacity-regions-for-multiuser-communication-channels/rdr_47a4deb74b78402cb9a4f335c0e12682/v/1},
  note = {Version 1, frozen 2026-10-04. Accessed 2026-11-20},
}