Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Coded Cooperative Data Exchange for a Secret Key   We consider a coded cooperative data exchange problem with the goal of
generating a secret key. Specifically, we investigate the number of public
transmissions required for a set of clients to agree on a secret key with
probability one, subject to the constraint that it remains private from an
eavesdropper.
  Although the problems are closely related, we prove that secret key
generation with fewest number of linear transmissions is NP-hard, while it is
known that the analogous problem in traditional cooperative data exchange can
be solved in polynomial time. In doing this, we completely characterize the
best possible performance of linear coding schemes, and also prove that linear
codes can be strictly suboptimal. Finally, we extend the single-key results to
characterize the minimum number of public transmissions required to generate a
desired integer number of statistically independent secret keys.

23
The categories of this paper are: solv-int
9
The categories of this paper are: nlin
16
The categories of this paper are: stat
19
The categories of this paper are: eess
4
The categories of this paper are: cond-mat
7
The categories of this paper are: hep-th
33
The categories of this paper are: plasm-ph
18
The categories of this paper are: econ
12
The categories of this paper are: nucl-th
31
The categories of this paper are: ao-sci
37
The categories of this paper are: supr-con
25
The categories of this paper are: patt-sol
26
The categories of this paper are: bayes-an
21
The categories of this paper are: adap-org
32
The categories of this paper are: atom-ph
0
The categories of this paper are: hep-ph