Multiterminal Secret Key Agreement

The problem of secret key agreement by public discussion is studied under a general multiterminal network, where each user can both send and receive over a private channel. Single-letter upper and lower bounds are for the maximum achievable key rate. The bounds are shown to match for a large class of private channels. A counter-example shows that the bounds do not match in general, and a better cooperative scheme can narrow the gap.