We consider a three-nodes network, in which two agents wish to communicate over a noisy channel, while controlling the distribution observed by a third external agent. We use strong coordination to constrain the distribution, and we provide a complete characterization of the ``remote strong coordination and reliable communication" region.
We investigate the arbitrarily varying wiretap channel with non-causal side information at the jammer for the case that there exists a best channel to the eavesdropper and under the condition that strong degradedness holds. Non-causal side information means that codewords are known at an active adversary before they are transmitted. By considering the maximum error criterion, we allow also messages to be known at the jammer before the corresponding codeword is transmitted. A single letter formula for the common randomness secrecy capacity is derived.
In the conditional disclosure of secrets (CDS) problem, Alice and Bob (each holds an input and a common secret) wish to disclose, as efficiently as possible, the secret to Carol if and only if their inputs satisfy some function. The capacity of CDS is the maximum number of bits of the secret that can be securely disclosed per bit of total communication. We characterize the necessary and sufficient condition for the extreme case where the capacity of CDS is the highest and is equal to 1/2.
This paper investigates the capacity region of a discrete memoryless (DM) multiple access wiretap (MAC-WT) channel where, besides confidential messages, the users have also open messages to transmit. All these messages are intended for the legitimate receiver but only the confidential messages need to be protected from the eavesdropper. By using random coding, we find an achievable secrecy rate region, within which perfect secrecy can be realized, i.e., all users can communicate with the legitimate receiver with arbitrarily small probability of error, while the confidential information leaked to the eavesdropper tends to zero.
The discussion rate region in the multiterminal source model is the individual discussion rate required for generating a secret key of maximum rate. We give an explicit single-letter characterization of the discussion rate region for a large class of the pairwise independent network (PIN) models. Besides, we also establish a sufficient condition for identifying whether a PIN model belongs to this class, which can be checked in strongly polynomial time. As a by-product, the discussion rate region reduces to a very simple expression for PIN model satisfying such condition.