Related papers: Covert Multi-Access Communication with a Non-Cover…
This study investigates the capacity region of a three-user cognitive radio network with two primary users and one cognitive user. A three-user Cognitive Interference Channel (C-IFC) is proposed by considering a three-user Interference…
The multiuser communication channel, in which multiple users exchange information with the help of a relay terminal, termed the multi-way relay channel (mRC), is introduced. In this model, multiple interfering clusters of users communicate…
In this paper, we investigate joint information-theoretic security and covert communication on a network in the presence of a single transmitter (Alice), a friendly jammer, a single untrusted user, two legitimate users, and a single warden…
A frequent problem in settings where a unique resource must be shared among users is how to resolve the contention that arises when all of them must use it, but the resource allows only for one user each time. The application of efficient…
In this paper, we consider the issue of covert communications with random access protocol. We consider that the legitimate user Bob has no priori knowledge about packet arrival time and thus employs data-aided frame detection based on…
This paper considers a three-receiver broadcast channel with degraded message sets and message cognition. The model consists of a common message for all three receivers, a private common message for only two receivers and two additional…
This paper investigates the secrecy capacity region of multiple access wiretap (MAC-WT) channels where, besides confidential messages, the users have also open messages to transmit. All these messages are intended for the legitimate…
In the multiterminal secret key agreement problem, a set of users want to discuss with each other until they share a common secret key independent of their discussion. We want to characterize the maximum secret key rate, called the secrecy…
We consider a distributed secret sharing system that consists of a dealer, $n$ storage nodes, and $m$ users. Each user is given access to a certain subset of storage nodes, where it can download the stored data. The dealer wants to securely…
Two of the most challenging goals to be achieved in the fifth generation (5G) and beyond communication are massive connectivity and higher capacity. The use of traditional orthogonal multiple access techniques limits the number of users…
We consider covert communication, i.e., hiding the presence of communication from an adversary for multiple-input multiple-output (MIMO) additive white Gaussian noise (AWGN) channels. We characterize the maximum covert coding rate under a…
Quantum communications promises reliable transmission of quantum information, efficient distribution of entanglement and generation of completely secure keys. For all these tasks, we need to determine the optimal point-to-point rates that…
In this paper, we propose a cooperative approach to improve the security of both primary and secondary systems in cognitive radio multicast communications. During their access to the frequency spectrum licensed to the primary users, the…
The multi-way relay channel (MWRC) models cooperative communication networks in which many users exchange messages via a relay. In this paper, we consider the finite field MWRC with correlated messages. The problem is to find all achievable…
We investigate the maximum coding rate achievable on a two-user broadcast channel for the case where a common message is transmitted with feedback using either fixed-blocklength codes or variable-length codes. For the fixed-blocklength-code…
This work presents another look at an analog network coding scheme for multi-user spread-spectrum communication systems. Our proposed system combines coding and cooperation between a relay and users to boost the throughput and to exploit…
The physical layer security in the up-link of the wireless communication systems is often modeled as the multiple access wiretap channel (MAC-WT), and recently it has received a lot attention. In this paper, the MAC-WT has been re-visited…
This work studies a well-known shared-cache coded caching scenario where each cache can serve an arbitrary number of users, analyzing the case where there is some knowledge about such number of users (i.e., the topology) during the content…
This paper investigates the achievable region and precoder design for multiple access wiretap (MAC-WT) channels, where each user transmits both secret and open (i.e., non-confidential) messages. All these messages are intended for the…
We investigate the secrecy performance of a multiuser diversity scheme for an interference-limited wireless network with a base-station (BS), $N$ legitimate users and an eavesdropper, in the presence of a single dominant interferer.…