Related papers: Degraded Broadcast Channel with Secrecy Outside a …
In this paper, we present an achievable security scheme for an interference channel with arbitrary number of users. In this model, each receiver should be able to decode its intended message while it cannot decode any meaningful information…
This paper provides comprehensive coding and outer bound for the half-duplex multiple access channel with generalized feedback (MAC-GF). Two users communicate with one destination over a discrete memoryless channel using time division. Each…
We consider the joint source-channel coding problem of sending a Gaussian source on a K-user Gaussian broadcast channel with bandwidth mismatch. A new outer bound to the achievable distortion region is derived using the technique of…
A $K$-user secure Gaussian Multiple-Access-Channel (MAC) with an external eavesdropper is considered in this paper. An achievable rate region is established for the secure discrete memoryless MAC. The secrecy sum capacity of the degraded…
In wireless data networks, communication is particularly susceptible to eavesdropping due to its broadcast nature. Security and privacy systems have become critical for wireless providers and enterprise networks. This paper considers the…
We study a special class of the cognitive radio channel in which the receiver of the cognitive pair does not suffer interference from the primary user. Previously developed general encoding schemes for this channel are complex as they…
In this paper, we consider the problem of secret key agreement in state-dependent 3-receiver broadcast channels. In the proposed model, there are two legitimate receivers, an eavesdropper and a transmitter where the channel state…
We consider the communication scenario where a source-destination pair wishes to keep the information secret from a relay node despite wanting to enlist its help. For this scenario, an interesting question is whether the relay node should…
This paper investigates the additive white Gaussian noise two-way relay channel, where two users exchange messages through a relay. Asymmetrical channels are considered where the users can transmit data at different rates and at different…
We consider the Gaussian Multiple Access Wire-Tap Channel (GMAC-WT). In this scenario, multiple users communicate with an intended receiver in the presence of an intelligent and informed wire-tapper who receives a degraded version of the…
Secrecy in communication systems is measured herein by the distortion that an adversary incurs. The transmitter and receiver share secret key, which they use to encrypt communication and ensure distortion at an adversary. A model is…
In this paper we investigate cooperative secure communications in a four-node cognitive radio network where the secondary receiver is treated as a potential eavesdropper with respect to the primary transmission. The secondary user is…
A broadcast strategy for multiple access communication over slowly fading channels is introduced, in which the channel state information is known to only the receiver. In this strategy, the transmitters split their information streams into…
We derive the capacity region of the degraded broadcast channel (DBC) subject to the constraint that the communication is not detected by an adversary, the Warden. Our capacity result is in a computable form and numerical results show that…
In this work, the role of unidirectional limited rate transmitter cooperation is studied in the case of the 2-user Z interference channel (Z-IC) with secrecy constraints at the receivers, on achieving two conflicting goals simultaneously:…
The best known inner bound for the 2-user discrete memoryless interference channel is the Han-Kobayashi rate region. The coding schemes that achieve this region are based on rate-splitting and superposition coding. In this paper, we develop…
A state-dependent discrete memoryless multiple access channel is considered to model an integrated sensing and communication system, where two transmitters wish to convey messages to a receiver while simultaneously estimating the state…
Covert channel networks are a well-known method for circumventing the security measures organizations put in place to protect their networks from adversarial attacks. This paper introduces a novel method based on bit-rate modulation for…
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…
In this paper, the problem of secret key agreement in state-dependent multiple access channels with an eavesdropper is studied. For this model, the channel state information is non-causally available at the transmitters; furthermore, a…