Related papers: One-Shot Achievable Secrecy Rate Regions for Quant…
We propose a quantum soft-covering problem for a given general quantum channel and one of its output states, which consists in finding the minimum rank of an input state needed to approximate the given channel output. We then prove a…
In this work, we prove a novel one-shot multi-sender decoupling theorem generalising Dupuis result. We start off with a multipartite quantum state, say on A1 A2 R, where A1, A2 are treated as the two sender systems and R is the reference…
Since a quantum measurement generally disturbs the state of a quantum system, one might think that it should not be possible for a sender and receiver to communicate reliably when the receiver performs a large number of sequential…
Reliable communication imposes an upper limit on the achievable rate, namely the Shannon capacity. Wyner's wiretap coding, which ensures a security constraint also, in addition to reliability, results in decrease of the achievable rate. To…
A Quantum Key Distribution (QKD) protocol describes how two remote parties can establish a secret key by communicating over a quantum and a public classical channel that both can be accessed by an eavesdropper. QKD protocols using…
In [1], it is shown that the simultaneous identification capacity region for the discrete, memoryless, classical-quantum multiple access channel is equal to the transmission capacity region for codes using a deterministic encoding scheme.…
This paper considers the capacity gains due to unidirectional destination cooperation in cognitive radio channels. We propose a novel channel, interference channel with degraded message sets with unidirectional destination cooperation…
We propose a new proof method for direct coding theorems for wiretap channels where the eavesdropper has access to a quantum version of the transmitted signal on an infinite-dimensional Hilbert space and the legitimate parties communicate…
In this paper, we study the state-dependent two-user interference channel, where the state information is non-causally known at both transmitters but unknown to either of the receivers. We first propose two coding schemes for the discrete…
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 investigate a general class of quantum key distribution (QKD) protocols using one-way classical communication. We show that full security can be proven by considering only collective attacks. We derive computable lower and upper bounds…
A new applicable wiretap channel with separated side information is considered here which consist of a sender, a legitimate receiver and a wiretapper. In the considered scenario, the links from the transmitter to the legitimate receiver and…
In this paper the secrecy problem in the cognitive statedependent interference channel is considered. In this scenario we have a primary and a cognitive transmitter-receiver pairs. The cognitive transmitter has the message of the primary…
We address the question of efficient implementation of quantum protocols, with small communication and entanglement, and short depth circuit for encoding or decoding. We introduce two new methods to achieve this, the first method involving…
The quantum capacity of a memoryless channel is often used as a single figure of merit to characterize its ability to transmit quantum information coherently. The capacity determines the maximal rate at which we can code reliably over…
An important metric of the performance of a quantum secret sharing scheme is its information rate. Beyond the fact that the information rate is upper bounded by one, very little is known in terms of bounds on the information rate of quantum…
Consider an interference channel consisting of $K_T$ transmitters and $K_R$ receivers with AWGN noise and complex channel gains, and with $N$ files in the system. The one-shot $\mathsf{DoF}$ for this channel is the maximum number of…
In this paper, we consider the design of a new secrecy transmission scheme for a four-node relay-eavesdropper channel. The key idea of the proposed scheme is to combine noisy network coding with the interference assisted strategy for…
Granting information privacy is of crucial importance in our society, notably in fiber communication networks. Quantum cryptography provides a unique means to establish, at remote locations, identical strings of genuine random bits, with a…
We consider a two user multiple-access channel with an eavesdropper at the receiving end. We use previously transmitted messages as a key in the next slot till we achieve the capacity region of the usual Multiple Access Channel (MAC).