Perfect secrecy, perfect omniscience and steiner tree packing

  • Authors:

  • S. Nitinawarat;A. Barg;P. Narayan;C. Ye;A. Reznik

  • Affiliations:

  • Department of Electrical and Computer Engineering and Institute for Systems Research, University of Maryland, College Park, MD;Department of Electrical and Computer Engineering and Institute for Systems Research, University of Maryland, College Park, MD;Department of Electrical and Computer Engineering and Institute for Systems Research, University of Maryland, College Park, MD;InterDigital, Inc., King of Prussia, PA;InterDigital, Inc., King of Prussia, PA

  • Venue:
  • ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 2
  • Year:
  • 2009

Quantified Score

Hi-index 0.00

Visualization

Abstract

We investigate perfect secret key generation for a "pairwise independent network" model in which every pair of terminals observes correlated sources that are independent of sources observed by all other pairs of terminals. The terminals are then allowed to communicate interactively in multiple rounds over a public noiseless channel of unlimited capacity. This communication is observed by all the terminals as well as by an eavesdropper. The objective is to generate a perfect secret key shared by a given set of terminals at the largest rate possible. All the terminals cooperate in generating the secret key, with perfect secrecy being required from the eavesdropper. For this model, we introduce the concept of communication for perfect omniscience using which we first obtain a single-letter characterization of the perfect secret key capacity. Moreover, this perfect secret key capacity is shown to be achieved by linear noninteractive communication, and coincides with the (standard) secret key capacity. Our second contribution, exploiting the notion of communication for perfect omniscience, is a new nonasymptotic and computable upper bound for the combinatorial problem of maximal Steiner tree packing in a multigraph. Thus, our work establishes certain connections among perfect secrecy generation and communication for perfect omniscience for the pairwise independent network model, and Steiner tree packing.