Generalizing Multiple Access Wiretap and Wiretap II Channel Models: Achievable Rates and Cost of Strong Secrecy

02/06/2018
by   Mohamed Nafea, et al.
0

In this paper, new two-user multiple access wiretap channel models are studied. First, the multiple access wiretap channel II with a discrete memoryless main channel, under three different wiretapping scenarios, is introduced. The wiretapper, as in the classical wiretap channel II model, chooses a fixed-length subset of the channel uses on which she obtains noise-free observations of one of the codewords, a superposition of the two codewords, or each of the two codewords. These thus extend the recently examined wiretap channel II with a noisy main channel to a multiple access setting with a variety of attack models for the wiretapper. Next, a new multiple access wiretap channel model, which further generalizes the multiple access wiretap channel II under the third wiretapping scenario, i.e., that which features the strongest adversarial model, is proposed. In this model, the wiretapper, besides choosing a subset of the channel uses to noiselessly observe the transmitted codeword symbols of both users, observes the remainder of the two codewords through a discrete memoryless multiple access channel. Achievable strong secrecy rate regions for all the proposed models are derived. Achievability is established by solving dual multi-terminal secret key agreement problems in the source model, and converting the solution to the original channel models using probability distribution approximation arguments. The derived achievable rate regions quantify the secrecy cost due to the additional capabilities of the wiretapper with respect to the previous multiple access wiretap models.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
03/07/2020

Strong Secrecy for General Multiple-Access Wiretap Channels

This paper is concerned with the general multiple access wiretap channel...
research
12/12/2017

On the Gaussian Multiple Access Wiretap Channel and the Gaussian Wiretap Channel with a Helper: Achievable Schemes and Upper Bounds

We study deterministic approximations of the Gaussian two-user multiple ...
research
12/26/2018

Structure Learning of Sparse GGMs over Multiple Access Networks

A central machine is interested in estimating the underlying structure o...
research
11/28/2018

Cooperative Resolvability and Secrecy in the Cribbing Multiple-Access Channel

We study channel resolvability for the discrete memoryless multiple-acce...
research
09/15/2019

Reversible Models for Wireless Multi-Channel Multiple Access

This paper presents a network layer model for a wireless multiple access...
research
10/18/2021

Repeated Games, Optimal Channel Capture, and Open Problems for Slotted Multiple Access

This paper revisits a classical problem of slotted multiple access with ...
research
08/22/2023

Achievable Sum-rate of variants of QAM over Gaussian Multiple Access Channel with and without security

The performance of next generation wireless systems (5G/6G and beyond) a...

Please sign up or login with your details

Forgot password? Click here to reset