Multiterminal Secret Key Agreement
Research output: Journal Publications and Reviews (RGC: 21, 22, 62) › 21_Publication in refereed journal › peer-review
|Journal / Publication||IEEE Transactions on Information Theory|
|Online published||21 Apr 2014|
|Publication status||Published - Jun 2014|
|Link to Scopus||https://www.scopus.com/record/display.uri?eid=2-s2.0-84901283610&origin=recordpage|
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.
- general multiterminal network, pure and mixed source emulations, secrecy capacity, Secret key agreement