Secrecy Capacity Regions for Multi-User Broadcast Channels

This direction is split into other directions: degraded channel assumption. Its last version stays readable and citable here.

Version 1 of 128 papers36 conceptsfrozen 2026-10-04

In traditional cryptography, security relies on the computational difficulty of a mathematical problem. Information-theoretic security, however, relies on the physical properties of the communication channel itself. The goal is to design transmission schemes where, even with infinite computing power, an eavesdropper physically cannot extract any information from the signal.

The central challenge in this field is characterizing the secrecy capacity region: the precise mathematical boundary of how much information we can send to legitimate users while keeping it perfectly hidden from unauthorized ones.

The Hierarchy of Noise

To understand why this is difficult, we must look at how receivers are "ranked." In a simple degraded channel, there is a clear hierarchy of signal quality. For example, if Receiver B’s signal is just a noisier version of Receiver A’s signal, we say the channel is degraded. In these cases, researchers like Ashish Khisti and Gregory W. Wornell have shown that we can mathematically determine the exact secrecy capacity.

However, real-world wireless environments are rarely so orderly. In a non-degraded channel, one receiver might have a better signal for some frequencies or antennas, while the eavesdropper has the advantage in others. As Ghadamali Bagherikaram and Amir K. Khandani point out in The Secrecy Rate Region of the Broadcast Channel, characterizing the capacity for these general channels remains one of the most significant unsolved problems in information theory. Without a strict hierarchy, it is difficult to prove that a specific coding scheme is the absolute best possible (the "outer bound").

Secret Superposition and Wiretap Coding

To achieve secrecy, researchers use a technique called wiretap coding. The intuition is to inject "dummy" information or noise into the signal. This noise is designed to interfere with the eavesdropper’s reception but can be canceled out by the legitimate receiver.

In multi-user scenarios, this evolves into a Secret Superposition Scheme. As explored by Ghadamali Bagherikaram and colleagues in Secrecy Rate Region of the Broadcast Channel with an Eavesdropper, a transmitter can layer multiple private messages. By carefully choosing the power levels and coding structures, the transmitter ensures that each legitimate receiver can "peel away" the layers intended for others to reach their own message, while the eavesdropper is left with a signal that looks like pure thermal noise.

Trading Messages for Keys

Another way to look at this problem is as a trade-off between two resources: secret messages (actual data) and secret keys (random bits used for later encryption).

Vinod M. Prabhakaran and Krishnan Eswaran demonstrated in Secrecy via Sources and Channels that if two parties share a noisy channel and see correlated data (like common environmental noise), they can choose to either send a secure message directly or use the channel to agree on a secret key. The "capacity region" here defines the optimal balance—how much of one you must give up to get more of the other.

Bridging the Gap with New Mathematics

Because the general secrecy capacity is so elusive, researchers often develop new mathematical tools to tighten the "bounds" between what we know is possible and what we suspect is the limit.

For instance, Ruoheng Liu and H. Vincent Poor introduced a vector generalization of the Entropy-Power Inequality (EPI) in A Vector Generalization of Costa's Entropy-Power Inequality with Applications. This allows researchers to handle Multiple-Input Multiple-Output (MIMO) systems—where transmitters and receivers have multiple antennas—by treating the signals as matrices rather than simple numbers.

Similarly, Mojtaba Vaezi and Wonjae Shin simplified the complex matrix math of MIMO channels into trigonometric problems in Optimal Beamforming for Gaussian MIMO Wiretap Channels With Two Transmit Antennas, providing a rare analytical solution for a specific antenna configuration.

Why the Exact Capacity Matters

The recurring theme across these papers, from Yingbin Liang to Ziv Goldfeld, is the search for matching inner and outer bounds.

  • An inner bound is a proof that "we can at least achieve this rate."
  • An outer bound is a proof that "no one can ever exceed this rate."

When these two bounds meet, we have found the capacity. For the most general, non-degraded broadcast channels, these bounds still don't match. This gap represents a fundamental mystery: we don't yet know if our current secure coding schemes are the best possible, or if there is a more sophisticated way to exploit the physics of the channel to achieve even higher rates of secure communication.

Papers in this version

History & citationVersion 1 · 2026-10-04

Split into other directions · Permanent link

View frozen version 1

Cite this direction

Latest version (a living page):

@misc{lacuna_secrecy_capacity_regions_for_multi_user__db916486,
  title = {Secrecy Capacity Regions for Multi-User Broadcast Channels},
  author = {{Lacuna}},
  howpublished = {Lacuna research direction},
  year = {2026},
  url = {https://lacuna.tiptreesystems.com/direction/secrecy-capacity-regions-for-multi-user-broadcast-channels/rdr_db91648659954ac38c914bcd592d883e},
  note = {Latest version of a living research direction; cite a version for a fixed text. Accessed 2026-11-21},
}

This exact version (version 1, frozen text):

@misc{lacuna_secrecy_capacity_regions_for_multi_user__db916486_v1,
  title = {Secrecy Capacity Regions for Multi-User Broadcast Channels},
  author = {{Lacuna}},
  howpublished = {Lacuna research direction},
  year = {2026},
  url = {https://lacuna.tiptreesystems.com/direction/secrecy-capacity-regions-for-multi-user-broadcast-channels/rdr_db91648659954ac38c914bcd592d883e/v/1},
  note = {Version 1, frozen 2026-10-04. Accessed 2026-11-21},
}