A New Achievable Region of the K-User MAC Wiretap Channel with Confidential and Open Messages Under Strong Secrecy

This paper investigates the achievable region of a K -user discrete memoryless (DM) multiple access wiretap (MAC-WT) channel, where each user transmits both secret and open (i.e., non-confidential) messages. All these messages are intended for the legitimate receiver (Bob), while the eavesdropper (Eve) is only interested in the secret messages. In the achievable coding strategy, the confidential information is protected by open messages and also by the introduction of auxiliary messages. When introducing an auxiliary message, one has to ensure that, on one hand, its rate is large enough for protecting the secret message from Eve and, on the other hand, the resulting sum rate (together with the secret and open message rate) does not exceed Bob’s decoding capability. This yields an inequality structure involving the rates of all users’ secret, open, and auxiliary messages. To obtain the rate region, the auxiliary message rates must be eliminated from the system of inequalities. A direct application of the Fourier-Motzkin elimination procedure is elusive since a) it requires that the number of users K is explicitly given, and b) even for small K = 3, 4, …, the number of inequalities becomes extremely large. We prove the result for general K through the combined use of Fourier-Motzkin elimination procedure and mathematical induction. This paper adopts the strong secrecy metric, characterized by information leakage . To prove the achievability under this criterion, we analyze the resolvability region of a K -user DM-MAC channel (not necessarily a wiretap channel). In addition, we show that users with zero secrecy rate can play different roles and use different strategies in encoding their messages. These strategies yield non-redundant (i.e., not mutually dominating) rate inequalities. By considering all possible coding strategies, we provide a new achievable region for the considered channel, and show that it strictly improves those already known in the existing literature by considering a specific example.

Publication Details

Journal
UCL Discovery (University College London)
Published
2024-10-01
Primary Topic
Reproductive Health and Technologies
Type
article
Field-Weighted Citation Impact
0.00

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

A New Achievable Region of the K-User MAC Wiretap Channel with Confidential and Open Messages Under Strong Secrecy

UCL Discovery (University College London)
Reproductive Health and Technologies
article

A New Achievable Region of the K-User MAC Wiretap Channel with Confidential and Open Messages Under Strong Secrecy

article en

Abstract

This paper investigates the achievable region of a K -user discrete memoryless (DM) multiple access wiretap (MAC-WT) channel, where each user transmits both secret and open (i.e., non-confidential) messages. All these messages are intended for the legitimate receiver (Bob), while the eavesdropper (Eve) is only interested in the secret messages. In the achievable coding strategy, the confidential information is protected by open messages and also by the introduction of auxiliary messages. When introducing an auxiliary message, one has to ensure that, on one hand, its rate is large enough for protecting the secret message from Eve and, on the other hand, the resulting sum rate (together with the secret and open message rate) does not exceed Bob’s decoding capability. This yields an inequality structure involving the rates of all users’ secret, open, and auxiliary messages. To obtain the rate region, the auxiliary message rates must be eliminated from the system of inequalities. A direct application of the Fourier-Motzkin elimination procedure is elusive since a) it requires that the number of users K is explicitly given, and b) even for small K = 3, 4, …, the number of inequalities becomes extremely large. We prove the result for general K through the combined use of Fourier-Motzkin elimination procedure and mathematical induction. This paper adopts the strong secrecy metric, characterized by information leakage . To prove the achievability under this criterion, we analyze the resolvability region of a K -user DM-MAC channel (not necessarily a wiretap channel). In addition, we show that users with zero secrecy rate can play different roles and use different strategies in encoding their messages. These strategies yield non-redundant (i.e., not mutually dominating) rate inequalities. By considering all possible coding strategies, we provide a new achievable region for the considered channel, and show that it strictly improves those already known in the existing literature by considering a specific example.

UCL Discovery (University College London)
Alexander von Humboldt-Stiftung, European Commission
Peace, Justice and strong institutions
Openalex Percentile: Top 42%
Reproductive Health and Technologies
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.