The Discrete Memoryless Multiple Access Channel with Confidential Messages

TL;DR

This paper investigates a multiple-access channel where one encoder's messages must remain perfectly secret from the other, establishing bounds and achievable rates for secure communication.

Contribution

It introduces bounds and achievable rates for confidential message transmission in a multiple-access channel with perfect secrecy constraints.

Findings

Derived upper bounds on secrecy capacity

Established achievable rate regions for confidential messages

Ensured perfect secrecy measured by equivocation

Abstract

A multiple-access channel is considered in which messages from one encoder are confidential. Confidential messages are to be transmitted with perfect secrecy, as measured by equivocation at the other encoder. The upper bounds and the achievable rates for this communication situation are determined.