Related papers: Secure Capacity Region for Erasure Broadcast Chann…
Secret-key agreement protocols over wiretap channels controlled by a state parameter are studied. The entire state sequence is known (non-causally) to the sender but not to the receiver and the eavesdropper. Upper and lower bounds on the…
In this paper, we consider a scenario where a source node wishes to broadcast two confidential messages for two respective receivers via a Gaussian MIMO broadcast channel. A wire-tapper also receives the transmitted signal via another MIMO…
Recent works have considered the ability of transmitter Alice to communicate reliably to receiver Bob without being detected by warden Willie. These works generally assume a standard discrete-time model. But the assumption of a…
Covert communications hide the transmission of a message from a watchful adversary while ensuring a certain decoding performance at the receiver. In this work, a wireless communication system under fading channels is considered where…
This paper investigates the capacity problem for some multiple-access scenarios with cooperative transmitters. First, a general Multiple-Access Channel (MAC) with common information, i.e., a scenario where p transmitters send private…
We consider secrecy obtained when one transmits on a Gaussian Wiretap channel above the secrecy capacity. Instead of equivocation, we consider probability of error as the criterion of secrecy. The usual channel codes are considered for…
This paper consider a new secure communication scene where a full-duplex transmitter (Alan) need to transmit confidential information to a half-duplex receiver (Bob), with a silent eavesdropper (Eve) that tries to eavesdrop the confidential…
We consider a scenario in which $K$ transmitters attempt to communicate covert messages reliably to a legitimate receiver over a discrete memoryless MAC while simultaneously escaping detection from an adversary who observes their…
Secure communication is considered with unreliable entanglement assistance, where the adversary may intercept the legitimate receiver's entanglement resource before communication takes place. The communication setting of unreliable…
We consider the problem of broadcasting data streams over a wireless network for multiple receivers with reliability and timely delivery guarantees. In our framework, we consider packets that need to be delivered within a given time…
In this paper, the one-sided secrecy of two-way wiretap channel with feedback is investigated, where the confidential messages of one user through multiple transmissions is guaranteed secure against an external eavesdropper. For one thing,…
In interactive coding, Alice and Bob wish to compute some function $f$ of their individual private inputs $x$ and $y$. They do this by engaging in a non-adaptive (fixed order, fixed length) protocol to jointly compute $f(x,y)$. The goal is…
The communication scenario under consideration in this paper corresponds to a multiuser channel with side information and consists of a broadcast channel with two legitimate receivers and an eavesdropper. Mainly, the results obtained are as…
Quantum Key Distribution allows two parties to establish a secret key that is secure against computationally unbounded adversaries. To extend the distance between parties, quantum networks, and in particular repeater chains, are vital.…
We consider the $K\geq 2$-user memoryless Gaussian broadcast channel (BC) with feedback and common message only. We show that linear-feedback schemes with a message point, in the spirit of Schalkwijk & Kailath's scheme for point-to-point…
We consider in this paper the problem of information reconciliation in the context of secret key agreement between two legitimate parties, Alice and Bob. Beginning the discussion with the secret key agreement model introduced by Ahlswede…
This paper considers the problem of secret communication over a two-receiver multiple-input multiple-output (MIMO) Gaussian broadcast channel. The transmitter has two independent, confidential messages and a common message. Each of the…
Channel loss seems to be the most severe limitation on the practical application of long distance quantum key distribution. The idea of twin-field quantum key distribution can improve the key rate from the linear scale of channel loss in…
We consider achieving the rates in the capacity region of a multi-level 3-receiver broadcast channel, in which the second receiver is degraded with respect to the first receiver, with degraded message sets. We propose a two-level chaining…
We study the problem of privacy amplification with an active adversary in the information theoretic setting. In this setting, two parties Alice and Bob start out with a shared $n$-bit weak random string $W$, and try to agree on a secret…