Related papers: The Private Key Capacity Region for Three Terminal…
We study covert secret key generation over a binary-input two-user multiple access channel with one-way public discussion and derive bounds on the capacity region. Specifically, in this problem, there are three legitimate parties: Alice,…
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…
A general formalization is given for asynchronous multiple access channels which admits different assumptions on delays. This general framework allows the analysis of so far unexplored models leading to new interesting capacity regions. In…
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…
The multiterminal secret key agreement problem by public discussion is formulated with an additional source compression step where, prior to the public discussion phase, users independently compress their private sources to filter out…
We consider problems of two-user secret key generation through an intermediate relay. Each user observes correlated source sequences and communicates to the relay over rate-limited noiseless links. The relay processes and broadcasts…
We investigate the problem of covert and secret key generation over a state-dependent discrete memoryless channel with one-way public discussion in which an adversary, the warden, may arbitrarily choose the channel state. We develop an…
In the multiterminal secret key agreement problem, a set of users want to discuss with each other until they share a common secret key independent of their discussion. We want to characterize the maximum secret key rate, called the secrecy…
We consider a group of m+1 trusted nodes that aim to create a shared secret key K over a network in the presence of a passive eavesdropper, Eve. We assume a linear non-coherent network coding broadcast channel (over a finite field F_q) from…
This paper investigates the problem of secret key generation over a wiretap channel when the terminals observe correlated sources. These sources are independent of the main channel and the users overhear them before the transmission takes…
We consider problems of authentication using secret key generation under a privacy constraint on the enrolled source data. An adversary who has access to the stored description and correlated side information tries to deceive the…
This paper considers the problem of pairwise key agreement without public communication between three users connected through a generalized multiple access channel (MAC). While two users control the channel inputs, all three users observe…
A basic two-terminal secret key generation model is considered, where the interactive communication rate between the terminals may be limited, and in particular may not be enough to achieve the maximum key rate. We first prove a…
We propose a method to study the secrecy constraints in key generation problems where side information might be present at untrusted users. Our method is inspired by a recent work of Hayashi and Tan who used the R\'enyi divergence as the…
We consider the secret key agreement problem under the multiterminal source model proposed by Csisz\'ar and Narayan. A single-letter characterization of the secrecy capacity is desired but remains unknown except in the extreme case with…
This paper investigates the secret key authentication capacity region. Specifically, the focus is on a model where a source must transmit information over an adversary controlled channel where the adversary, prior to the source's…
This paper considers secret-key generation between several agents and a base station that observe independent and identically distributed realizations of correlated random variables. Each agent wishes to generate the longest possible…
We derive a formal connection between quantum data hiding and quantum privacy, confirming the intuition behind the construction of bound entangled states from which secret bits can be extracted. We present three main results. First, we show…
We consider a communication network with a single source that has a set of messages and two terminals where each terminal is interested in an arbitrary subset of messages at the source. A tight capacity region for this problem is…
We consider the generation of a secret key (SK) by the inputs and the output of a secure multipleaccess channel (MAC) that additionally have access to a noiseless public communication channel. Under specific restrictions on the protocols,…