On Strong Secrecy for Multiple Access Channel with States and Causal CSI

05/02/2023
by   Yiqi Chen, et al.
0

Strong secrecy communication over a discrete memoryless state-dependent multiple access channel (SD-MAC) with an external eavesdropper is investigated. The channel is governed by discrete memoryless and i.i.d. channel states and the channel state information (CSI) is revealed to the encoders in a causal manner. An inner bound of the capacity is provided. To establish the inner bound, we investigate coding schemes incorporating wiretap coding and secret key agreement between the sender and the legitimate receiver. Two kinds of block Markov coding schemes are studied. The first one uses backward decoding and Wyner-Ziv coding and the secret key is constructed from a lossy reproduction of the CSI. The other one is an extended version of the existing coding scheme for point-to-point wiretap channels with causal CSI. We further investigate some capacity-achieving cases for state-dependent multiple access wiretap channels (SD-MAWCs) with degraded message sets. It turns out that the two coding schemes are both optimal in these cases.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
06/25/2023

On Strong Secrecy for Multiple Access Channels with States and Causal CSI

Strong secrecy communication over a discrete memoryless state-dependent ...
research
07/29/2020

Feedback Capacities of Gaussian Multiple-Access Wiretap Channels

The feedback capacities of the Gaussian multiple-access channel (GMAC) a...
research
01/10/2020

Wiretap channels with causal state information: revisited

The coding problem for wiretap channels with causal channel state inform...
research
02/01/2013

A coding approach to guarantee information integrity against a Byzantine relay

This paper presents a random coding scheme with which two nodes can exch...
research
04/25/2023

State-Dependent DMC with a Causal Helper

A memoryless state sequence governing the behavior of a memoryless state...
research
12/04/2021

Analysis of Communication Channels Related to Physical Unclonable Functions

Cryptographic algorithms rely on the secrecy of their corresponding keys...
research
01/09/2020

Securing Distributed Function Approximation via Coding for Continuous Compound Channels

We revisit the problem of distributed approximation of functions over mu...

Please sign up or login with your details

Forgot password? Click here to reset