Related papers: Covert Multi-Access Communication with a Non-Cover…
In this paper, we study the performance of network-coded cooperative diversity systems with practical communication constraints. More specifically, we investigate the interplay between diversity, coding, and multiplexing gain when the relay…
We investigate the $K$-user many-to-one interference channel with confidential messages in which the $K$th user experiences interference from all other $K-1$ users, and is at the same time treated as an eavesdropper to all the messages of…
We consider the N-user broadcast erasure channel with public feedback and side information. Before the beginning of transmission, each receiver knows a function of the messages of some of the other receivers. This situation arises naturally…
This paper studies the capacity of massive random-access cellular networks, modeled as a MIMO fading channel with an infinite number of interfering cells. To characterize the symmetric sum rate of the network, a random-coding argument is…
Information theoretically secure multi-party computation (MPC) is a central primitive of modern cryptography. However, relatively little is known about the communication complexity of this primitive. In this work, we develop powerful…
The multi-access variant of the coded caching problem in the presence of an external wiretapper is investigated . A multi-access coded caching scheme with $K$ users, $K$ caches and $N$ files, where each user has access to $L$ neighbouring…
We introduce a model for mobile, multi-agent information transfer that increases the communication covertness through a protocol which also increases the information transfer delay. Covertness is achieved in the presence of a warden who has…
Caching is an efficient way to reduce network traffic congestion during peak hours by storing some content at the users' local caches. For the shared-link network with end-user-caches, Maddah-Ali and Niesen proposed a two-phase coded…
Security constraint results in \textit{rate-loss} in wiretap channels. In this paper we propose a coding scheme for two user Multiple Access Channel with Wiretap (MAC-WT), where previous messages are used as a key to enhance the secrecy…
The deployment of unmanned aerial vehicle (UAV) for surveillance and monitoring gives rise to the confidential information leakage challenge in both civilian and military environments. The security and covert communication problems for a…
This paper investigates the maximal secret communication rate over a wiretap channel subject to reliability and secrecy constraints at a given blocklength. New achievability and converse bounds are derived, which are uniformly tighter than…
In this paper, bounds to the rate-equivocation region for the general 3-receiver broadcast channel (BC) with degraded message sets, are presented for confidential messages to be kept secret from one of the receivers. This model is more…
This paper considers the problem of pairwise key agreement without public communication between three users connected through a generalized multiple access channel (MAC). While two users control the channel inputs, all three users observe…
Data shuffling of training data among different computing nodes (workers) has been identified as a core element to improve the statistical performance of modern large-scale machine learning algorithms. Data shuffling is often considered as…
The communication scenario under consideration in this paper corresponds to a multiuser channel with side information and consists of a broadcast channel with two legitimate receivers and an eavesdropper. Mainly, the results obtained are as…
Motivated by diverse secure requirements of multi-user in UAV systems, we propose a collaborative secret and covert transmission method for multi-antenna ground users to unmanned aerial vehicle (UAV) communications. Specifically, based on…
This work presents novel achievable schemes for the 2-user symmetric linear deterministic interference channel with limited-rate transmitter cooperation and perfect secrecy constraints at the receivers. The proposed achievable scheme…
Within the context of coded caching, the work reveals the interesting connection between having multiple transmitters and having heterogeneity in the cache sizes of the receivers. Our work effectively shows that having multiple transmit…
This paper considers the problem of secret communication over a multiple access channel with generalized feedback. Two trusted users send independent confidential messages to an intended receiver, in the presence of a passive eavesdropper.…
A downlink single-input single-output non-orthogonal multiple access setting is considered, in which a base station (BS) is communicating with two legitimate users in two possible scenarios of unsecure environments: existence of an external…