相关论文: Adding Common Randomness Can Remove the Secrecy Co…
The degrees of freedom (DoF) available for communication provides an analytically tractable way to characterize the information-theoretic capacity of interference channels. In this paper, the DoF of a K-user interference channel is studied…
We establish the DoF region for the MIMO 2x2 interference network with a general message set, consisting of nine messages, one for each pair of a subset of transmitters at which that message is known and a subset of receivers where that…
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…
The many-to-one interference channel has received interest by virtue of embodying the essence of an interference network while being more tractable than the general K-user interference channel. In this paper, we introduce information…
We consider the cache-aided MISO broadcast channel (BC) in which a multi-antenna transmitter serves $K$ single-antenna receivers, each equipped with a cache memory. The transmitter has access to partial knowledge of the channel state…
Information theoretic secrecy is combined with cryptographic secrecy to create a secret-key exchange protocol for wireless networks. A network of transmitters, which already have cryptographically secured channels between them, cooperate to…
There has been major progress over the last decade in understanding the classical interference channel (IC). Recent key results show that constant bit gap capacity results can be obtained from linear deterministic models (LDMs). However, it…
We study a two-user cognitive interference channel (CIC) where one of the transmitters (primary) has knowledge of a linear combination (over an appropriate finite field) of the two information messages. We refer to this channel model as…
This is an extended journal version of the conference paper published in ISIT 2025; submitted to IEEE Transactions on Communications (TCOM). Integrating coded caching (CC) into multiple-input multiple-output (MIMO) communications…
This paper considers the problem of communication over a discrete memoryless channel (DMC) or an additive white Gaussian noise (AWGN) channel subject to the constraint that the probability that an adversary who observes the channel outputs…
We determine the exact sum secure degrees of freedom (d.o.f.) of the K-user Gaussian interference channel. We consider three different secrecy constraints: 1) K-user interference channel with one external eavesdropper (IC-EE), 2) K-user…
Generalized Degrees of Freedom (GDoF) are characterized for the symmetric $K$-user Multiple Input Multiple Output (MIMO) Interference Channel (IC) under the assumption that the channel state information at the transmitters (CSIT) is limited…
We establish the randomized distributed function computation (RDFC) framework, in which a sender transmits just enough information for a receiver to generate a randomized function of the input data. Describing RDFC as a form of semantic…
This paper studies the problem of secure communication over broadcast channels under the individual secrecy constraints. That is, the transmitter wants to send two independent messages to two legitimate receivers in the presence of an…
In a K-user Gaussian interference channel, it has been shown by Geng et al. that if for each user the desired signal strength is no less than the sum of the strengths of the strongest interference from this user and the strongest…
A two-transmitter Gaussian multiple access wiretap channel with multiple antennas at each of the nodes is investigated. The channel matrices at the legitimate terminals are fixed and revealed to all the terminals, whereas the channel matrix…
We consider a secure communication over a two-user Gaussian interference channel, where each transmitter sends a confidential message to its legitimate receiver. For this setting, we identify a regime where the simple scheme of using…
This paper considers the transmission of confidential messages over noisy wireless ad hoc networks, where both background noise and interference from concurrent transmitters affect the received signals. For the random networks where the…
We study the role of caches in wireless interference networks. We focus on content caching and delivery across a Gaussian interference network, where both transmitters and receivers are equipped with caches. We provide a constant-factor…
This letter presents a performance comparison of two popular secrecy enhancement techniques in wireless networks: (i) creating guard zones by restricting transmissions of legitimate transmitters whenever any eavesdropper is detected in…