On the Optimality of Secret Key Agreement via Omniscience

For the multiterminal secret key agreement problem under a private source model, it is known that the maximum key rate, i.e., the secrecy capacity, can be achieved through communication for omniscience, but the omniscience strategy can be strictly suboptimal in terms of minimizing the public discussion rate. While a single-letter characterization is not known for the minimum discussion rate needed for achieving the secrecy capacity, we derive single-letter lower bounds that yield some simple conditions for omniscience to be discussion-rate optimal. These conditions turn out to be enough to deduce the optimality of omniscience for a large class of sources, including the hypergraphical sources. We also extend our results to more general class of multiterminal sources with helpers and silent users.

[1]  Chung Chan,et al.  On Tightness of Mutual Dependence Upperbound for Secret-key Capacity of Multiple Terminals , 2008, ArXiv.

[2]  Thomas A. Courtade,et al.  Coded Cooperative Data Exchange for a Secret Key , 2014, IEEE Transactions on Information Theory.

[3]  Chung Chan.  Compressed Secret Key Agreement: Maximizing Multivariate Mutual Information per Bit , 2017, Entropy.

[4]  Yingbin Liang,et al.  Secret key capacity: Talk or keep silent? , 2015, 2015 IEEE International Symposium on Information Theory (ISIT).

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

[6]  Mokshay M. Madiman,et al.  Information Inequalities for Joint Distributions, With Interpretations and Applications , 2008, IEEE Transactions on Information Theory.

[7]  Chung Chan,et al.  Secret key agreement under discussion rate constraints , 2017, 2017 IEEE International Symposium on Information Theory (ISIT).

[8]  Chung Chan,et al.  The hidden flow of information , 2011, 2011 IEEE International Symposium on Information Theory Proceedings.

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

[10]  Chung Chan,et al.  Multivariate Mutual Information Inspired by Secret-Key Agreement , 2015, Proceedings of the IEEE.

[11]  Alexander Schrijver,et al.  Combinatorial optimization. Polyhedra and efficiency. , 2003 .

[12]  Wei Liu,et al.  The common information of N dependent random variables , 2010, 2010 48th Annual Allerton Conference on Communication, Control, and Computing (Allerton).

[13]  Raymond W. Yeung,et al.  Information Theory and Network Coding , 2008 .

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

[15]  Chung Chan,et al.  Clustering by multivariate mutual information under Chow-Liu tree approximation , 2015, 2015 53rd Annual Allerton Conference on Communication, Control, and Computing (Allerton).

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

[17]  Navin Kashyap,et al.  The communication complexity of achieving SK capacity in a class of PIN models , 2015, 2015 IEEE International Symposium on Information Theory (ISIT).

[18]  Kannan Ramchandran,et al.  Deterministic algorithm for the cooperative data exchange problem , 2011, 2011 IEEE International Symposium on Information Theory Proceedings.

[19]  Alexander Sprintson,et al.  On coding for cooperative data exchange , 2010, 2010 IEEE Information Theory Workshop on Information Theory (ITW 2010, Cairo).

[20]  Swanand Kadhe,et al.  Successive omniscience , 2015, 2015 International Symposium on Network Coding (NetCod).

[21]  Chung Chan,et al.  When is omniscience a rate-optimal strategy for achieving secret key capacity? , 2016, 2016 IEEE Information Theory Workshop (ITW).

[22]  Tie Liu,et al.  A marginal characterization of entropy functions for conditional mutually independent random variables (with application to Wyner's common information) , 2015, 2015 IEEE International Symposium on Information Theory (ISIT).

[23]  Raymond W. Yeung,et al.  A new outlook of Shannon's information measures , 1991, IEEE Trans. Inf. Theory.

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

[25]  Imre Csiszár,et al.  Common randomness and secret key generation with a helper , 2000, IEEE Trans. Inf. Theory.

[26]  Chung Chan,et al.  Info-Clustering: A Mathematical Theory for Data Clustering , 2016, IEEE Transactions on Molecular, Biological and Multi-Scale Communications.

[27]  Imre Csiszár,et al.  Information Theory - Coding Theorems for Discrete Memoryless Systems, Second Edition , 2011 .

[28]  Te Sun Han,et al.  Linear Dependence Structure of the Entropy Space , 1975, Inf. Control..

[29]  Chung Chan,et al.  Bounds on the communication rate needed to achieve SK capacity in the hypergraphical source model , 2016, 2016 IEEE International Symposium on Information Theory (ISIT).

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

[31]  Navin Kashyap,et al.  On the Public Communication Needed to Achieve SK Capacity in the Multiterminal Source Model , 2015, IEEE Transactions on Information Theory.

[32]  Chung Chan,et al.  Change of Multivariate Mutual Information: From Local to Global , 2018, IEEE Transactions on Information Theory.

[33]  Chung Chan,et al.  Duality between feature selection and data clustering , 2016, 2016 54th Annual Allerton Conference on Communication, Control, and Computing (Allerton).

[34]  Chung Chan,et al.  Incremental and decremental secret key agreement , 2016, 2016 IEEE International Symposium on Information Theory (ISIT).

[35]  Prakash Narayan,et al.  Perfect Omniscience, Perfect Secrecy, and Steiner Tree Packing , 2010, IEEE Transactions on Information Theory.

[36]  Satoru Fujishige,et al.  Polymatroidal Dependence Structure of a Set of Random Variables , 1978, Inf. Control..

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

[38]  Imre Csiszár,et al.  Secrecy Capacities for Multiterminal Channel Models , 2005, IEEE Transactions on Information Theory.

[39]  Alexander Barg,et al.  Secret Key Generation for a Pairwise Independent Network Model , 2008, IEEE Transactions on Information Theory.

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

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