Strong Secrecy for General Multiple-Access Wiretap Channels

03/07/2020
by   Manos Athanasakos, et al.
0

This paper is concerned with the general multiple access wiretap channel and the existence of codes that accomplish reliability and strong secrecy. Information leakage to the eavesdropper is assessed by the variational distance metric, whereas the average error probability is bounded by modifying Feinsteins Lemma. We derive an achievable strong secrecy rate region by utilizing the resolvability theory for the multiple-access channel in terms of information-spectrum methods.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
02/06/2018

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

In this paper, new two-user multiple access wiretap channel models are s...
research
01/25/2017

Wiretap channel capacity: Secrecy criteria, strong converse, and phase change

This paper employs equal-image-size source partitioning techniques to de...
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
11/19/2018

Semantic Security and the Second-Largest Eigenvalue of Biregular Graphs

It is investigated how to achieve semantic security for the wiretap chan...
research
07/10/2019

Adding Common Randomness Can Remove the Secrecy Constraints in Communication Networks

In communication networks secrecy constraints usually incur an extra lim...
research
07/29/2021

Achievable Regions and Precoder Designs for the Multiple Access Wiretap Channels with Confidential and Open Messages

This paper investigates the secrecy capacity region of multiple access w...
research
01/23/2018

Homologous Codes for Multiple Access Channels

Building on recent development by Padakandla and Pradhan, and by Lim, Fe...

Please sign up or login with your details

Forgot password? Click here to reset