Coding for Positive Rate in the Source Model Key Agreement Problem

A two-party key agreement problem with public discussion, known as the source model problem, is considered. By relating key agreement to hypothesis testing, a new coding scheme is developed that yields a sufficient condition to achieve a positive secret-key (SK) rate in terms of Rényi divergence. The merits of this coding scheme are illustrated by applying it to an erasure model for Eve’s side information and by deriving an upper bound on Eve’s erasure probabilities for which the SK capacity is zero. This bound strictly improves on the best known single-letter lower bound on the SK capacity. Moreover, the bound is tight when Alice’s or Bob’s source is binary, which extends a previous result for a doubly symmetric binary source. The results motivate a new measure for the correlation between two random variables which is of independent interest.

[1]  Ueli Maurer,et al.  Protocols for Secret Key Agreement by Public Discussion Based on Common Information , 1992, CRYPTO.

[2]  P. Gács,et al.  Spreading of Sets in Product Spaces and Hypercontraction of the Markov Operator , 1976 .

[3]  Amin Gohari,et al.  From source model to quantum key distillation: An improved upper bound , 2014, 2014 Iran Workshop on Communication and Information Theory (IWCIT).

[4]  Ueli Maurer,et al.  Unconditionally Secure Key Agreement and the Intrinsic Conditional Information , 1999, IEEE Trans. Inf. Theory.

[5]  Chung Chan,et al.  On the Optimality of Secret Key Agreement via Omniscience , 2018, IEEE Transactions on Information Theory.

[6]  Peter Harremoës,et al.  Rényi Divergence and Kullback-Leibler Divergence , 2012, IEEE Transactions on Information Theory.

[7]  Anuran Makur,et al.  Comparison of Channels: Criteria for Domination by a Symmetric Channel , 2016, IEEE Transactions on Information Theory.

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

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

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

[11]  Ueli Maurer,et al.  Information-Theoretic Secret-Key Agreement: The Asymptotically Tight Relation Between the Secret-Key Rate and the Channel Quality Ratio , 2018, IACR Cryptol. ePrint Arch..

[12]  Himanshu Tyagi,et al.  Converses For Secret Key Agreement and Secure Computing , 2014, IEEE Transactions on Information Theory.

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

[14]  Jun Muramatsu,et al.  Secret Key Capacity and Advantage Distillation Capacity , 2006, 2006 IEEE International Symposium on Information Theory.

[15]  Amos Lapidoth,et al.  Two Measures of Dependence , 2016, 2016 IEEE International Conference on the Science of Electrical Engineering (ICSEE).

[16]  Hossam M. H. Shalaby,et al.  A note on the asymptotics of distributed detection with feedback , 1993, IEEE Trans. Inf. Theory.

[17]  Renato Renner,et al.  A property of the intrinsic mutual information , 2003, IEEE International Symposium on Information Theory, 2003. Proceedings..

[18]  Masahito Hayashi,et al.  Operational Interpretation of Rényi Information Measures via Composite Hypothesis Testing Against Product and Markov Distributions , 2015, IEEE Transactions on Information Theory.

[19]  Joel E. Cohen,et al.  Relative entropy under mappings by stochastic matrices , 1993 .

[20]  Renato Renner,et al.  New Bounds in Secret-Key Agreement: The Gap between Formation and Secrecy Extraction , 2003, EUROCRYPT.

[21]  Ueli Maurer,et al.  Information-Theoretic Key Agreement: From Weak to Strong Secrecy for Free , 2000, EUROCRYPT.

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

[23]  Chung Chan,et al.  Multiterminal Secret Key Agreement , 2014, IEEE Transactions on Information Theory.

[24]  Thomas M. Cover,et al.  Network Information Theory , 2001 .

[25]  Yury Polyanskiy,et al.  Hypothesis testing via a comparator , 2012, 2012 IEEE International Symposium on Information Theory Proceedings.

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

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

[28]  H. Vincent Poor,et al.  Channel Coding Rate in the Finite Blocklength Regime , 2010, IEEE Transactions on Information Theory.

[29]  Te Han,et al.  Hypothesis testing with multiterminal data compression , 1987, IEEE Trans. Inf. Theory.

[30]  Shun Watanabe,et al.  Key rate of quantum key distribution with hashed two-way classical communication , 2007, 2007 IEEE International Symposium on Information Theory.

[31]  Te Sun Han,et al.  The asymptotics of posterior entropy and error probability for Bayesian estimation , 1995, IEEE Trans. Inf. Theory.

[32]  A. Razborov.  Communication Complexity , 2011 .

[33]  Prakash Ishwar,et al.  The Infinite-Message Limit of Two-Terminal Interactive Source Coding , 2009, IEEE Transactions on Information Theory.

[34]  Chandra Nair,et al.  Upper concave envelopes and auxiliary random variables , 2013 .

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

[36]  Alon Orlitsky,et al.  Secrecy Enhancement via Public Discussion , 1993, Proceedings. IEEE International Symposium on Information Theory.

[37]  Himanshu Tyagi,et al.  A Bound For Multiparty Secret Key Agreement And Implications For A Problem Of Secure Computing , 2014, IACR Cryptol. ePrint Arch..

[38]  Sergio Verdú,et al.  Secret Key Generation With Limited Interaction , 2016, IEEE Transactions on Information Theory.

[39]  Maxim Raginsky,et al.  Strong Data Processing Inequalities and $\Phi $ -Sobolev Inequalities for Discrete Channels , 2014, IEEE Transactions on Information Theory.