Computer Science – Information Theory
Scientific paper
2010-07-20
Computer Science
Information Theory
IEEE Transactions on Information Theory, in revision prior to review for final approval
Scientific paper
We consider 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 publicly with all such communication being observed by all the terminals. The objective is to generate a secret key shared by a given subset of terminals at the largest rate possible, with the cooperation of any remaining terminals. Secrecy is required from an eavesdropper that has access to the public interterminal communication. A (single-letter) formula for secret key capacity brings out a natural connection between the problem of secret key generation and a combinatorial problem of maximal packing of Steiner trees in an associated multigraph. An explicit algorithm is proposed for secret key generation based on a maximal packing of Steiner trees in a multigraph; the corresponding maximum rate of Steiner tree packing is thus a lower bound for the secret key capacity. When only two of the terminals or when all the terminals seek to share a secret key, the mentioned algorithm achieves secret key capacity in which case the bound is tight.
Barg Alexander
Narayan Prakash
Nitinawarat Sirin
Reznik Alex
Ye Chunxuan
No associations
LandOfFree
Secret Key Generation for a Pairwise Independent Network Model does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Secret Key Generation for a Pairwise Independent Network Model, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Secret Key Generation for a Pairwise Independent Network Model will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-182598