Secret key capacity: Talk or keep silent?

The problem of when all terminals must talk to achieve the secrecy capacity in the multiterminal source model is investigated. Two conditions under which respectively a given terminal does not need to and must talk to achieve the secrecy capacity are characterized. The cases when all terminals must talk to achieve secrecy capacity are shown to be many more than those conjectured in [1] for systems with four or more terminals. There is a gap between the above two conditions, in which whether a given terminal need to talk is not clear. A conjecture is further made in order to narrow down the gap.

[1]  Chung Chan,et al.  Mutual dependence for secret key agreement , 2010, 2010 44th Annual Conference on Information Sciences and Systems (CISS).

[2]  Rudolf Ahlswede,et al.  Common randomness in information theory and cryptography - I: Secret sharing , 1993, IEEE Trans. Inf. Theory.

[3]  Navin Kashyap,et al.  Achieving SK capacity in the source model: When must all terminals talk? , 2014, 2014 IEEE International Symposium on Information Theory.

[4]  Aaron D. Wyner,et al.  The common information of two dependent random variables , 1975, IEEE Trans. Inf. Theory.

[5]  Ueli Maurer,et al.  Secret key agreement by public discussion from common information , 1993, IEEE Trans. Inf. Theory.

[6]  Yingbin Liang,et al.  Helper-assisted asymmetric two key generation , 2014, 2014 48th Asilomar Conference on Signals, Systems and Computers.

[7]  Venkat Anantharam,et al.  Information-Theoretic Key Agreement of Multiple Terminals—Part I , 2010, IEEE Transactions on Information Theory.

[8]  Imre Csiszár,et al.  Secrecy capacities for multiple terminals , 2004, IEEE Transactions on Information Theory.

[9]  Chung Chan,et al.  Generating secret in a network , 2010 .

[10]  Himanshu Tyagi,et al.  Common Information and Secret Key Capacity , 2013, IEEE Transactions on Information Theory.