Related papers: Secrecy Results for Compound Wiretap Channels
In this work, the role of noisy feedback in enhancing the secrecy capacity of the wiretap channel is investigated. A model is considered in which the feed-forward and feedback signals share the same noisy channel. More specifically, a…
We consider classical message transmission under entanglement assistance for compound memoryless and arbitrarily varying quantum channels. In both cases, we prove general coding theorems together with corresponding weak converse bounds. In…
Capacity bounds for waveform channels under square-law detection of time-limited complex-valued signals are derived. The upper bound is the capacity of the channel under (complex-valued) coherent detection. The lower bound is one bit less,…
We study the fundamental limits of covert communications over general memoryless additive-noise channels. We assume that the legitimate receiver and the eavesdropper share the same channel and therefore see the same outputs. Under mild…
This paper considers the problem of simultaneously communicating two messages, a high-security message and a low-security message, to a legitimate receiver, referred to as the security embedding problem. An information-theoretic formulation…
In this paper we consider the robust secure beamformer design for MISO wiretap channels. Assume that the eavesdroppers' channels are only partially available at the transmitter, we seek to maximize the secrecy rate under the transmit power…
We propose the notion of secrecy gain as a code design criterion for wiretap lattice codes to be used over an additive white Gaussian noise channel. Our analysis relies on the error probabilites of both the legitimate user and the…
The quantum capacity of a noisy quantum channel determines the maximal rate at which we can code reliably over asymptotically many uses of the channel, and it characterizes the channel's ultimate ability to transmit quantum information…
We derive a tight lower bound on equivocation (conditional entropy), or equivalently a tight upper bound on mutual information between a signal variable and channel outputs. The bound is in terms of the joint distribution of the signals and…
We consider reliable and secure communication over intersymbol interference wiretap channels (ISI-WTCs). In particular, we first derive an achievable secure rate for ISI-WTCs without imposing any constraints on the input distribution.…
Compound MIMO wiretap channel with double sided uncertainty is considered under channel mean information model. In mean information model, channel variations are centered around its mean value which is fed back to the transmitter. We show…
The K-receiver wiretap channel is a channel model where a transmitter broadcasts K independent messages to K intended receivers while keeping them secret from an eavesdropper. The capacity region of the K-receiver multiple-input…
Capacity-achieving signaling strategies for the Gaussian wiretap MIMO channel are investigated without the degradedness assumption. In addition to known solutions, a number of new rank-deficient solutions for the optimal transmit covariance…
With the growth of wireless networks, security has become a fundamental issue in wireless communications due to the broadcast nature of these networks. In this work, we consider MIMO wiretap channels in a fast fading environment, for which…
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…
In this two-part paper, we consider the transmission of confidential data over wireless wiretap channels. The first part presents an information-theoretic problem formulation in which two legitimate partners communicate over a quasi-static…
This paper considers the problem of communication over a memoryless classical-quantum wiretap channel subject to the constraint that the eavesdropper on the channel should not be able to learn whether the legitimate parties are using the…
In this work we study the secrecy capacity of Gaussian multiple-input multiple-output (MIMO) wiretap channels (WTCs) with a finite memory, subject to a per-symbol average power constraint on the MIMO channel input. MIMO channels with finite…
In this paper, we study the degraded compound multi-receiver wiretap channel. The degraded compound multi-receiver wiretap channel consists of two groups of users and a group of eavesdroppers, where, if we pick an arbitrary user from each…
We consider lattice coding for the Gaussian wiretap channel, where the challenge is to ensure reliable communication between two authorized parties while preventing an eavesdropper from learning the transmitted messages. Recently, a measure…