Secure Multiplex Coding Over Interference Channel with Confidential Messages

TL;DR

This paper advances secure communication over interference channels by integrating multiplex coding with error correction, achieving the full Han-Kobayashi capacity region while ensuring strong security and improved equivocation bounds.

Contribution

It introduces a novel secure multiplex coding scheme that enhances capacity and security in interference channels, extending previous methods to achieve the entire Han-Kobayashi region with strong security guarantees.

Findings

Achieves the entire Han-Kobayashi region with security enhancements.

Removes rate loss caused by dummy messages for security.

Provides bounds on equivocation rate for finite and high-rate messages.

Abstract

In this paper, inner and outer bounds on the capacity region of two-user interference channels with two confidential messages have been proposed. By adding secure multiplex coding to the error correction method in [15] which achieves the best achievable capacity region for interference channel up to now, we have shown that the improved secure capacity region compared with [2] now is the whole Han-Kobayashi region. In addition, this construction not only removes the rate loss incurred by adding dummy messages to achieve security, but also change the original weak security condition in [2] to strong security. Then the equivocation rate for a collection of secret messages has also been evaluated, when the length of the message is finite or the information rate is high, our result provides a good approximation for bounding the worst case equivocation rate. Our results can be readily extended to the Gaussian interference channel with little efforts.