IEEE International Symposium on Information Theory (ISIT)
Oracle-Aided Multiterminal Secret Key Generation
Sagnik Bhattacharya, Prakash Narayan
Abstract
Considering a multiterminal model for secret key (SK) generation with m ≥ 2 terminals $\mathcal{M} = \left\{ {1, \ldots ,m} \right\}$, we address the characterization of SK capacity for a subset of terminals $A \subseteq \mathcal{M}$, when the terminals observe the respective components of a discrete memoryless multiple source. The terminals in $\mathcal{M}$ are assisted by an omniscient oracle terminal that observes the full DMMS. All the terminals communicate among themselves publicly and interactively in a broadcast mode in order to generate a SK that must be concealed from an eavesdropper with access to the public communication. The oracle terminal is restricted to communicate at rate ≤ R. We show that owing to the oracle terminal being omniscient, it is sufficient to consider communication protocols in which the oracle communicates first and only once. Leveraging this simplification, we provide single-letter upper and lower bounds for SK capacity. A full characterization of SK capacity is provided for oracle rates R above a certain threshold R*, where the oracle can describe the entire DMMS to all terminals in A. For the region 0*, our upper and lower bounds for SK capacity explore the enhancement in SK rates afforded by the oracle’s assistance, compared with a standard private key model. Our work addresses practical settings like mobile networks and robot swarms where a central antenna or lead robot can possess information regarding the entire network but must operate under a limited communication budget.